Rendering antialiased shadows with depth maps
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
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
Casting curved shadows on curved surfaces
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
Collision queries using oriented bounding boxes
Collision queries using oriented bounding boxes
OpenGL Programming Guide: The Official Guide to Learning OpenGL, Version 1. 4
OpenGL Programming Guide: The Official Guide to Learning OpenGL, Version 1. 4
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
Finding feasible mold parting directions using graphics hardware
Proceedings of the 2005 ACM symposium on Solid and physical modeling
Exact minkowski sums of convex polyhedra
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Two-Dimensional Visibility Charts for Continuous Curves
SMI '05 Proceedings of the International Conference on Shape Modeling and Applications 2005
Generating smooth parting lines for mold design for meshes
Proceedings of the 2007 ACM symposium on Solid and physical modeling
Computing an exact spherical visibility map for meshed polyhedra
Proceedings of the 2007 ACM symposium on Solid and physical modeling
Automated scanning of dental impressions
Computer-Aided Design
Sufficient conditions for draft angles on general B-spline surfaces
Computer-Aided Design
Reverse engineering with a structured light system
Computers and Industrial Engineering
A new global accessibility algorithm for a polyhedral model with convex polygonal facets
Computer-Aided Design
Robotics and Computer-Integrated Manufacturing
Finding all undercut-free parting directions for extrusions
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
The inequality-satisfiability problem
Operations Research Letters
Computer-Aided Design
New methodology for demoldability analysis based on volume discretization algorithms
Computer-Aided Design
| Hi-index | 0.00 |
We present new programmable graphics hardware accelerated algorithms to test the 2-moldability of geometric parts and assist with part redesign. These algorithms efficiently identify and graphically display undercuts as well as 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 2-moldability using accessibility analysis and Gauss maps. The efficiency of these algorithms lies in the fact that they identify groups of candidate directions such that if any one direction in the group is undercut-free, all are, or if any one is not undercut-free, none are. We examine trade-offs between the algorithms' speed, accuracy, and whether they guarantee that an undercut-free direction will be found for a part if one exists.