scientific article; zbMATH DE number 7765371

DOI10.4230/LIPICS.ISAAC.2020.13MaRDI QIDQ6065409zbMATH OpenFDO

Authors Marc Van Kreveld, Tillmann Miltzow, Tim Ophelders, Willem Sonke, Jordi L. Vermeulen

Publication date 14 November 2023

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2020.13

zbMATH Keywords

computational geometryHausdorff distanceshape interpolation

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• \(\forall\exists\mathbb {R}\)-completeness and area-universality
• A linear time algorithm for the Hausdorff distance between convex polygons
• A sweepline algorithm for Voronoi diagrams
• Approximate matching of polygonal shapes
• Computational geometry. Algorithms and applications.
• Contour interpolation by straight skeletons
• scientific article; zbMATH DE number 1419244 (Why is no real title available?)
• scientific article; zbMATH DE number 1424291 (Why is no real title available?)
• scientific article; zbMATH DE number 2209711 (Why is no real title available?)
• NONLINEAR INTERPOLATION BETWEEN SLICES
• On the Optimal Bisection of a Polygon
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Piecewise-Linear Interpolation between Polygonal Slices
• State of the union (of geometric objects)
• The Discrete Geodesic Problem

Cited in

(1)

• A measure of 2D shape-of-object dissimilarity

This page was built for publication:

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