Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

The Minkowskij distance between two disjoint convex polyhedral sets

From MaRDI portal
Publication:2563378
Jump to:navigation, search

zbMATH Open0856.52011MaRDI QIDQ2563378

Eh. G. Davydov

Publication date: 11 December 1996

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




zbMATH Keywords

linear programmingconvex programmingconvex polyhedraMinkowskii distance


Mathematics Subject Classification ID

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



Related Items (1)

The distance between convex sets with Minkowski sum structure: application to collision detection






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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2563378&oldid=15314167"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 07:31.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki