On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane

DOI10.1016/S0166-218X(01)00202-5zbMath0998.52001WikidataQ126324090 ScholiaQ126324090MaRDI QIDQ5951972

Kiyoshi Hosono

Publication date: 2001

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

matchingcomputational geometryvisibility graph

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Convex sets in (2) dimensions (including convex curves) (52A10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing simple circuits from a set of line segments
• Hamiltonian triangulations and circumscribing polygons of disjoint line segments
• Approximation algorithms for the Geometric Covering Salesman Problem
• Computing Simple Circuits from a Set of Line Segments is NP-Complete
• On the visibility graph of convex translates

This page was built for publication: On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane