Protecting convex sets

DOI10.1007/BF02986681zbMath0813.05023OpenAlexW2015843325MaRDI QIDQ1343224

Eduardo Rivera-Campo, Joseph Zaks, Jurek Czyzowicz, Jorge Urrutia

Publication date: 1 February 1995

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02986681

zbMATH Keywords

matchingplanar graphcompact setsart gallery problemhomothetic trianglesdisjoint rectanglesisothetic familyprotecting convex sets

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Other problems of combinatorial convexity (52A37) Convex sets in (3) dimensions (including convex surfaces) (52A15) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs ⋮ On the perfect matching of disjoint compact sets by noncrossing line segments in \(\mathbb R^n\)

Cites Work

• Unnamed Item
• Unnamed Item
• Illuminating rectangles and triangles on the plane
• Lower bounds on the cardinality of the maximum matchings of planar graphs
• Guarding rectangular art galleries
• A combinatorial theorem in plane geometry
• A Theorem on Planar Graphs
• Illumination of convex discs
• The Factorization of Linear Graphs

This page was built for publication: Protecting convex sets