Efficient computation of a near-optimal primary parting line

Authors:
Rahul Khardekar;Sara McMains
Affiliations:
University of California, Berkeley;University of California, Berkeley
Venue:
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
Year:
2009

Citing 7
Cited 0

Algorithms for high dimensional stabbing problems

Discrete Applied Mathematics - Computational combinatiorics
Approximation algorithms for hitting objects with straight lines

Discrete Applied Mathematics
A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons

Computational Geometry: Theory and Applications
Linear Programming in Linear Time When the Dimension Is Fixed

Journal of the ACM (JACM)
Computing a flattest, undercut free parting line for a convex polyhedron, with application to mold design

Computational Geometry: Theory and Applications
Generating smooth parting lines for mold design for meshes

Proceedings of the 2007 ACM symposium on Solid and physical modeling
The application of surface demoldability and moldability to side-core design in die and mold CAD

Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

In injection molding, a flat parting surface that is normal to the mold parting direction achieves the best mold alignment with the least cost. However, for complex parts, parting surfaces that consist of a number of planes are necessary. In this paper, we provide an algorithm to find a near-optimal parting surface as a series of planes that intersect the boundary of the part. We form a continuous band of triangles on the part boundary that are parallel to the parting direction within a tolerance and perform vertical trapezoidation of the band. We can then find a set of planes that intersect vertical lines in the trapezoidation. We use a linear program to keep the planes normal to the parting direction.