A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes

DOI10.1007/BF03167575zbMath0797.90056OpenAlexW2003555453MaRDI QIDQ689920

Yoshitsugu Yamamoto, Kazuyuki Sekitani

Publication date: 6 January 1994

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03167575

zbMATH Keywords

minimum covering sphereconcentric spheressmallest sum of radiisphere with the smallest radius

Mathematics Subject Classification ID

Continuous location (90B85) Quadratic programming (90C20)

Related Items (4)

Calculating a minimal sphere containing a polytope defined by a system of linear inequalities ⋮ CONSTRAINED OPTIMAL LOCATION ⋮ Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities ⋮ Chebyshev centres, Jung constants, and their applications

Cites Work

• Unnamed Item
• Unnamed Item
• A simple algorithm for computing the smallest enclosing circle
• Weighted min-max location problems: Polynomially bounded algorithms
• The weighted Euclidean 1-center problem
• A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
• The Weighted Euclidean 1-Center Problem
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Single Facility $l_p $-Distance Minimax Location
• Finding the nearest point in A polytope
• On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
• The Minimum Covering Sphere Problem

This page was built for publication: A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes