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...
Mu Hong, Thomas W. Sederberg, Kris Klimaszewski, K...
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 ...
Julien Basch, Jeff Erickson, Leonidas J. Guibas, J...
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...
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]...
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...