Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
440149 | Computer-Aided Design | 2013 | 9 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Graphics and Computer-Aided Design
Authors
Nadav Shragai, Gershon Elber,