Approximation algorithms for aligning points
From MaRDI portal
Publication:1879366
DOI10.1007/S00453-003-1033-6zbMATH Open1087.68692OpenAlexW1975266040MaRDI QIDQ1879366FDOQ1879366
Authors: S. Cabello, Marc Van Kreveld 
Publication date: 22 September 2004
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/24339
Recommendations
Cites Work
- Planar Formulae and Their Uses
- Approximation algorithms for NP-complete problems on planar graphs
- Title not available (Why is that?)
- Some optimal inapproximability results
- Approximation schemes for covering and packing problems in image processing and VLSI
- Title not available (Why is that?)
- A matroid approach to finding edge connectivity and packing arborescences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing closely matching upper and lower bounds on textile nesting problems
- Multiple translational containment. I: An approximate algorithm
- LABELING POINTS WITH CIRCLES
- Simple planar graph partition into three forests
- Title not available (Why is that?)
- Schematization of road networks
Cited In (7)
- Title not available (Why is that?)
- Algorithms of placing recovery points
- Title not available (Why is that?)
- Generalized approximate algorithms for point set congruence
- Rotating Multiple Sets of Labeled Points to Bring Them Into Close Coincidence: A Generalized Wahba Problem
- Approximation algorithms for orthogonal line centers
- Title not available (Why is that?)
This page was built for publication: Approximation algorithms for aligning points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1879366)
