Authors
Rahul Khardekar, Greg Burton, Sara McMains
Publication date
2005/6/13
Book
Proceedings of the 2005 ACM symposium on Solid and Physical Modeling
Pages
233-243
Description
We present new programmable graphics hardware accelerated algorithms to test the castability of geometric parts and assist with part redesign. These algorithms efficiently identify and graphically display undercuts and minimum and insufficient draft angles. Their running times grow only linearly with respect to the number of facets in the solid model, making them efficient subroutines for our algorithms that test whether a tessellated CAD model can be manufactured in a two-part mold. We have developed and implemented two such algorithms to choose candidate directions to test for castability using accessibility analysis and Gauss maps. The efficiency of these algorithms lies in that they identify groups of candidate directions such that if any one direction in the group is not castable, none are, or if any one is castable, all are. We examine trade-offs between the algorithms' speed, accuracy, and whether they …
Total citations
2006200720082009201020112012201320142015201620172018201920202021202220235108118939666263111
Scholar articles
R Khardekar, G Burton, S McMains - Proceedings of the 2005 ACM symposium on Solid and …, 2005