Sciweavers

CCCG
2010
14 years 2 months ago
The traveling salesman problem for lines and rays in the plane
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...
Adrian Dumitrescu
CCCG
2010
14 years 2 months ago
Robot kabaddi
Kyle Klein, Subhash Suri
CCCG
2010
14 years 2 months ago
On a dispersion problem in grid labeling
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...
Minghui Jiang, Vincent Pilaud, Pedro J. Tejada
CCCG
2010
14 years 2 months ago
The projection median of a set of points in Rd
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...
Riddhipratim Basu, Bhaswar Bhattacharya, Tanmoy Ta...
CCCG
2010
14 years 2 months ago
Coloring geometric hypergraph defined by an arrangement of half-planes
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...
Radoslav Fulek
CCCG
2010
14 years 2 months ago
Cluster connecting problem inside a polygon
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.
Sanjib Sadhu, Arijit Bishnu, Subhas C. Nandy, Part...
CCCG
2010
14 years 2 months ago
3d local algorithm for dominating sets of unit disk graphs
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 ...
Alaa Eddien Abdallah, Thomas Fevens, Jaroslav Opat...
CCCG
2010
14 years 2 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
CCCG
2010
14 years 2 months ago
Existence of zone diagrams in compact subsets of uniformly convex spaces
A zone diagram is a relatively new concept which has emerged in computational geometry and is related to Voronoi diagrams. Formally, it is a fixed point of a certain mapping, and ...
Eva Kopecká, Daniel Reem, Simeon Reich
CCCG
2010
14 years 2 months ago
On the perimeter of fat objects
We show that the size of the perimeter of (, )-covered objects is a linear function of the diameter. Specifically, for an (, )-covered object O, per(O) c diam(O) sin2 , for a pos...
Prosenjit Bose, Otfried Cheong, Vida Dujmovic