On triangulating three-dimensional polygons

DOI10.1016/S0925-7721(98)00005-4zbMath0901.68199OpenAlexW2211057196MaRDI QIDQ1392846

Gill Barequet, David Eppstein, Matthew T. Dickerson

Publication date: 2 August 1998

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(98)00005-4

zbMATH Keywords

three-dimensional polygon

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

(Non)Existence of pleated folds: How paper folds between creases

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: On triangulating three-dimensional polygons