Three-dimensional topological sweep for computing rotational swept volumes of polyhedral objects

International Journal of Computational Geometry and Applications

Volumn 10, Issue 2, 2000, Pages 131-156

  Baek, Nakhoon ^a,b   Shin, Sung Yong ^a   Chwa, Kyung Yong ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b Kyungpook National University   (South Korea)

Author keywords

Incremental construction; Rotation; Swept volume; Topological sweep

Indexed keywords

EID: 0034401417     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195900000097     Document Type: Article

References (24)

1. N. Baek, S.-Y. Shin, and K.-Y. Chwa. On computing translational swept volumes. International Journal of Computational Geometry & Applications, 9(3):293-317, June 1999.
2. D. Blackmore and M. C. Leu. Analysis of swept volume via Lie groups and differential equations. The International Journal of Robotics Research, 11(6):516-537, December 1992.
3. D. Blackmore, M. C. Leu, and F. Shih. Analysis and modelling of deformed swept volumes. Computer-Aided Design, 26(4):315-326, April 1994.
4. J. J. Childs. Numerical Control Part Programming. Industrial Press Inc., New York, N.Y., 1973.
5. S. E. Dorward. A survey of object-space hidden surface removed. Internat. J. Comput. Geom. Appl., 4:325-362, 1994.
6. H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel, and M. Sharir. Arrangements of curves in the plane: Topology, combinatorics, and algorithms. Theoret. Comput. Sci., 92:319-336, 1992.
7. H. Edelsbrunner and L. J. Guibas. Topologically sweeping an arrangement. J. Comput. Syst. Sci., 38:165-194, 1989.
8. G. Elber. Accessibility in 5-axis milling environment. Computer-Aided Design, 26(11):796-802, November 1994.
9. J. D. Foley, A. van Dam, S. K. Feiner, and J. F. Hughes. Computer Graphics, Principles and Practice, Second Edition. Addison-Wesley, Reading, Massachusetts, 1990.
10. M. Garey, D. Johnson, F. Preparata, and R. Tarjan. Triangulating a simple polygon. Information Processing Letters, 7:175-179, 1978.
11. S. Hertel, M. Mantyla, K. Mehlhorn, and J. Nievergelt. Space sweep solves intersection of convex polyhedra. Acta Informatica, 21(5):501-519, 1985.
12. K. C. Hui. Solid sweeping in image space - application in NC simulation. Visual Comput., 10(6):306-316, 1994.
13. J. Kieffer and F. L. Litvin. Swept volume determination and interference detection for moving 3-D solids. ASME Journal of Mechanical Design, 113:456-463, December 1991.
14. M. J. Mäntylä. An Introduction to Solid Modeling. Computer Science Press, Rockville, MD, 1988.
15. R. R. Martin and P. C. Stephenson. Sweeping of three-dimensional objects. Computer-Aided Design, 22(4):223-234, May 1990.
16. M. McKenna. Worst-case optimal hidden-surface removal. ACM Trans. Graph., 6:19-28, 1987.
17. J. O'Rourke. Computational Geometry in C. Cambridge University Press, 1993.
18. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985.
19. A. Schmitt. Time and space bounds for hidden line and hidden surface algorithms. In Proc. Eurographics 81, pages 43-56, Amsterdam, Netherlands, 1981. North-Holland.
20. A. I. Sourin and A. A. Pasko. Function representation for sweeping by a moving solid. IEEE Trans. Visualizat. Comput. Graph., 2(1):11-18, March 1996.
21. T. Van Hook. Real-time shaded NC milling display. In Computer Graphics (SIG-GRAPH '86 Proceedings), volume 20, pages 15-20, August 1986.
22. W. P. Wang and K. K. Wang. Geometric modeling for swept volume of moving solids. IEEE Computer Graphics and Applications, 6(12):8-17, December 1986.
23. J. D. Weld and M. C. Leu. Geometric representation of swept volumes with application to polyhedral objects. The International Journal of Robotics Research, 9(5):105-117, October 1990.
24. A. Wiernik and M. Sharir. Planar realizations of nonlinear Davenport-Schinzel sequences by segments. Discrete Comput. Geom., 3:15-47, 1988.