Drawing Nice Projections of Objects in Space

Bose, Prosenjit and Gomez, Francisco and Ramos, Pedro and Toussaint, Godfried (1996) Drawing Nice Projections of Objects in Space. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 52-63 (Official URL: http://dx.doi.org/10.1007/BFb0021790).

Full text not available from this repository.

Abstract

Item Type:Conference Paper
Additional Information:10.1007/BFb0021790
Classifications:Z Theory > Z.250 Geometry
P Styles > P.060 3D
G Algorithms and Complexity > G.560 Geometry
ID Code:48

Repository Staff Only: item control page

References

Amato, N. M., Goodrich, M.T. and Ramos, E.A., "Computing faces in segment and simplex arrangements," Proc. Symp. on the Theory of Computing, 1995.

Avis, D., and Wenger, R., "Polyhedral line transversals in space," Discrete and Computational Geometry, vol.3, 1988, pp.257-265.

Avis, D., and Wenger, R., "Algorithms for line stabbers in space," Proc. Third ACM Symp. on Computational Geometry, 1987, pp.300-307.

Balaban I.J., "An optimal algorithm for finding segments intersections," Proc. ACM Symp. on Comp. Geom., Vancouver, Canada, June 1995, pp. 211-219.

Bentley, J.L. and Ottmann, T.A., "Algorithms for reporting and counting geometric intersections", IEEE Trans. Comput. vol. 8, pp. 643-647, 1979.

Bhattacharya, P. and Rosenfeld, A., "Polygons in three dimensions," J. of Visual Communication and Image Representation, vol. 5, June 1994, pp. 139-147.

Bondy, J. and Murty, U.S.R., Graph Theory with Applications, Elsevier Science, New York, 1976.

Burger, T., Gritzmann, P. and Klee, V., "Polytope projection and projection polytopes," TR No. 95-14, Dept. Mathematics, Trier University.

Chazelle, B. and Edelsbrunner, H., "An optimal algorithm for intersecting line segments in the plane," J. ACM, vol. 39, 1992, pp. 1-54.

Chiang, K., Nahar, S., and Lo, C., "Time-efficient VLSI artwork analysis algorithms in GOALIE2", IEE Trans. CAD, vol. 39, pp. 640-647, 1989.

Colin, C., "Automatic computation of a scene's good views," MICAD'90, Paris, February, 1990.

Di Battista, G., Eades, P., Tamassia, R. and Tollis, I.G., "Algorithms for drawing graphs: an annotated bibliography," Computational Geometry: Theory and Applications, vol. 4, 1994, pp. 235-282.

Foley, J.D., van Dam, A., Feiner, S.K. and Hughes, J.F., Computer Graphics: Principles and Practice, Addison-Wesley, 1990.

Gallagher, R.S., Ed., Computer Visualization: Graphic Techniques for Engineering and Scientific Analysis, IEEE Computer Society Press, 1995.

Garey, M.R., and Johnson, D.S., "Crossing number is NP-complete," SIAM J. Alg. Discrete Methods, vol.4, 1983, pp. 312-316.

Garg, A. and Tamassia, R., "On the computational complexity of upward and rectilinear planarity testing," eds., R. Tamassia and I.G. Tollis, Proc. Graph Drawing'94, LNCS 894, Springer-Verlag, 1995, 286-297.

Hirata, T., Matousek, J., Tan, X.-H. and Tokuyama, T., "Complexity of projected images of convex subdivisions," Comp. Geom., vol.4., 1994, pp. 293-308.

Kamada, T. and Kawai, S., "A simple method for computing general position in displaying three-dimensional objects," Computer Vision, Graphics and Image Processing, vol. 41, 1988, pp. 43-56.

Keller, P.R. & Keller, M.M., Visual Cues: Practical Data Visualization, IEEE Computer Society Press, 1993.

Livingston, C., Knot Theory, The Carus Mathematical Monographs, vol. 24, The Mathematical Association of America, 1993.

Megiddo, N., "Linear-time algorithms for linear programming in R³ and related problems," SIAM Journal of Computing, vol. 12, 1983, pp. 759-776.

McKenna, M. & Seidel, R., "Finding the optimal shadows of a contex polytope," Proc. ACM Symp. on Comp. Geom., June 1985, pp. 24-28.

Nievergelt, J., Preparata, F., "Plane-sweep algorithms for intersecting geometric figures", Communications of ACM vol. 25, pp. 739-747, 1982.

Preparata, F., and Shamos, M., Computational Geometry: An introduction, Springer-Verlag, New York, 1985.

Preparata, F. and Tamassia, R., "Efficient point location in a convex spatial cellcomplex," SIAM Journal of Computing, vol. 21, 1992, pp. 267-280.

Reidemeister, R., Knotentheorie, Ergebnisse der Mathematic, Vol. 1, Springer-Verlag, Berlin, 1932; L.F. Boron, C.O. Christenson and B.A. Smith (English translation) Knot Theory, BSC Associates, Moscow, Idaho, USA, 1983.

Souvaine, D. and Bjorling-Sachs, I., "The contour problem for restricted-orientation polygons", Proc. of the IEEE, vol. 80, pp. 1449-1470, 1992.

Shahrokhi, F., Szekely, L., and Vrt'o, I., "Crossing number of graphs, lower bound techniques and algorithms: A survey," Lecture Notes in Comp. Science, vol 894, Princeton, New Jersey, 1994, pp. 131-142.

Strang, G., "The width of a chair," The American Mathematical Monthly, vol. 89, No. 8, October 1982, pp. 529-534.

Toussaint, G.T., "Movable separability of sets," in Computational Geometry, G.T. Toussaint, Ed., Elsevier Science Publishers, 1985, pp. 335-375.