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

DOI10.1007/S10444-005-7473-6MaRDI QIDQ878095zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Computation of the metric average of 2D sets with piecewise linear boundaries
• A linear time algorithm for the computation of some distance functions between convex polygons
• Delaunay-Based Polygon Morphing Across a Change in Topology
• A new linear algorithm for intersecting convex polygons
• scientific article; zbMATH DE number 2111756

Cites work

• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 2016954 (Why is no real title available?)
• scientific article; zbMATH DE number 2065320 (Why is no real title available?)
• scientific article; zbMATH DE number 2111756 (Why is no real title available?)
• A linear time algorithm for the Hausdorff distance between convex polygons
• Convex Analysis
• Matching convex shapes with respect to the symmetric difference
• Piecewise linear approximations of set-valued maps

Cited in

(7)

• A mean string algorithm to compute the average among a set of 2D shapes
• Average curve of \(n\) digital curves
• Computation of the metric average of 2D sets with piecewise linear boundaries
• Densifying distance spaces for shape and image retrieval
• Polygon morphing and its application in orebody modeling
• A new metric between polygons, and how to compute it
• scientific article; zbMATH DE number 2111756 (Why is no real title available?)

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)