Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions

DOI10.1007/978-3-642-02270-8_13zbMath1248.68525OpenAlexW2156484172MaRDI QIDQ5321701

Fabian Stehn, Christian Knauer, Klaus Kriegel

Publication date: 14 July 2009

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02270-8_13

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• 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
• The upper envelope of Voronoi surfaces and its applications
• 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