A subset of the d-dimensional Euclidean space having nonempty interior is called a spindle convex body if it is the intersection of (finitely or infinitely many) congruent d-dimensional closed balls. The spindle convex body is called a “fat” one, if it contains the centers of its generating balls. The main result of this paper is a proof of the Illumination Conjecture for “fat” spindle convex b...

Abstract The centre of mass (CM) is a key concept that facilitates the understanding various physics topics and solution problems. This study’s aim to present an activity for students experimentally determine location CM bodies with outside body. Thus, example will be presented allow understand situation where body, find bodies, generate new examples body themselves. For at-rest common experime...

The internal mechanism used for a dependence test constrains its accuracy and determines its speed. The internal mechanism used for our Access Region Test (ART) is fundamentally different from that used in any other dependence test, and therefore its constraints and characteristics are likewise different. In this paper, we briefly describe our novel descriptor for representing memory accesses, ...

We consider the problem of identifying one of a set of polygonal models in the plane using point probes and nger probes. In particular, we give strategies for using a minimum number of nger probes to determine a nite number of possible locations of an unknown interior point p in one of the models. A nger probe takes as input an interior point p of a polygon P and a direction , and it outputs th...

Two-lattice polyhedra are a special class of lattice polyhedra that include network 4ow polyhedra, fractional matching polyhedra, matroid intersection polyhedra, the intersection of two polymatroids, etc. In this paper we show that the maximum sum of components of a vector in a 2-lattice polyhedron is equal to the minimum capacity of a cover for the polyhedron. For special classes of 2-lattice ...

The paper presents a new robust method for finding points of intersection of line segments in the plane. In this method the subdivision of the plane based on the Delaunay triangulation plays the main role. First, the Delaunay triangulation spanning the end points of line segments is constructed. Next, for line segments that are not realized by Delaunay edges, midpoints are inserted recursively ...

In CAD/CAM modeling, objects are represented using the Boundary Representation (ANSI Brep) model. Detection of possible intersection between objects can be based on the objects’ boundaries (i.e., triangulated surfaces), and computed using triangle-triangle intersection. Usually only a cross intersection algorithm is needed; however, it is beneficial to have a single robust and fast intersection...

This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number of distributed scheduling algorithms for wireless networks have emerged. Due to their distributed operation, these algorithms can achieve only a fraction of the maximum possible throughput. As an alternative to increasing the th...

The sphericity sph(G) of a graph G is the minimum dimension d for which G is the intersection graph of a family of congruent spheres in Rd . The edge clique cover number (G) is the minimum cardinality of a set of cliques (complete subgraphs) that covers all edges of G. We prove that if G has at least one edge, then sph(G) (G). Our upper bound remains valid for intersection graphs defined by bal...