CCCG
2003
14 years 25 days ago
2003
An important problem in geometric compression is to find succinct representations (encoding schemes) for the conectivity of polygonal meshes. In this note, we show that the encod...
CCCG
2003
14 years 25 days ago
2003
In this paper we consider the problem of computing the closest point to the boundary of a circle among a set S of n points. We present two algorithms to solve this problem. One al...
CCCG
2003
14 years 25 days ago
2003
CCCG
2003
14 years 25 days ago
2003
The key step in the construction of the Delaunay triangulation of a finite set of planar points is to establish correctly whether a given point of this set is inside or outside t...
CCCG
2003
14 years 25 days ago
2003
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maximal sets of nonintersecting diagonals that subdivide the interior of the polygon...
CCCG
2003
14 years 25 days ago
2003
In this paper, we show that the shortest path between two points in a grid-like arrangement of two pencils of lines has a particularly simple structure, as was previously conjectu...
CCCG
2003
14 years 25 days ago
2003
CCCG
2003
14 years 25 days 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...
CCCG
2003
14 years 25 days ago
2003
A convex polyhedron P is equiprojective if, for some k, the orthogonal projection (or “shadow”) of P in every direction, except those directions parallel to faces of P, is a k...
CCCG
2003
14 years 25 days ago
2003
Suppose one has a line arrangement and one wants to find a shortest path from one point lying on a line of the arrangement to another such point. We look at a special case: the a...