31 search results - page 4 / 7 » cccg 2003 |
CCCG
2003
13 years 8 months ago
2003
G. Leibon and D. Letscher showed that for general and sufficiently dense point set its Delaunay triangulation and Voronoi diagram in Riemannian manifold exist. They also proposed ...
CCCG
2003
13 years 8 months ago
2003
We pose a monotonicity conjecture on the number of pseudo-triangulations of any planar point set, and check it on two prominent families of point sets, namely the so-called double...
CCCG
2003
13 years 8 months ago
2003
We present a novel k-dimensional range search algorithm for reporting all k-d rectangles from a set D of size n intersecting a query rectangle. Our algorithm uses 2kd tries to sol...
CCCG
2003
13 years 8 months ago
2003
We consider the problem of finding the shortest curve in the plane that has unit width. This problem was first posed as the “river shore” puzzle by Ogilvy (1972) and is rela...
CCCG
2003
13 years 8 months ago
2003
We show several natural questions about hinged dissections of polygons to be PSPACE-hard. The most basic of these is: Given a hinged set of pieces and two configurations for them...