An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphing

DOI10.1007/s10444-005-7473-6zbMath1121.65022OpenAlexW2088360111MaRDI QIDQ878095

Evgeny Lipovetsky, N. Richter-Dyn

Publication date: 26 April 2007

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10444-005-7473-6

zbMATH Keywords

convex polygonsmorphinglinear time complexitymetric average

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (2)

Computation of the metric average of 2D sets with piecewise linear boundaries ⋮ Densifying distance spaces for shape and image retrieval

Cites Work

• A linear time algorithm for the Hausdorff distance between convex polygons
• Piecewise linear approximations of set-valued maps
• Matching convex shapes with respect to the symmetric difference
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphing