A Scheme for Computing Minimum Covers within Simple Regions

DOI10.1007/978-3-642-03367-4_39MaRDI QIDQ3183475zbMATH OpenOpenAlexFDO

Authors Gila Morgenstern, Matthew J. Katz

Publication date 20 October 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03367-4_39

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A scheme for computing minimum covers within simple regions
• Optimal cover of points by disks in a simple polygon
• Optimal cover of points by disks in a simple polygon
• Polynomial time approximation schemes for minimum disk cover problems
• Covering points with minimum/maximum area orthogonally convex polygons

Cites work

• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• Almost optimal set covers in finite VC-dimension
• An O ( n log n ) Algorithm for Rectilinear Minimal Spanning Trees
• Approximation schemes for covering and packing problems in image processing and VLSI
• Covering orthogonal polygons with star polygons: The perfect graph approach
• Covering Points by Unit Disks of Fixed Location
• Finding the medial axis of a simple polygon in linear time
• Guarding orthogonal art galleries with sliding cameras
• scientific article; zbMATH DE number 3882470 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• Minimum-cost coverage of point sets by disks
• On guarding the vertices of rectilinear domains
• Perfect Graphs and Orthogonally Convex Covers
• POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
• Some constrained minimax and maximin location problems
• The 2-center problem with obstacles
• The NP-completeness column: An ongoing guide
• Two-Dimensional Voronoi Diagrams in the L _p -Metric
• Voronoui Diagrams in L₁ (L_\infty ) Metrics with 2-Dimensional Storage Applications

Cited in

(3)

• A scheme for computing minimum covers within simple regions
• Optimal cover of points by disks in a simple polygon
• Optimal cover of points by disks in a simple polygon

This page was built for publication: A Scheme for Computing Minimum Covers within Simple Regions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183475)