Complexity of computing nice viewpoints of objects in space

A polyhedral object in 3-dimensional space is often well represented by a set of points and line segments that act as its features. By a nice viewpoint of an object we mean a projective view in which all (or most) of the features of the object, relevant for some task, are clearly visible. Such a view is often called a non-degenerate view or projection. In this paper we are concerned with computing non-degenerate orthogonal and perspective projections of sets of points and line segments (objects) in 3-dimensional space. We outline the areas in which such problems arise, discuss recent research on the computational complexity of these problems, illustrate the fundamental ideas used in the design of algorithms for computing non-degenerate projections, and provide pointers to the literature where the results can be found.

[1]  Kurt Mehlhorn,et al.  On degeneracy in geometric computations , 1994, SODA '94.

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

[3]  Godfried T. Toussaint The Erdös-Nagy theorem and its ramifications , 1999, CCCG.

[4]  Azriel Rosenfeld,et al.  3-D Shape Recovery Using Distributed Aspect Matching , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Sven J. Dickinson,et al.  Active Object Recognition Integrating Attention and Viewpoint Control , 1994, Comput. Vis. Image Underst..

[6]  Godfried T. Toussaint,et al.  Perspective projections and removal of degeneracies , 1998, CCCG.

[7]  J.B. Burns,et al.  View Variation of Point-Set and Line-Segment Features , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  Atsuyuki Okabe,et al.  Models of Spatial Processes , 1978 .

[9]  Satoru Kawai,et al.  A simple method for computing general position in displaying three-dimensional objects , 1988, Comput. Vis. Graph. Image Process..

[10]  Godfried T. Toussaint,et al.  On Removing Non-degeneracy Assumptions in Computational Geometry , 1997, CIAC.

[11]  Sven J. Dickinson,et al.  A quantitative analysis of view degeneracy and its use for active focal length control , 1995, Proceedings of IEEE International Conference on Computer Vision.

[12]  Peter R. Keller,et al.  Visual cues - practical data visualization , 1993 .

[13]  Michael E. Houle,et al.  Approximation Algorithms for Finding Best Viewpoints , 1998, GD.

[14]  Azriel Rosenfeld,et al.  From volumes to views: An approach to 3-D object recognition , 1992, CVGIP Image Underst..

[15]  David S. Johnson,et al.  Crossing Number is NP-Complete , 1983 .

[16]  Chee Yap Symbolic treatment of geometric degeneracies: Proceedings of the International IFIPS Conference on System Modeling and Optimization. Tokyo, 1987 , 1987 .

[17]  John F. Canny,et al.  A General Approach to Removing Degeneracies , 1995, SIAM J. Comput..

[18]  G. Toussaint The Erd} Os-nagy Theorem and Its Ramiications , 1999 .

[19]  Ioannis G. Tollis,et al.  Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..

[20]  Michael Werman,et al.  On View Likelihood and Stability , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[21]  Raimund Seidel,et al.  Efficient Perturbations for Handling Geometric Degeneracies , 1997, Algorithmica.

[22]  Sven J. Dickinson,et al.  A Computational Model of View Degeneracy , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

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

[24]  Lance Williams,et al.  View Interpolation for Image Synthesis , 1993, SIGGRAPH.

[25]  Azriel Rosenfeld,et al.  Polygons in Three Dimensions , 1994, J. Vis. Commun. Image Represent..

[26]  A. Philip McMahon,et al.  On the Rationalization of Sight , 1938 .

[27]  Roberto Tamassia,et al.  On the Compuational Complexity of Upward and Rectilinear Planarity Testing , 1994, Graph Drawing.

[28]  John R. Kender,et al.  What is a 'Degenerate' View? , 1987, IJCAI.

[29]  K. Millett KNOTTING OF REGULAR POLYGONS IN 3-SPACE , 1994 .

[30]  Roberto Tamassia,et al.  On the Computational Complexity of Upward and Rectilinear Planarity Testing , 1994, SIAM J. Comput..

[31]  Francisco Gómez Martín Aspectos geométricos y computacionales de las proyecciones , 1996 .