OPTIMIZATION OF THE ALGORITHM FOR DETERMINING THE HAUSDORFF DISTANCE FOR CONVEX POLYGONS
From MaRDI portal
Publication:5125208
DOI10.15826/umj.2018.1.002zbMath1456.90157OpenAlexW2887161935MaRDI QIDQ5125208
Publication date: 5 October 2020
Published in: Ural mathematical journal (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/umj52
optimizationdifferential gamespolygonHausdorff distanceoptimal control theorytheory of image recognition
Applications of mathematical programming (90C90) Nonlinear programming (90C30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Algorithms for constructing suboptimal coverings of plane figures with disks in the class of regular lattices, Methods of optimization of Hausdorff distance between convex rotating figures
Cites Work
- Optimization of the Hausdorff distance between sets in Euclidean space
- Recognizing the similarity of polygons in a strengthened Hausdorff metric
- Procedures for calculating the nonconvexity measures of a plane set
- Iterative methods for minimization of the Hausdorff distance between movable polygons
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item