Computing nice projections of convex polyhedra

DOI10.1142/S021819591100355XMaRDI QIDQ3007724zbMATH OpenFDO

Authors Md Ashraful Alam, Masud Hasan

Publication date 17 June 2011

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S021819591100355X

zbMATH Keywords

algorithmsconvex polyhedrageodesic Voronoi diagramnice orthogonal projectionsvisibility

Mathematics Subject Classification ID

Descriptive geometry (51N05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Computing Nice Projections of Convex Polyhedra
• scientific article; zbMATH DE number 4078149
• Finding optimal shadows of polytopes
• Efficient view point selection for silhouettes of convex polyhedra
• Polytope Projection and Projection Polytopes

Cites work

• Constructing Arrangements of Lines and Hyperplanes with Applications
• Finding optimal shadows of polytopes
• Voronoi diagrams on the sphere

Cited in

(10)

• Finding optimal shadows of polytopes
• Complexity of projected images of convex subdivisions
• Projection onto a polyhedron that exploits sparsity
• Improved projection for CAD's of R ³
• A Simultaneous Iterative Method for Computing Projections on Polyhedra
• scientific article; zbMATH DE number 4078149 (Why is no real title available?)
• Computing Nice Projections of Convex Polyhedra
• Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections
• Efficient view point selection for silhouettes of convex polyhedra
• A big-M type method for the computation of projections onto polyhedrons

This page was built for publication: Computing nice projections of convex polyhedra

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