CCCG
2010
13 years 11 months ago
2010
Let S be a set of points in the plane in general position. A triangulation of S will be called even if all the points of S have an even degree. We show how to construct a triangul...
CCCG
2010
13 years 11 months ago
2010
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
CCCG
2010
13 years 11 months ago
2010
In this paper we devise a new geometric spanner based on a generalization of the known Stable Roommates algorithm. This spanner is on the "path" between the Yao graph an...
CCCG
2010
13 years 11 months ago
2010
CCCG
2010
13 years 11 months ago
2010
Given a set B of n blue points in general position, we say that a set of red points R blocks B if in the Delaunay triangulation of B R there is no edge connecting two blue points...
CCCG
2010
13 years 11 months ago
2010
We prove several new results concerning k-sets of point sets on the 2-sphere (equivalently, for signed point sets in the plane) and k-sets in 3-space. Specific results include sph...
CCCG
2010
13 years 11 months ago
2010
A random polygon is the convex hull of uniformly distributed random points in a convex body K R2 . General upper bounds are established for the variance of the area of a random p...
CCCG
2010
13 years 11 months ago
2010
I first met Paul Erd
CCCG
2010
13 years 11 months ago
2010
We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k-center problem, arising ...
CCCG
2010
13 years 11 months ago
2010
We present a simple algorithm for computing straight skeletons of planar straight-line graphs. We exploit the relation between motorcycle graphs and straight skeletons, and introd...