Minimization of the Hausdorff distance between convex polyhedrons

DOI10.1007/S10958-005-0043-0zbMATH Open1090.90122OpenAlexW2065645278MaRDI QIDQ2487445FDOQ2487445

Authors: A. S. Lakhtin, Vladimir N. Ushakov 

Publication date: 5 August 2005

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-005-0043-0

zbMATH Keywords

locationnonsmooth analysisiterative subgradient methods

Mathematics Subject Classification ID

Nonlinear programming (90C30) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Cites Work

• Convex Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• Optimization of the Hausdorff distance between sets in Euclidean space
• On the horseshoe conjecture for maximal distance minimizers
• OPTIMIZATION OF THE ALGORITHM FOR DETERMINING THE HAUSDORFF DISTANCE FOR CONVEX POLYGONS
• Title not available (Why is that?)
• The distance between convex sets with Minkowski sum structure: application to collision detection
• Algorithms of minimization of Hausdorff deviation of a convex compact from a set of movable convex polygons
• Title not available (Why is that?)
• On the distance of polytopes with few vertices to the Euclidean ball
• Title not available (Why is that?)
• Minimal distance between two non-convex surfaces

This page was built for publication: Minimization of the Hausdorff distance between convex polyhedrons

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