Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions
From MaRDI portal
Publication:620951
DOI10.1016/J.TCS.2010.03.020zbMATH Open1206.68321OpenAlexW2127752589MaRDI QIDQ620951FDOQ620951
Fabian Stehn, Christian Knauer, Klaus Kriegel
Publication date: 2 February 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.03.020
Recommendations
- Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions
- Hausdorff distance under translation for points and balls
- Hausdorff distance under translation for points and balls
- Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation
- Matching point sets with respect to the earth mover's distance
Medical applications (general) (92C50) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Finding the upper envelope of n line segments in O(n log n) time
- Efficient randomized algorithms for some geometric optimization problems
- Title not available (Why is that?)
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation
- Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation
Cited In (3)
This page was built for publication: Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q620951)
