Convex Minimization on a Grid and Applications

DOI10.1006/JAGM.1997.0908MaRDI QIDQ4386447zbMATH OpenOpenAlexFDO

Authors Claudio Mirolo

Publication date 19 August 1998

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1997.0908

zbMATH Keywords

convex minimization problemdirected acyclic graphsproximity measures

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10) Convex programming (90C25)

Recommendations

• An optimal algorithm for solving collision distance between convex polygons in plane
• Minimization of convex functions on the convex hull of a point set
• Collision of convex objects
• Computation of a penetration measure between 3D convex polyhedral objects for collision detection

Cited in

(1)

• scientific article; zbMATH DE number 3954181 (Why is no real title available?)

This page was built for publication: Convex Minimization on a Grid and Applications

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