Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design

Computational Geometry: Theory and Applications

Volumn 13, Issue 4, 1999, Pages 229-252

  Majhi, Jayanth ^a   Gupta, Prosenjit ^c   Janardan, Ravi ^b  

^a MENTOR GRAPHICS CORPORATION   (United States)

^b UNIVERSITY OF MINNESOTA   (United States)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Arrangements; Casting molding; Computational geometry; Optimization; Point set width; Shortest paths; Visibility

Indexed keywords

EID: 0042123085     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(99)00023-1     Document Type: Article

References (21)

1. H.-K. Ahn, M. de Berg, P. Bose, S.W. Cheng, D. Halperin, J. Matoušek, O. Schwartzkopf, Separating an object from its cast, in: Proceedings of the 13th ACM Symposium on Computational Geometry, 1997, pp. 221-230.
2. R.W. Bainbridge, Thermo-setting plastic parts, in: J.G. Bralla (Ed.), Handbook of Product Design for Manufacturing, McGraw-Hill, New York, 1986, pp. 6-3-6-16.
3. P. Bose, D. Bremner, M. van Kreveld, Determining the castability of simple polyhedra, in: Proceedings of the 10th Annual ACM Symp. on Computational Geometry, 1994, pp. 123-131.
4. P. Bose, Geometric and computational aspects of manufacturing processes, Ph.D. Thesis, School of Computer Science, McGill University, Montréal, Canada, 1995.
5. P. Bose, G. Toussaint, Geometric and computational aspects of gravity casting, Comput.-Aided Design 27 (6) (1995) 455-464.
6. P. Bose, M. van Kreveld, G. Toussaint, Filling polyhedral molds, in: Proc. 3rd Workshop Algorithms Data Structures, Lecture Notes in Computer Science, Vol. 709, Springer, Berlin, 1993, pp. 210-221.
7. L.-L. Chen, S.-Y. Chou, T.C. Woo, Parting directions for mould and die design, Comput.-Aided Design 25 (12) (1993) 762-768.
8. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer, Berlin, 1987.
9. H. Edelsbrunner, J. O'Rourke, R. Seidel, Constructing arrangements of lines and hyperplanes, with applications, SIAM J. Comput. 15 (1986) 341-363.
10. S. Fekete, J. Mitchell, Geometric aspects of injection molding, Manuscript, 1992.
11. L. Guibas, J. Hershberger, D. Leven, M. Sharir, R.E. Tarjan, Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica 2 (1987) 209-233.
12. M.E. Houle, G.T. Toussaint, Computing the width of a set, IEEE Trans. Pattern Anal. Machine Intell. 10 (5) (1988) 761-765.
13. K.C. Hui, S.T. Tan, Mould design with sweep operations - a heuristic search approach, Comput.-Aided Design 24 (2) (1992) 81-91.
14. D.G. Luenberger, Introduction to Linear and Non-Linear Programming, Addison-Wesley, Reading, MA, 1973.
15. M. McKenna, R. Seidel, Finding the optimal shadows of a convex polytope, in: Proceedings of the 1st Annual ACM Symp. on Computational Geometry, 1985, pp. 24-28.
16. F.P. Preparata, M.I. Shamos, Computational Geometry - An Introduction, Springer, Berlin, 1988.
17. B. Ravi, M.N. Srinivasan, Decision criteria for computer-aided parting surface design, Comput.-Aided Design 22 (1) (1990) 11-18.
18. A. Rosenbloom, D. Rappaport, Moldable and castable polygons, in: Proceedings of the 4th Canadian Conference on Computational Geometry, 1992, pp. 322-327.
19. A. Tal, D. Dobkin, GASP - a system to facilitate animating geometric algorithms, in: Proceedings of the 10th Annual ACM Symp. on Computational Geometry, 1994, 388-389.
20. K. Tang, T. Woo, J. Gan, Maximum intersection of spherical polygons and workpiece orientation for 4- and 5-axis machining, J. Mech. Design 114 (1992) 477-485.
21. E.G. Zuppann, Castings made in sand molds, in: J.G. Bralla (Ed.), Handbook of Product Design for Manufacturing, McGraw-Hill, New York, 1986, pp. 5-3-5-22.