On triangulating three-dimensional polygons
From MaRDI portal
Publication:1392846
DOI10.1016/S0925-7721(98)00005-4zbMath0901.68199MaRDI QIDQ1392846
David Eppstein, Gill Barequet, Matthew T. Dickerson
Publication date: 2 August 1998
Published in: Computational Geometry (Search for Journal in Brave)
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Cites Work
- Filling gaps in the boundary of a polyhedron
- Topologically sweeping an arrangement
- Triangulating a simple polygon in linear time
- On the difficulty of triangulating three-dimensional nonconvex polyhedra
- On a class of \(O(n^ 2)\) problems in computational geometry
- Incremental topological flipping works for regular triangulations
- Piecewise-Linear Interpolation between Polygonal Slices
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item