233 search results - page 36 / 47 » cccg 2007 |
CCCG
2003
13 years 8 months 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
13 years 8 months 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
13 years 8 months 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
13 years 8 months 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
13 years 8 months ago
2003
We consider the problem of constructing binary space partitions for the set P of d-dimensional objects in d-dimensional space. There are several classes of objects defined for su...