Non-crossing Connectors in the Plane

DOI10.1007/978-3-642-38236-9_11zbMath1382.68264arXiv1201.0917OpenAlexW2144214838MaRDI QIDQ4922119

Jan Kratochvíl, Torsten Ueckerdt

Publication date: 28 May 2013

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

Full work available at URL: https://arxiv.org/abs/1201.0917

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Faster bottleneck non-crossing matchings of points in convex position ⋮ Non-crossing Paths with Geographic Constraints ⋮ Structural properties of bichromatic non-crossing matchings

This page was built for publication: Non-crossing Connectors in the Plane