Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections

DOI10.1007/978-3-540-77050-3_33zbMath1135.68595OpenAlexW1574320314MaRDI QIDQ5458852

Masud Hasan, Therese C. Biedl, Alejandro López-Ortiz

Publication date: 24 April 2008

Published in: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77050-3_33

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructing convex 3-polytopes from two triangulations of a polygon
• Edge-skeletons in arrangements with applications
• Efficient algorithm for the reconstruction of 3D objects from orthographic projections
• On triangulating planar graphs under the four-connectivity constraint

This page was built for publication: Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections