Matching Points with Things

DOI10.1007/978-3-642-12200-2_40zbMath1283.52016OpenAlexW2153068543MaRDI QIDQ3557040

Carlos Seara, Stefan Langerman, Ferran Hurtado, Martin L. Demaine, Vi Hart, Greg Aloupis, Sébastien Collette, Muriel Dulieu, Jean Cardinal, Erik D. Demaine, Maria Saumell, Perouz Taslakian, Ruy Fabila-Monroy

Publication date: 27 April 2010

Published in: LATIN 2010: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/71205

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

Related Items

Planar Bichromatic Bottleneck Spanning Trees, Monochromatic plane matchings in bicolored point set