83 search results - page 3 / 17 » Acute Triangulations of Polygons |
IJCGA
1998
14 years 11 months ago
1998
This paper presents a new method for reconstructing piecewise linear surfaces from planar polygonal contours that branch. For non-branching contours, experience has shown that the...
92
Voted
COMGEO
2004
ACM
14 years 11 months ago
2004
ACM
We design a kinetic data structure for detecting collisions between two simple polygons in motion. In order to do so, we create a planar subdivision of the free space between the ...
SIGGRAPH
2000
ACM
15 years 4 months ago
2000
ACM
Most schemes to compress the topology of a surface mesh have been developed for the lowest common denominator: triangulated meshes. We propose a scheme that handlesthe topology of...
76
Voted
EJC
1998
14 years 11 months ago
1998
in Proceedings of EuroCG, Berlin, M¨arz 2001, pp. 142–145. [14] Branched coverings, triangulations, and 3-manifolds, (mit Ivan Izmestiev). Adv. Geometry, 3:191–225, 2003. [15]...
107
Voted
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...