Nice Perspective Projections

Abstract A polyhedral object in three-dimensional space is often well represented by a set of points and line segments that act as its features. By a nice perspective projection of an object we mean a projection that gives an image in which the features of the object, relevant for some task, are visible without ambiguity. In this paper we consider the problem of computing a variety of nice perspective projections of three-dimensional objects such as simple polygonal chains, wire-frame drawings of graphs, and geometric rooted trees. These problems arise in areas such as computer vision, computer graphics, graph drawing, knot theory, and computational geometry.

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

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

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

[4]  Richard S. Gallagher.  Computer Visualization: Graphics Techniques for Scientific and Engineering Analysis , 1994 .

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

[6]  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.

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

[8]  D. M. Y. Sommerville.  Analytical geometry of three dimensions , 1934 .

[9]  Bernard Chazelle.  An optimal convex hull algorithm and new results on cuttings , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

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

[11]  Thomas Ottmann,et al.  Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.

[12]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

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

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

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

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

[17]  Nimrod Megiddo,et al.  Linear Programming in Linear Time When the Dimension Is Fixed , 1984, JACM.

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

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

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

[21]  Prosenjit Bose,et al.  Drawing Nice Projections of Objects in Space , 1999, J. Vis. Commun. Image Represent..