Minimization of the Hausdorff distance between convex polyhedrons

ISSN： 1072-3374

Source： Journal of Mathematical Sciences, Vol.126, Iss.6, 2005-04, pp. : 1553-1560

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Efficient Computation of the Hausdorff Distance Between Polytopes by Exterior Random Covering

By Llanas Bernardo

Computational Optimization and Applications, Vol. 30, Iss. 2, 2005-02 ,pp. : 161-194

Springer Publishing Company

Access to resources Recommend Favorite

Minimal distance between two non-convex surfaces

By Gao David

Optimization, Vol. 57, Iss. 5, 2008-01 ,pp. : 705-714

Taylor & Francis Ltd

Access to resources Recommend Favorite

A counter-example to 'minimal distance between two non-convex surfaces'

By Voisei M. D.

Optimization, Vol. 60, Iss. 5, 2011-01 ,pp. : 593-602

Taylor & Francis Ltd

Access to resources Recommend Favorite

Minimization of convex functions on the convex hull of a point set

By Botkin Nikolai

Mathematical Methods of Operations Research, Vol. 62, Iss. 2, 2005-11 ,pp. : 167-185

Springer Publishing Company

Access to resources Recommend Favorite

Subgradient Method with Entropic Projections for Convex Nondifferentiable Minimization

By Kiwiel K.C.

Journal of Optimization Theory and Applications, Vol. 96, Iss. 1, 1998-01 ,pp. : 159-173

Springer Publishing Company

Access to resources Recommend Favorite