The Minkowskij distance between two disjoint convex polyhedral sets

MaRDI QIDQ2563378zbMATH OpenFDO

Authors Eh. G. Davydov

Publication date 11 December 1996

Published in Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

convex polyhedraconvex programminglinear programmingMinkowskii distance

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Linear programming (90C05) Convex programming (90C25)

Review text

This note generalizes the results of \textit{Eh. G. Davydov} [Operations Research, Moskva (1990)]. It is shown how to find in a direct way the distance between two nonintersected convex polyhedrals with respect to a Minkowskii norm.

Recommendations

• scientific article; zbMATH DE number 730000
• Finding the minimum vertex distance between two disjoint convex polygons in linear time
• scientific article; zbMATH DE number 2202078
• Computing the extreme distances between two convex polygons
• scientific article; zbMATH DE number 740451

Cited in

(5)

• The distance between convex sets with Minkowski sum structure: application to collision detection
• The distance between two convex sets
• Distances between closed convex cones: old and new results
• scientific article; zbMATH DE number 4126182 (Why is no real title available?)
• scientific article; zbMATH DE number 730000 (Why is no real title available?)

This page was built for publication: The Minkowskij distance between two disjoint convex polyhedral sets

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