Constructing convex 3-polytopes from two triangulations of a polygon

DOI10.1016/j.comgeo.2004.01.006zbMath1065.52009OpenAlexW2083123226MaRDI QIDQ598553

Sumit K. Garg

Publication date: 6 August 2004

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

Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.01.006

zbMATH Keywords

projectionslinear programmingtriangulationscomputational geometrygraph drawingconvex polytopesrealizationsconvexity theory

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

RECONSTRUCTING CONVEX POLYGONS AND CONVEX POLYHEDRA FROM EDGE AND FACE COUNTS IN ORTHOGONAL PROJECTIONS ⋮ Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections

Cites Work

• Unnamed Item
• Unnamed Item
• Checking the convexity of polytopes and the planarity of subdivisions
• Checking geometric programs or verification of geometric structures
• The many facets of linear programming
• Convex hulls of spatial polygons with a fixed convex projection

This page was built for publication: Constructing convex 3-polytopes from two triangulations of a polygon