On computing translational swept volumes

International Journal of Computational Geometry and Applications

Volumn 9, Issue 3, 1999, Pages 293-317

  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; Swept volume; Translation

Indexed keywords

EID: 0033418983     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195999000200     Document Type: Article

References (22)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. Data Structures and Algorithms. Addison-Wesley, Reading, MA, 1983.
2. N. Baek, S.-Y. Shin, and K.-Y. Chwa. Three-dimensional topological sweep for computing rotational swept volumes of polyhedral objects. International Journal of Computational Geometry and Applications, 1998. (minor revision).
3. 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.
4. D. Blackmore, M. C. Leu, and F. Shih. Analysis and modelling of deformed swept volumes. Computer-Aided Design, 26(4):315-326, April 1994.
5. B. Chazelle and H. Edelsbrunner. An optimal algorithm for intersecting line segments in the plane. Journal of the ACM, 39:1-54, 1992.
6. J. J. Childs. Numerical Control Part Programming. Industrial Press Inc., New York, N.Y., 1973.
7. H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R Seidel, and M Sharir. Arrangements of curves in the plane: Topology, combinatorics, and algorithms. Theoretical Computer Science, 92:319-336, 1992.
8. H. Edelsbrunner and L. J. Guibas. Topologically sweeping an arrangement. J. Comput. Syst. Sci., 38:165-194, 1989.
9. G. Elber. Accessibility in 5-axis milling environment. Computer-Aided Design, 26(11):796-802, November 1994.
10. K. C. Hui. Solid sweeping in image space - application in NC simulation. Visual Comput., 10(6):306-316, 1994.
11. 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.
12. M. J. Mäntylä. An Introduction to Solid Modeling. Computer Science Press, Rockville, MD, 1988.
13. R. R. Martin and P. C. Stephenson. Sweeping of three-dimensional objects. Computer-Aided Design, 22(4):223-234, May 1990.
14. M. McKenna. Worst-case optimal hidden-surface removal. ACM Transactions on Graphics, 6:19-28, 1987.
15. J. O'Rourke. Computational Geometry in C. Cambridge University Press, 1993.
16. A. Schmitt. Time and space bounds for hidden line and hidden surface algorithms. In Proc. Eurographics 81, pages 43-56, Amsterdam, Netherlands, 1981. NorthHolland.
17. M. I. Shamos. Computational Geometry. Springer Verlag, New York, 1979.
18. J. M. Snyder. Interval analysis for computer graphics. In Computer Graphics (SIGGRAPH '92 Proceedings), volume 26, pages 121-130, July 1992.
19. T. van Hook. Real-time shaded NC milling display. In Computer Graphics (SIGGRAPH '86 Proceedings), volume 20, pages 15-20, August 1986.
20. 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.
21. 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.
22. A. Wiernik and M. Sharir. Planar realizations of nonlinear Davenport-Schinzel sequences by segments. Discrete Comput. Geom., 3:15-47, 1988.