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

DOI10.3390/a3030265zbMath1462.65027OpenAlexW2151769543MaRDI QIDQ1662553

Evgeny Lipovetsky, Shay Kels, N. Richter-Dyn

Publication date: 20 August 2018

Published in: Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

computational complexitycomputational geometryVoronoi diagramsmetric average2D arrangements

Mathematics Subject Classification ID

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

Uses Software

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

Cites Work

• Subdivision schemes of sets and the approximation of set-valued functions in the symmetric difference metric
• An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphing
• Piecewise linear approximations of set-valued maps
• Approximation of convex set-valued functions
• Set-Valued Approximations with Minkowski Averages – Convergence and Convexification Rates
• The computational geometry algorithms library CGAL
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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