122
click to vote
CCCG
15 years 2 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...
115
click to vote
CCCG
15 years 2 months ago
2003 
Morphing algorithms aim to construct visually pleasing interpolations (morphs) between 2D or 3D shapes. One of the desirable properties of a morph is avoiding selfintersections of...
128
click to vote
CCCG
15 years 2 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
15 years 2 months ago
2003 CCCG
15 years 2 months ago
2003
The problem of determining whether a polyhedron has a constrained Delaunay tetrahedralization is NP-complete. However, if no five vertices of the polyhedron lie on a common spher...
|
Computational Geometry