Geometric covering

Nadav Shragai; Gershon Elber

doi:10.1016/j.cad.2012.10.007

Geometric covering

Nadav Shragai, Gershon Elber

Computer Science

Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	243-251
Number of pages	9
Journal	CAD Computer Aided Design
Volume	45
Issue number	2
DOIs	https://doi.org/10.1016/j.cad.2012.10.007
State	Published - Feb 2013

Keywords

Inspection
Mold design
Security
Set cover

All Science Journal Classification (ASJC) codes

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

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1016/j.cad.2012.10.007

Cite this

@article{c273202066b44a22b3a9f9a2559b1c27,

title = "Geometric covering",

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.",

keywords = "Inspection, Mold design, Security, Set cover",

author = "Nadav Shragai and Gershon Elber",

note = "Funding Information: The research leading to these results has received partial funding from the People Programme (Marie Curie Actions) of the European Union{\textquoteright}s Seventh Framework Programme FP7/2007-2013/ under REA grant agreement PIAP-GA-2011-286426 , and was supported in part by the Technion Vice President for Research Fund — Glasberg–Klein research fund .",

year = "2013",

month = feb,

doi = "10.1016/j.cad.2012.10.007",

language = "الإنجليزيّة",

volume = "45",

pages = "243--251",

journal = "CAD Computer Aided Design",

issn = "0010-4485",

publisher = "Elsevier Ltd.",

number = "2",

}

TY - JOUR

T1 - Geometric covering

AU - Shragai, Nadav

AU - Elber, Gershon

N1 - Funding Information: The research leading to these results has received partial funding from the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme FP7/2007-2013/ under REA grant agreement PIAP-GA-2011-286426 , and was supported in part by the Technion Vice President for Research Fund — Glasberg–Klein research fund .

PY - 2013/2

Y1 - 2013/2

N2 - 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.

AB - 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.

KW - Inspection

KW - Mold design

KW - Security

KW - Set cover

UR - http://www.scopus.com/inward/record.url?scp=84868208552&partnerID=8YFLogxK

U2 - 10.1016/j.cad.2012.10.007

DO - 10.1016/j.cad.2012.10.007

M3 - مقالة

SN - 0010-4485

VL - 45

SP - 243

EP - 251

JO - CAD Computer Aided Design

JF - CAD Computer Aided Design

IS - 2

ER -

Geometric covering

Abstract

Keywords

All Science Journal Classification (ASJC) codes

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this