Computation of the metric average of 2D sets with piecewise linear boundaries
From MaRDI portal
Publication:1662553
DOI10.3390/A3030265zbMATH Open1462.65027OpenAlexW2151769543MaRDI QIDQ1662553FDOQ1662553
Authors: Shay Kels, Evgeny Lipovetsky, Nira 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
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
Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computational geometry. Algorithms and applications.
- The computational geometry algorithms library CGAL
- Piecewise linear approximations of set-valued maps
- Approximation of convex set-valued functions
- 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
- Title not available (Why is that?)
- Approximations of set-valued functions based on the metric average
- Title not available (Why is that?)
- An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphing
Cited In (3)
Uses Software
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)
