Matching convex shapes with respect to the symmetric difference
From MaRDI portal
(Redirected from Matching convex shapes with respect to the symmetric difference)
Recommendations
Cited in
(14)- Probabilistic matching of planar regions
- Aligning two convex figures to minimize area or perimeter
- Approximating convex shapes with respect to symmetric difference under homotheties
- Maximizing the area of overlap of two unions of disks under rigid motion
- Matching convex shapes with respect to the symmetric difference
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
- An upper bound on the volume of the symmetric difference of a body and a congruent copy
- Approximating the maximum overlap of polygons under translation
- scientific article; zbMATH DE number 2200862 (Why is no real title available?)
- Geometric optimization and sums of algebraic functions
- Sequences of spanning trees and a fixed tree theorem
- Area-preserving approximations of polygonal paths
- Maximizing the overlap of two planar convex sets under rigid motions
- An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphing
This page was built for publication: Matching convex shapes with respect to the symmetric difference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386463)