Art gallery theorems and algorithms
Art gallery theorems and algorithms
Computer graphics (2nd ed. in C): principles and practice
Computer graphics (2nd ed. in C): principles and practice
Casting a polyhedron with directional uncertainty
Computational Geometry: Theory and Applications
Mold Accessibility via Gauss Map Analysis
SMI '04 Proceedings of the Shape Modeling International 2004
Two-Dimensional Visibility Charts for Continuous Curves
SMI '05 Proceedings of the International Conference on Shape Modeling and Applications 2005
Computing an exact spherical visibility map for meshed polyhedra
Proceedings of the 2007 ACM symposium on Solid and physical modeling
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
Finding feasible mold parting directions using graphics hardware
Computer-Aided Design
A new global accessibility algorithm for a polyhedral model with convex polygonal facets
Computer-Aided Design
Multi-piece Mold Design Based on Linear Mixed-Integer Program toward Guaranteed Optimality
ICMA '10 Proceedings of the 2010 International Conference on Manufacturing Automation
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Simultaneous precise solutions to the visibility problem of sculptured models
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
Finding all undercut-free parting directions for extrusions
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
Special Section on CAD/Graphics 2013: Geometric multi-covering
Computers and Graphics
| Hi-index | 0.00 |
In this work, we present a single unified framework that can solve many geometric covering queries such as inspection and mold design. The suggested framework reduces a geometric covering query to the classic computer science set-covering problem. The solution is of exponential complexity due to the inherent complexity of the classic set-covering problem. However, in practice, we are able to efficiently offer almost optimal solutions for small-scale problems of several covering entities. Finally, using the portrayed framework, we demonstrate some results on the mold-design problem in manufacturing.