Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions

DOI10.1016/j.tcs.2010.03.020zbMath1206.68321OpenAlexW2127752589MaRDI QIDQ620951

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

zbMATH Keywords

computational geometryneurosurgical operationsweighted Hausdorff distance

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Medical applications (general) (92C50)

Cites Work

• Unnamed Item
• Finding the upper envelope of n line segments in O(n log n) time
• An optimal algorithm for constructing the weighted Voronoi diagram in the plane
• Efficient randomized algorithms for some geometric optimization problems
• 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

This page was built for publication: Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions