Decision criteria for computer-aided parting surface design
Computer-Aided Design
NC machining with G-buffer method
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
Moldable and castable polygons
Computational Geometry: Theory and Applications
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Computational geometry in C (2nd ed.)
Computational geometry in C (2nd ed.)
Representations for Rigid Solids: Theory, Methods, and Systems
ACM Computing Surveys (CSUR)
Efficient perspective-accurate silhouette computation and applications
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
CGI '98 Proceedings of the Computer Graphics International 1998
Collision queries using oriented bounding boxes
Collision queries using oriented bounding boxes
GPU Gems: Programming Techniques, Tips and Tricks for Real-Time Graphics
GPU Gems: Programming Techniques, Tips and Tricks for Real-Time Graphics
Hardware-determined feature edges
Proceedings of the 3rd international symposium on Non-photorealistic animation and rendering
Mold Accessibility via Gauss Map Analysis
SMI '04 Proceedings of the Shape Modeling International 2004
Finding feasible mold parting directions using graphics hardware
Computer-Aided Design
A step towards automated design of side actions in injection molding of complex parts
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
Finding mold-piece regions using computer graphics hardware
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
| Hi-index | 0.00 |
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 guarantee that a castable direction will be found for a part if one exists.