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

DOI10.1007/S10444-005-7473-6zbMATH Open1121.65022OpenAlexW2088360111MaRDI QIDQ878095FDOQ878095

Evgeny Lipovetsky, Nira 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 polygonslinear time complexitymorphingmetric average

Mathematics Subject Classification ID

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

Cites Work

• Convex Analysis
• Piecewise linear approximations of set-valued maps
• Matching convex shapes with respect to the symmetric difference
• A linear time algorithm for the Hausdorff distance between convex polygons
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Computation of the metric average of 2D sets with piecewise linear boundaries
• Densifying distance spaces for shape and image retrieval
• A new metric between polygons, and how to compute it

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878095)