Abstract
A parting line for a convex polyhedron, \(\mathcal{P}\), is a closed curve on the surface of \(\mathcal{P}\). It defines the two pieces of \(\mathcal{P}\) for which mold-halves must be made. An undercut-free parting line is one which does not create recesses or projections in \(\mathcal{P}\) and thus allows easy de-molding of \(\mathcal{P}\). Computing an undercut-free parting line that is as flat as possible is an important problem in mold design. In this paper, an O(n2)-time algorithm is presented to compute such a line, according to a prescribed flatness criterion, where n is the number of vertices in \(\mathcal{P}\).
Extended abstract. Research supported in part by NSF Grant CCR-9200270 and by a Univ. of Minnesota Grant-in-Aid of Research Award.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R.W. Bainbridge. Thermo-setting plastic parts. In J.G. Bralla, editor, Handbook of product design for manufacturing, pages 6-3–6-16. McGraw-Hill Book Company, 1986.
P. Bose, D. Bremner, and M. van Kreveld. Determining the castability of simple polyhedra. In Proceedings of the 10th Annual ACM Symp. on Computational Geometry, pages 123–131, 1994.
P. Bose. Geometric and computational aspects of manufacturing processes. PhD thesis, School of Computer Science, McGill University, Montréal, Canada, 1995.
P. Bose and G. Toussaint. Geometric and computational aspects of gravity casting. Computer-Aided Design, 27(6):455–464, 1995.
P. Bose, M. van Kreveld, and G. Toussaint. Filling polyhedral molds. In Proc. 3rd Workshop Algorithms Data Structures, volume 709 of Lecture Notes in Computer Science, pages 210–221. Springer-Verlag, 1993.
L-L. Chen, S-Y. Chou, and T.C. Woo. Parting directions for mould and die design. Computer-Aided Design, 25(12):762–768, 1993.
H. Edelsbrunner, J. O'Rourke, and R. Seidel. Constructing arrangements of lines and hyperplanes, with applications. SIAM Journal on Computing, 15:341–363, 1986.
S. Fekete and J. Mitchell. Geometric aspects of injection molding. Manuscript, 1992.
L. Guibas, J. Hershberger, D. Leven, M. Sharir, and R.E. Tarjan. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica, 2:209–233, 1987.
K.C. Hui and S.T. Tan. Mould design with sweep operations-a heuristic search approach. Computer-Aided Design, 24(2):81–91, 1992.
D.G. Luenberger. Introduction to linear and non-linear programming. Addison-Wesley, 1973.
M. McKenna and R. Seidel. Finding the optimal shadows of a convex polytope. In Proceedings of the 1st Annual ACM Symp. on Computational Geometry, pages 24–28, 1985.
A. Rosenbloom and D. Rappaport. Moldable and castable polygons. In Proceedings of the 4th Canadian Conference on Computational Geometry, pages 322–327, 1992.
B. Ravi and M.N. Srinivasan. Decision criteria for computer-aided parting surface design. Computer-Aided Design, 22(1):11–18, 1990.
E.C. Zuppann. Castings made in sand molds. In J.G. Bralla, editor, Handbook of product design for manufacturing, pages 5-3–5-22. McGraw-Hill Book Company, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Majhi, J., Gupta, P., Janardan, R. (1996). Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design. In: Lin, M.C., Manocha, D. (eds) Applied Computational Geometry Towards Geometric Engineering. WACG 1996. Lecture Notes in Computer Science, vol 1148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014489
Download citation
DOI: https://doi.org/10.1007/BFb0014489
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61785-3
Online ISBN: 978-3-540-70680-9
eBook Packages: Springer Book Archive