Efficient view point selection for silhouettes of convex polyhedra

The silhouette of polyhedra is an important primitive in application areas such as machine vision and computer graphics. In this paper, we study how to select view points of convex polyhedra such that the silhouette satisfies certain properties. Specifically, we give algorithms to find all projections of a convex polyhedron such that a given set of edges, faces and/or vertices appear on the silhouette.

[1]  Ivan J. Balaban,et al.  An optimal algorithm for finding segments intersections , 1995, SCG '95.

[2]  K. Sugihara Machine interpretation of line drawings , 1986, MIT Press series in artificial intelligence.

[3]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[4]  Raimund Seidel,et al.  Constructing Arrangements of Lines and Hyperplanes with Applications , 1986, SIAM J. Comput..

[5]  Aldo Laurentini,et al.  How Many 2D Silhouettes Does It Take to Reconstruct a 3D Object? , 1997, Comput. Vis. Image Underst..

[6]  Don Braggins Illumination for machine vision , 2000 .

[7]  R. Pollack,et al.  Geometric Transversal Theory , 1993 .

[8]  Micha Sharir,et al.  The Common Exterior of Convex Polygons in the Plane , 1997, Comput. Geom..

[9]  Micha Sharir,et al.  Applications of a new space-partitioning technique , 1993, Discret. Comput. Geom..

[10]  J J Koenderink,et al.  What Does the Occluding Contour Tell Us about Solid Shape? , 1984, Perception.

[11]  Robert D. Schiffenbauer A Survey of Aspect Graphs , 2001 .

[12]  Prosenjit Bose,et al.  Drawing Nice Projections of Objects in Space , 1995, Graph Drawing.

[13]  Luc Jaulin,et al.  Reconstructing 3D Objects from Silhouettes with Unknown Viewpoints: The Case of Planar Orthographic Views , 2003, CIARP.

[14]  David Avis,et al.  Reverse Search for Enumeration , 1996, Discret. Appl. Math..

[15]  Andrea Bottino,et al.  Introducing a New Problem: Shape-from-Silhouette when the Relative Positions of the Viewpoints is Unknown , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  Peter Eades,et al.  Finding the Best Viewpoints for Three-Dimensional Graph Drawings , 1997, GD.

[17]  Leonidas J. Guibas,et al.  The upper envelope of piecewise linear functions: Algorithms and applications , 2015, Discret. Comput. Geom..

[18]  Mark R. Stevens,et al.  Interleaving 3D model feature prediction and matching to support multi-sensor object recognition , 1996, Proceedings of 13th International Conference on Pattern Recognition.

[19]  John W. V. Miller,et al.  Very low cost in-process gauging system , 1998, Other Conferences.

[20]  Farzin Mokhtarian,et al.  Silhouette-based occluded object recognition through curvature scale space , 1997, Machine Vision and Applications.

[21]  Emo Welzl,et al.  Contour Edge Analysis for Polyhedron Projections , 1997, Geometric Modeling.

[22]  Leonidas J. Guibas,et al.  On incremental rendering of silhouette maps of polyhedral scene , 2000, SODA '00.

[23]  W. Brent Seales,et al.  Viewpoint from occluding contour , 1992, CVGIP Image Underst..

[24]  Charles R. Dyer,et al.  Visibility, occlusion, and the aspect graph , 1990, International Journal of Computer Vision.

[25]  Jarek Rossignac,et al.  Hoops: 3D Curves as Conservative Occluders for Cell‐Visibility , 2001, Comput. Graph. Forum.

[26]  Charles R. Dyer,et al.  3-D multiview object representations for model-based object recognition , 1987, Pattern Recognit..

[27]  Michael T. Goodrich,et al.  Efficient perspective-accurate silhouette computation and applications , 2001, SCG '01.

[28]  Gershon Elber,et al.  Output sensitive extraction of silhouettes from polygonal geometry , 1999, Proceedings. Seventh Pacific Conference on Computer Graphics and Applications (Cat. No.PR00293).

[29]  Godfried T. Toussaint,et al.  Nice Perspective Projections , 2001, J. Vis. Commun. Image Represent..