Charged ball method for solving some computational geometry problems

DOI10.3103/S1063454117030025zbMath1434.90145OpenAlexW2753709053MaRDI QIDQ2289102

Majid E. Abbasov

Publication date: 28 January 2020

Published in: Vestnik St. Petersburg University. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1063454117030025

zbMATH Keywords

convex optimizationcomputational geometryminimal distancecharged ball method

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Stability of solutions to ordinary differential equations (34D20)

Related Items (3)

Comparison of methods computing the distance between two ellipsoids ⋮ Randomized heuristic algorithms for orthogonal projection of a point onto a set ⋮ The alternating direction method of multipliers for finding the distance between ellipsoids

Cites Work

• On the Distance between Two Ellipsoids
• Finding the distance between ellipsoids
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Charged ball method for solving some computational geometry problems