Efficient view point selection for silhouettes of convex polyhedra
From MaRDI portal
Publication:634248
DOI10.1016/j.comgeo.2011.04.001zbMath1221.65056MaRDI QIDQ634248
Alejandro López-Ortiz, Masud Hasan, Therese C. Biedl
Publication date: 2 August 2011
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2011.04.001
projections; algorithms; computer graphics; convex polyhedra; views; machine vision; geometric transversal; silhouette
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
Related Items
Cites Work
- The upper envelope of piecewise linear functions: Algorithms and applications
- The common exterior of convex polygons in the plane
- On the connected components of the space of line transversals to a family of convex sets
- Reverse search for enumeration
- RECONSTRUCTING CONVEX POLYGONS AND CONVEX POLYHEDRA FROM EDGE AND FACE COUNTS IN ORTHOGONAL PROJECTIONS
- Viewpoint from occluding contour
- Constructing Arrangements of Lines and Hyperplanes with Applications
- An optimal algorithm for intersecting line segments in the plane
- Efficient perspective-accurate silhouette computation and applications
- Unnamed Item
- Unnamed Item
- Unnamed Item