Separating and Intersecting Spherical Polygons: Computing Machinability on Three-, Four-, and Five-Axis Numerically Controlled Machines

ACM Transactions on Graphics (TOG)

Volumn 12, Issue 4, 1993, Pages 305-326

  Chen, Lin Lin ^a   Chou, Shuo Yan ^a   Woo, Tony C ^b  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Bisection; densest hemisphere; minimal maximal intersection; numerically controlled machining; separation; spherical algorithm; visibility algorithm

Indexed keywords

ALGORITHMS; COMPUTER GRAPHICS; MACHINING;

BISECTION; COMPUTING MACHINERY; SPHERICAL ALGORITHM; SPHERICAL POLYGONS;

COMPUTER AIDED MANUFACTURING;

EID: 0027681971     PISSN: 07300301     EISSN: 15577368     Source Type: Journal    
DOI: 10.1145/159730.159732     Document Type: Article

References (32)

1. AVIS, D., AND WENGER, R. 1988, Polyhedral line transversals in space. Discr. Comput. Geom. 3, 3, 257-265.
2. BAUMGART, B. 1975. A polyhedron representation for computer vision. In National Computer Conference, AFIPS Conference Proceedings. AFIPS, Arlington, Va., 589-596.
3. BROWN, K. Q. 1979. Geometric transformations for fast geometric algorithms. Ph.D. thesis, Dept. of Computer Science, Carnegie-Mellon Univ., Pittsburgh, Pa.
4. CHAZELLE, B. M., GUIBAS, L. T., AND LEE, D. T. 1985. The power of geometric duality. BIT 25, 1, 76-90.
5. CHEN, L. L., AND CHOU, S. Y. 1992. Optimal parting directions by partial visibility. In Proceedings of the Symposium on Concurrent Engineering. ASME, New York.
6. CHEN, L. L., AND WOO, T. C. 1992. Computational geometry on the sphere for automated machining. ASME J. Mech. Des. 114, 2, 288-295.
7. CHEN, L. L., CHOU, S. Y., AND WOO, T. C. 1992. Optimal parting directions for mold and die design. Tech. Rep. 92-105, Dept. of Industrial and Manufacturing Systems Engineering, Iowa State Univ., Ames, Iowa.
8. CHVÁTAL, V. 1979. A greedy heuristic for the set covering problem. Math. Oper. Res. 4, 3, 233-235.
9. EDELSHRUNNER, H. 1987. Algorithms in Combinatorial Geometry. Springer-Verlag, New York.
10. EDELSBRUNNER, H., GUIBAS, L. J., AND SHARIR, M. 1989. The upper envelope of piecewise linear functions: Algorithms and applications. Discr. Comput. Geom. 4, 4, 311-336.
11. FAUX, I. D., AND PRATT, S. J. 1979. Computational Geometry for Design and Manufacture. Halsted Press, New York.
12. GAREY, M. R., AND JOHNSON, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco.
13. GRAHAM, R. L., AND YAO, F. F. 1983. Finding the convex hull of a simple polygon. J. Alg. 4, 4, 324-331.
14. GUIBAS, L. J., AND STOLFI, J. 1985. Primitives for the manipulation of general subdivisions and the computation of voronoi diagrams. ACM Trans. Graph. 4, 2, 74-123.
15. HERSHBERGER, J. 1987. Finding the upper envelope of n line segments in O(n log n) time. Inf. Process. Lett. 33, 4, 169-174.
16. HILBERT, D., AND COHN-VOSSEN, S. 1952. Geometry and the Imagination. Chelsea, New York.
17. HOFFMANN, C. M. 1989. Geometric and Solid Modeling: An Introduction. Morgan Kaufmann, San Mateo, Calif.
18. JOHNSON, D. S., AND PREPARATA, F. P. 1978. The densest hemisphere problem. Theoret. Comput. Sci. 6, 1, 93-107.
19. KNUTH, D. E. 1968. The Art of Computer Programming. Vol. I, Fundamental Algorithms. Addison-Wesley, Reading, Mass.
20. MARCINIAK, K. 1991. Geometric Modelling for Numerically Controlled Machining. Oxford University Press, New York.
21. O'ROURKE, J., CHIEN, C., OLSON, T., AND NADDOR, D. 1982. A new linear algorithm for intersecting convex polygons. Comput. Graph. Image Process. 19, 4, 384-391.
22. PREPARATA, F. P., AND SHAMOS, S. I. 1985. Computatéonal Geometry: An Introduction. Springer-Verlag, New York.
23. RYAN, P. J. 1986. Euclidean and Non-Euclidean Geometry: An Analytic Approach. Cambridge University Press, Cambridge, Mass.
24. SHIN, S. Y., AND WOO, T. C. 1986. Finding the convex hull of a simple polygon in linear time. Patt. Recog. 19, 6, 453-458.
25. SPYRIDI, A. J., AND REQUICHA, A. A. G. 1989. Accessibility analysis for the automatic inspection of mechanical parts by coordinate measuring machines. Tech. Rep., Computer Science Dept., Univ. of Southern California.
26. STOLFI, J. 1991. Oriented Projective Geometry: A Framework for Geometric Computations. Academic Press, New York.
27. TANG, K., AND WOO, T. C. 1991a. Algorithmic aspects of alternating sums of volumes. Part I: Data structure and difference operation. Comput. Aided Des. 23, 5, 357-366.
28. TANG, K., AND WOO, T. C. 1991b. Algorithmic aspects of alternating sums of volumes. Part II: Non-convergence and its remedy. Comput. Aided Des. 23, 6, 435-443.
29. THYER, G. E. 1991. Computer Numerical Control of Machine Tools. 2nd ed. Newnes, Boston.
30. Woo, T. C. 1985. A combinatorial analysis of boundary data structure schemata. IEEE Comput. Graph. Appl. 5, 3, 19-27.
31. Woo, T. C. 1982. Feature extraction by volume decomposition. In Proceedings of the Conference on CAD/CAM Technology in Mechanical Engineering (Cambridge, Mass.).
32. WOODWARK, J. 1986. Computing Shape. Butterworths, Boston.