Drawing Nice Projections of Objects in Space

Given a polygonal object (simple polygon, geometric graph, wire-frame, skeleton or more generally a set of line segments) in three-dimensional Euclidean space, we consider the problem of computing a variety of “nice” parallel (orthographic) projections of the object. We show that given a general polygonal object consisting ofnline segments in space, deciding whether it admits acrossing-freeprojection can be done inO(n2logn+k) time andO(n2+k) space, wherekis the number of edge intersections of forbidden quadrilaterals (i.e., a set of directions that admits a crossing) and varies from zero toO(n4). This implies for example that, given a simple polygon in 3-space, we can determine if there exists a plane on which the projection is a simple polygon, within the same complexity. Furthermore, if such a projection does not exist, aminimum-crossingprojection can be found inO(n4) time and space. We show that an object always admits a regular projection (of interest to knot theory) and that such a projection can be obtained inO(n2) time and space or inO(n3) time and linear space. A description of the set of all directions which yield regular projections can be computed inO(n3logn+k) time, wherekis the number of intersections of a set of quadratic arcs on the direction sphere and varies fromO(n3) toO(n6). Finally, when the objects are polygons and trees in space, we considermonotonicprojections, i.e., projections such that every path from the root of the tree to every leaf is monotonic in a common direction on the projection plane. We solve a variety of such problems. For example, given a polygonal chainP, we can determine inO(n) time ifPis monotonic on the projection plane, and inO(nlogn) time we can findallthe viewing directions with respect to whichPis monotonic. In addition, inO(n2) time, we can determine all directions with respect to which a given tree or simple polygon is monotonic.

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

[2]  Farhad Shahrokhi,et al.  Crossing Numbers of Graphs, Lower Bound Techniques , 1994, GD.

[3]  Godfried T. Toussaint,et al.  Movable Separability of Sets , 1985 .

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

[5]  David Eppstein,et al.  On triangulating three-dimensional polygons , 1996, SCG '96.

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

[7]  Charles Livingston,et al.  Knot Theory by Charles Livingston , 1993 .

[8]  Nancy M. Amato,et al.  Computing faces in segment and simplex arrangements , 1995, STOC '95.

[9]  Gilbert Strang.  The Width of a Chair , 1982 .

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

[11]  Chi-Yuan Lo,et al.  Time efficient VLSI artwork analysis algorithms in GOALIE2 , 1988, DAC '88.

[12]  Raimund Seidel,et al.  Finding the optimal shadows of a convex polytope , 1985, SCG '85.

[13]  M. Carter.  Computer graphics: Principles and practice , 1997 .

[14]  Jirí Matousek,et al.  Complexity of Projected Images of Convex Subdivisions , 1994, Comput. Geom..

[15]  Nimrod Megiddo,et al.  Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

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

[17]  D. Souvaine,et al.  The contour problem for restricted-orientation polygons , 1992 .

[18]  Ying Sun,et al.  Reconstruction of 3-D Binary Tree-Like Structures From Three Mutually Orthogonal Projections , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[19]  Karol Borsuk.  Multidimensional Analytic Geometry , 1969 .

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

[21]  Roberto Tamassia,et al.  Efficient Point Location in a Convex Spatial Cell-Complex , 1989, SIAM J. Comput..

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

[23]  Franco P. Preparata,et al.  Plane-sweep algorithms for intersecting geometric figures , 1982, CACM.

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

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

[26]  Harold Neville Vazeille Temperley,et al.  Graph theory and applications , 1981 .

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

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

[29]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[30]  David Avis,et al.  Algorithms for line transversals in space , 1987, SCG '87.

[31]  David Avis,et al.  Polyhedral line transversals in space , 1988, Discret. Comput. Geom..