CCCG
2010
14 years 29 days ago
2010
According to a classical result of Szemer
CCCG
2010
14 years 29 days ago
2010
Consider an arrangement of equilateral non-overlapping translated triangles in the plane and two points S and T so that the segment ST is parallel to a side of each of the triangl...
CCCG
2010
14 years 29 days ago
2010
Extending a bijection recently introduced by Poulalhon and Schaeffer [15] for triangulations of the sphere we design an efficient algorithm for encoding (topological) triangulatio...
CCCG
2010
14 years 29 days ago
2010
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we...
CCCG
2010
14 years 29 days ago
2010
Given k labelings of a finite d-dimensional grid, define the combined distance between two labels to be the sum of the 1-distance between the two labels in each labeling. We prese...
CCCG
2010
14 years 29 days ago
2010
The projection median of a finite set of points in R2 was introduced by Durocher and Kirkpatrick [5]. They proved the projection median in R2 provides a better approximation of th...
CCCG
2010
14 years 29 days ago
2010
We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by ha...
CCCG
2010
14 years 29 days ago
2010
The cluster connecting problem inside a simple polygon is introduced in this paper. The problem is shown to be NP-complete. A log n-factor approximation algorithm is proposed.
CCCG
2010
14 years 29 days ago
2010
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...