Matching convex shapes with respect to the symmetric difference
From MaRDI portal
Publication:1386463
DOI10.1007/PL00009210zbMath0896.68150OpenAlexW2087254112MaRDI QIDQ1386463
U. Fuchs, Günter Rote, Helmut Alt, Gerald Weber
Publication date: 24 May 1998
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009210
Related Items (10)
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 ⋮ Aligning two convex figures to minimize area or perimeter ⋮ Scandinavian thins on top of cake: new and improved algorithms for stacking and packing ⋮ Approximating the maximum overlap of polygons under translation ⋮ Sequences of spanning trees and a fixed tree theorem ⋮ MAXIMIZING THE AREA OF OVERLAP OF TWO UNIONS OF DISKS UNDER RIGID MOTION ⋮ Probabilistic matching of planar regions ⋮ Geometric optimization and sums of algebraic functions
This page was built for publication: Matching convex shapes with respect to the symmetric difference
