Detecting tetrahedralizations of a set of line segments

DOI10.1016/J.JALGOR.2004.04.006MaRDI QIDQ4826761zbMATH OpenOpenAlexFDO

Authors Boting Yang, Cao An Wang

Publication date 12 November 2004

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jalgor.2004.04.006

zbMATH Keywords

Computational geometryNP-completeTetrahedralization

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1979508
• Tetrahedrizing point sets in three dimensions
• On triangulating three-dimensional polygons
• On the difficulty of triangulating three-dimensional nonconvex polyhedra
• Hamiltonian tetrahedralizations with Steiner points

Cited in

(2)

• A method for detecting structure in polyhedra
• scientific article; zbMATH DE number 1979508 (Why is no real title available?)

This page was built for publication: Detecting tetrahedralizations of a set of line segments

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