Computing the smallest k-enclosing circle and related problems

DOI10.1007/3-540-57155-8_259zbMath1504.68253OpenAlexW1604849244MaRDI QIDQ5060125

Alon Ziv, Alon Efrat, Micha Sharir

Publication date: 18 January 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57155-8_259

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

Efficient Speed-Up of the Smallest Enclosing Circle Algorithm ⋮ On geometric optimization with few violated constraints ⋮ A branch-and-bound method for the minimum \(k\)-enclosing ball problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
• Sorting in \(c \log n\) parallel steps
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams
• An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
• On \(k\)-sets in arrangements of curves and surfaces
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Optimal Point Location in a Monotone Subdivision
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Slowing down sorting networks to obtain faster sorting algorithms
• Improvements on geometric pattern matching problems

This page was built for publication: Computing the smallest k-enclosing circle and related problems