On triangulating three-dimensional polygons

Gill Barequet, Matthew T. Dickerson, and David Eppstein
Computational Geometry Theory & Applications 10(3):155–170, Jun 1998
Proc. 12th Symp. Computational Geometry, ACM, May 1996, pp. 38–47
Mathematical Reviews 99a:68168
ftp://ftp.cs.technion.ac.il/pub/barequet/papers/3dt-socg96.ps.gz
http://dx.doi.org/10.1016/S0925-7721(98)00005-4

Cited by:

• $r$-regular shape reconstruction from unorganized points
• Drawing nice projections of objects in space
• Repairing CAD models
• RSVP: a geometric toolkit for controlled repair of solid models
• DCEL: a polyhedral database and programming environment
• On the number of star-shaped polygons and polyhedra
• History consideration in reconstructing polyhedral surfaces from parallel slice
• Multilevel sensitive reconstruction of polyhedral surfaces from parallel slices
• Simplification Envelopes
• A new virtual reality approach for planning of cardiac interventions
• FIST: Fast industrial-strength triangulation of polygons
• Shape understanding by contour-driven retiling
• Filling holes in meshes
• Topology-free cut-and-paste editing over meshes
• Triangle-mesh simplification using error polyhedra