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

Jayanth Majhi; Prosenjit Gupta; Ravi Janardan

doi:10.1007/bfb0014489

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

Jayanth Majhi, Prosenjit Gupta, Ravi Janardan

Computer Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Scopus citations

Abstract

A parting line for a convex polyhedron, P, is a closed curve on the surface of P. It defines the two pieces of P for which mold-halves must be made. An undercut-free parting line is one which does not create recesses or projections in P and thus allows easy de-molding of 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(n²)-time algorithm is presented to compute such a line, according to a prescribed flatness criterion, where n is the number of vertices in P.

Original language	English (US)
Title of host publication	Applied Computational Geometry
Subtitle of host publication	Towards Geometric Engineering - FCRC 1996 Workshop, WACG 1996, Selected Papers
Editors	Ming C. Lin, Ming C. Lin, Dinesh Manocha
Publisher	Springer Verlag
Pages	109-120
Number of pages	12
ISBN (Print)	354061785X, 9783540617853
DOIs	https://doi.org/10.1007/bfb0014489
State	Published - 1996
Event	1st ACM Workshop on Applied Computational Geometry, WACG 1996 held as part of 2nd Federated Computing Research Conference, FCRC 1996 - Philadelphia, United States Duration: May 27 1996 → May 28 1996

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1148
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	1st ACM Workshop on Applied Computational Geometry, WACG 1996 held as part of 2nd Federated Computing Research Conference, FCRC 1996
Country/Territory	United States
City	Philadelphia
Period	5/27/96 → 5/28/96

Bibliographical note

Funding Information:
I Research supported in part by NSF Grant CCR-9200270 and by a University of Minnesota Grant-in-Aid of Research Award. A preliminary version of this paper appears in the Proceedings of the First ACM Workshop on Applied Computational Geometry, LNCS 1148, Springer-Verlag, 1996, pp. 109–120. ∗Corresponding author. E-mail: [email protected] 1E-mail: [email protected] 2Work done while at MPI-Informatik, Saarbrücken, Germany, and at the University of Minnesota, USA. E-mail: [email protected]

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1996.

Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.

Publisher link

10.1007/bfb0014489

Find It

Find It at U of M Libraries

Cite this

Majhi, J., Gupta, P., & Janardan, R. (1996). Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design. In M. C. Lin, M. C. Lin, & D. Manocha (Eds.), Applied Computational Geometry: Towards Geometric Engineering - FCRC 1996 Workshop, WACG 1996, Selected Papers (pp. 109-120). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1148). Springer Verlag. https://doi.org/10.1007/bfb0014489

Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design. / Majhi, Jayanth; Gupta, Prosenjit; Janardan, Ravi.
Applied Computational Geometry: Towards Geometric Engineering - FCRC 1996 Workshop, WACG 1996, Selected Papers. ed. / Ming C. Lin; Ming C. Lin; Dinesh Manocha. Springer Verlag, 1996. p. 109-120 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1148).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Majhi, J, Gupta, P & Janardan, R 1996, Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design. in MC Lin, MC Lin & D Manocha (eds), Applied Computational Geometry: Towards Geometric Engineering - FCRC 1996 Workshop, WACG 1996, Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1148, Springer Verlag, pp. 109-120, 1st ACM Workshop on Applied Computational Geometry, WACG 1996 held as part of 2nd Federated Computing Research Conference, FCRC 1996, Philadelphia, United States, 5/27/96. https://doi.org/10.1007/bfb0014489

Majhi J, Gupta P, Janardan R. Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design. In Lin MC, Lin MC, Manocha D, editors, Applied Computational Geometry: Towards Geometric Engineering - FCRC 1996 Workshop, WACG 1996, Selected Papers. Springer Verlag. 1996. p. 109-120. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/bfb0014489

Majhi, Jayanth ; Gupta, Prosenjit ; Janardan, Ravi. / Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design. Applied Computational Geometry: Towards Geometric Engineering - FCRC 1996 Workshop, WACG 1996, Selected Papers. editor / Ming C. Lin ; Ming C. Lin ; Dinesh Manocha. Springer Verlag, 1996. pp. 109-120 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{0d70af2b2995436a9f293c11a0ef9c01,

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

abstract = "A parting line for a convex polyhedron, P, is a closed curve on the surface of P. It defines the two pieces of P for which mold-halves must be made. An undercut-free parting line is one which does not create recesses or projections in P and thus allows easy de-molding of 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 P.",

author = "Jayanth Majhi and Prosenjit Gupta and Ravi Janardan",

note = "Funding Information: I Research supported in part by NSF Grant CCR-9200270 and by a University of Minnesota Grant-in-Aid of Research Award. A preliminary version of this paper appears in the Proceedings of the First ACM Workshop on Applied Computational Geometry, LNCS 1148, Springer-Verlag, 1996, pp. 109–120. ∗Corresponding author. E-mail: [email protected] 1E-mail: [email protected] 2Work done while at MPI-Informatik, Saarbr{\"u}cken, Germany, and at the University of Minnesota, USA. E-mail: [email protected] Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1996. Copyright: Copyright 2020 Elsevier B.V., All rights reserved.; 1st ACM Workshop on Applied Computational Geometry, WACG 1996 held as part of 2nd Federated Computing Research Conference, FCRC 1996 ; Conference date: 27-05-1996 Through 28-05-1996",

year = "1996",

doi = "10.1007/bfb0014489",

language = "English (US)",

isbn = "354061785X",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "109--120",

editor = "Lin, {Ming C.} and Lin, {Ming C.} and Dinesh Manocha",

booktitle = "Applied Computational Geometry",

}

TY - GEN

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

AU - Majhi, Jayanth

AU - Gupta, Prosenjit

AU - Janardan, Ravi

N1 - Funding Information: I Research supported in part by NSF Grant CCR-9200270 and by a University of Minnesota Grant-in-Aid of Research Award. A preliminary version of this paper appears in the Proceedings of the First ACM Workshop on Applied Computational Geometry, LNCS 1148, Springer-Verlag, 1996, pp. 109–120. ∗Corresponding author. E-mail: [email protected] 1E-mail: [email protected] 2Work done while at MPI-Informatik, Saarbrücken, Germany, and at the University of Minnesota, USA. E-mail: [email protected] Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1996. Copyright: Copyright 2020 Elsevier B.V., All rights reserved.

PY - 1996

Y1 - 1996

N2 - A parting line for a convex polyhedron, P, is a closed curve on the surface of P. It defines the two pieces of P for which mold-halves must be made. An undercut-free parting line is one which does not create recesses or projections in P and thus allows easy de-molding of 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 P.

AB - A parting line for a convex polyhedron, P, is a closed curve on the surface of P. It defines the two pieces of P for which mold-halves must be made. An undercut-free parting line is one which does not create recesses or projections in P and thus allows easy de-molding of 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 P.

UR - http://www.scopus.com/inward/record.url?scp=79959758232&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79959758232&partnerID=8YFLogxK

U2 - 10.1007/bfb0014489

DO - 10.1007/bfb0014489

M3 - Conference contribution

AN - SCOPUS:79959758232

SN - 354061785X

SN - 9783540617853

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 109

EP - 120

BT - Applied Computational Geometry

A2 - Lin, Ming C.

A2 - Manocha, Dinesh

PB - Springer Verlag

T2 - 1st ACM Workshop on Applied Computational Geometry, WACG 1996 held as part of 2nd Federated Computing Research Conference, FCRC 1996

Y2 - 27 May 1996 through 28 May 1996

ER -

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

Abstract

Publication series

Other

Bibliographical note

Publisher link

Find It

Other files and links

Fingerprint

Cite this