A Scheme for Computing Minimum Covers within Simple Regions

DOI10.1007/978-3-642-03367-4_39zbMath1253.68339OpenAlexW2163464570MaRDI QIDQ3183475

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Covering orthogonal polygons with star polygons: The perfect graph approach
• Finding the medial axis of a simple polygon in linear time
• Almost optimal set covers in finite VC-dimension
• On guarding the vertices of rectilinear domains
• The 2-Center Problem with Obstacles
• GUARDING ORTHOGONAL ART GALLERIES WITH SLIDING CAMERAS
• POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
• Approximation schemes for covering and packing problems in image processing and VLSI
• Perfect Graphs and Orthogonally Convex Covers
• Two-Dimensional Voronoi Diagrams in the L _p -Metric
• Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications
• An O ( n log n ) Algorithm for Rectilinear Minimal Spanning Trees
• Covering Points by Unit Disks of Fixed Location
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• The NP-completeness column: An ongoing guide

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