31 search results - page 3 / 7 » An algorithm for the MaxMin area triangulation of a convex p... |
SODA
2001
ACM
13 years 7 months ago
2001
ACM
It is well known that the Delaunay Triangulation is a spanner graph of its vertices. In this paper we show that any bounded aspect ratio triangulation in two and three dimensions ...
COMPGEOM
1999
ACM
13 years 10 months ago
1999
ACM
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...
MVA
2007
13 years 7 months ago
2007
This paper presents a new approach to extracting and representing structural features of images. The approach is based on both a region-based analysis and a contour-based analysis...
SMA
2008
ACM
13 years 5 months ago
2008
ACM
In this paper we consider the problem of monitoring an art gallery modeled as a polygon, the edges of which are arcs of curves. We consider two types of guards: edge guards (these...
CCCG
2003
13 years 7 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...