Computing planar swept polygons under translation

CAD Computer Aided Design

Volumn 29, Issue 12, 1997, Pages 825-836

  Tang, Kai ^b   Wang, Ming En ^b   Chen, Lin Lin ^b   Chou, Shuo Yan ^b   Woo, Tony C ^a   Janardane, Ravi ^b  

^a UNIVERSITY OF WASHINGTON   (United States)

^b NONE

Author keywords

Monotone polygon; Swept polygon; Trajectory; Translational sweep

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER AIDED DESIGN;

MONOTONE POLYGON; TRANSLATIONAL SWEEP;

COMPUTATIONAL GEOMETRY;

EID: 0031389642     PISSN: 00104485     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0010-4485(97)00030-4     Document Type: Article

References (19)

1. Bajaj, C. L. and Kim, S., Generation of configuration space obstacles: the case of moving algebraic curves. Algorithmica, 1989, 4, 157-172.
2. Blackmore, D., Leu, M. C. and Wang, W., Classification and analysis of robot swept volumes. In Proc. Japan-USA Sympos. Flexible Automation Part 1 (of 2). San Francisco, CA, 1992.
3. Bronsvoort, W. F., A surface-scanning algorithm for displaying generalized cylinders. Visual Comput., 1992, 8(3), 162-170.
4. Canny, J., The Complexity of Robot Motion Planning. MIT Press, Cambridge, MA, 1988.
5. Choi, B. K., Surface Modeling for CAD/CAM. Elsevier, New York, 1991.
6. Elber, G. and Elaine, C., Toolpath generation for freeform surface models. Computer-Aided Design, 1994, 26(6), 490-496.
7. Evans, R. C., Koppelman, G. and Rajan, V. T., Shaping geometric objects by cumulative translational sweeps. IBM J. Res. Develop., 1987, 31, 343-360.
8. Farouki, R. T. and Kaul, A., Computing Minkowski sums of plane curves. International Journal of Computational Geometry and Applications, 1995, 5(4), 413-432.
9. Foley, J. D., van Dam, A., Feiner, S. K. and Hughes, J. F., Computer Graphics: Principles and Practice. Addison-Wesley, New York, 1990.
10. Ghosh, P. K., A mathematical model for shape description using Minkowski operators. CVGIP, 1988, 44, 239-269.
11. Guibas, L. J., Ramshaw, L. and Stolfi, J., A kinetic framework for computational geometry. Proc. 24th Ann. IEEE Sympos. Found. Comput. Sci., 1983, 100-111.
12. Guibas, L. J., Sharir, M. and Sifrony, S., On the general motion-planning problem with two degrees of freedom. Discrete Comput. Geom., 1989, 4(5), 491-521.
13. Hershberger, J., Finding the upper envelope of n line segments in O(n log n) time. Information Processing Letters, 1989, 33(4), 169-174.
14. Lozano-Perez, T. and Wesley, M., An algorithm for planning collision-free paths among polyhedral obstacles. Comm. ACM, 1979, 22, 560-570.
15. Ramkumar, G. D., An algorithm to compute the Minkowski sum outer-face of two simple polygons. In Proc. Twelfth Annual Symp. on Computational Geometry. FCRC '96, Philadelphia, PA, 1996, pp. 234-241.
16. Rossignac, J. R. and Requicha, A. G., Offseting operation in solid modelling. Comput. Aided Geom. Design, 1986, 3, 129-148.
17. Suzuki, H., Kuroda, Y., Sakamoto, M., Haramaki, S. and Van Brussel, H., Development of the CAD/CAM system based on parallel processing and the inverse offset method. In Proc. World Transputer User Group (WOTUG) Conf., Transputing '91, Sunnyvale, CA, 1991, pp. 184-98.
18. Suzuki, H., Kuroda, Y., Sakamoto, M. and Motomura, N., Real time numerical control system for metal molds and dies machining. III. Real time CAM processing based on the inverse offset method. J. Japan Society of Precision Engineering, 1991, 57(3), 473-478.
19. Woo, T.C. et al., Scallop hull and its offset for a monotone chain in linear time. Computer-Aided Design, 1994, 26, 537-542.