Computation of the metric average of 2D sets with piecewise linear boundaries

DOI10.3390/A3030265MaRDI QIDQ1662553zbMATH OpenOpenAlexFDO

Authors Shay Kels, Evgeny Lipovetsky, Nira Dyn

Publication date 20 August 2018

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/a3030265

zbMATH Keywords

2D arrangementscomputational complexitycomputational geometrymetric averageVoronoi diagrams

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Review text

Summary: The metric average is a binary operation between sets in \(R^n\) which is used in the approximation of set-valued functions. We introduce an algorithm that applies tools of computational geometry to the computation of the metric average of 2D sets with piecewise linear boundaries.

Recommendations

• scientific article; zbMATH DE number 2065320
• An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphing
• On the approximate computation of the geometric difference of sets
• scientific article; zbMATH DE number 1234828
• Evaluating the boundary and covering degree of planar Minkowski sums and other geometrical convolutions

Cites work

• An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphing
• Approximation of convex set-valued functions
• Approximations of set-valued functions based on the metric average
• Computational geometry. Algorithms and applications.
• scientific article; zbMATH DE number 1079755 (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?)
• scientific article; zbMATH DE number 1424293 (Why is no real title available?)
• Piecewise linear approximations of set-valued maps
• Set-Valued Approximations with Minkowski Averages – Convergence and Convexification Rates
• Subdivision schemes of sets and the approximation of set-valued functions in the symmetric difference metric
• The computational geometry algorithms library CGAL

Cited in

(4)

• A mean string algorithm to compute the average among a set of 2D shapes
• scientific article; zbMATH DE number 1234828 (Why is no real title available?)
• scientific article; zbMATH DE number 2065320 (Why is no real title available?)
• An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphing

Describes a project that uses

Uses Software

• CGAL
• 2D Arrangement
• 2D Regularized Boolean Set-Operations

This page was built for publication: Computation of the metric average of 2D sets with piecewise linear boundaries

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