Geometric covering

Nadav Shragai, Gershon Elber

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)243-251
Number of pages9
JournalCAD Computer Aided Design
Issue number2
StatePublished - Feb 2013


  • Inspection
  • Mold design
  • Security
  • Set cover

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design
  • Industrial and Manufacturing Engineering


Dive into the research topics of 'Geometric covering'. Together they form a unique fingerprint.

Cite this