On triangulating three-dimensional polygons

DOI10.1016/S0925-7721(98)00005-4MaRDI QIDQ1392846zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On the difficulty of triangulating three-dimensional nonconvex polyhedra
• Rectangular partition is polynomial in two dimensions but NP-complete in three
• Computational geometry column 40
• On the complexity of approximating and illuminating three-dimensional convex polyhedra

Cites work

• scientific article; zbMATH DE number 51258 (Why is no real title available?)
• scientific article; zbMATH DE number 1037084 (Why is no real title available?)
• scientific article; zbMATH DE number 791397 (Why is no real title available?)
• scientific article; zbMATH DE number 3048810 (Why is no real title available?)
• Filling gaps in the boundary of a polyhedron
• Incremental topological flipping works for regular triangulations
• On a class of \(O(n^ 2)\) problems in computational geometry
• On the difficulty of triangulating three-dimensional nonconvex polyhedra
• Piecewise-Linear Interpolation between Polygonal Slices
• Topologically sweeping an arrangement
• Triangulating a simple polygon in linear time

Cited in

(10)

• Nonobtuse triangulation of polygons
• scientific article; zbMATH DE number 3917142 (Why is no real title available?)
• Detecting tetrahedralizations of a set of line segments
• Partitioning a planar assembly into two connected parts is NP-complete
• GLUING TECHNIQUES IN TRIANGULAR GEOMETRY
• scientific article; zbMATH DE number 1979508 (Why is no real title available?)
• Triangulating a polygon in parallel
• On the difficulty of triangulating three-dimensional nonconvex polyhedra
• (Non)Existence of pleated folds: How paper folds between creases
• Constructing convex 3-polytopes from two triangulations of a polygon

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1392846)