On the perfect matching of disjoint compact sets by noncrossing line segments in \(\mathbb R^n\)

DOI10.1016/S0166-218X(01)00209-8zbMath1003.68178MaRDI QIDQ1602691

Katsumi Matsuda, Kiyoshi Hosono

Publication date: 24 June 2002

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

zbMATH Keywords

perfect matchingcompact setsgeneral dimension

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

The visibility graph of congruent discs is Hamiltonian ⋮ On the visibility graph of convex translates

Cites Work

• Unnamed Item
• Hamiltonian triangulations and circumscribing polygons of disjoint line segments
• Protecting convex sets
• Topics on line segments and polygons
• COMPUTATIONAL GEOMETRY COLUMN 18

This page was built for publication: On the perfect matching of disjoint compact sets by noncrossing line segments in \(\mathbb R^n\)