Computing the smallest k-enclosing circle and related problems
From MaRDI portal
Publication:1328752
DOI10.1016/0925-7721(94)90003-5zbMATH Open0807.68102OpenAlexW2007046733MaRDI QIDQ1328752FDOQ1328752
Alon Efrat, Micha Sharir, Alon Ziv
Publication date: 3 August 1994
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0925-7721(94)90003-5
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- On enclosing k points by a circle
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- Slowing down sorting networks to obtain faster sorting algorithms
- Sorting in \(c \log n\) parallel steps
- Finding k points with minimum diameter and related problems
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Optimal Point Location in a Monotone Subdivision
- Static and dynamic algorithms for k-point clustering problems
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- Title not available (Why is that?)
- Improvements on geometric pattern matching problems
- Title not available (Why is that?)
- On \(k\)-sets in arrangements of curves and surfaces
- Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- New upper bounds for neighbor searching
Cited In (31)
- Quantile approximation for robust statistical estimation and \(k\)-enclosing problems
- Geometric Applications of Posets
- Cause I'm a genial imprecise point: outlier detection for uncertain data
- Computing the Smallest T-Shaped Polygon Containing k Points
- Offset-polygon annulus placement problems
- Selecting distances in arrangements of hyperplanes spanned by points.
- Title not available (Why is that?)
- Fast algorithms for computing the smallest \(k\)-enclosing circle
- Offset-polygon annulus placement problems
- On the geometry of the smallest circle enclosing a finite set of points
- Complexity and approximation of the smallest \(k\)-enclosing ball problem
- Geometric applications of posets
- Optimal placement of convex polygons to maximize point containment
- On enclosing k points by a circle
- Smallest \(k\)-enclosing rectangle revisited
- A novel approximation algorithm for max-covering circle problem
- Covering points with a polygon
- Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon
- A simple algorithm for computing the smallest enclosing circle
- Translating a convex polygon to contain a maximum number of points.
- Solution methodologies for the smallest enclosing circle problem
- Algorithms - ESA 2003
- A near-linear algorithm for the planar segment-center problem
- On k-Hulls and Related Problems
- Efficient Speed-Up of the Smallest Enclosing Circle Algorithm
- THE LARGEST EMPTY ANNULUS PROBLEM
- Minimum-area enclosing triangle with a fixed angle
- Finding k points with minimum diameter and related problems
- An Efficient Geometric Solution to the Minimum Spanning Circle Problem
- Discrete Voronoi games and \(\epsilon\)-nets, in two and three dimensions
- Computing the smallest k-enclosing circle and related problems
This page was built for publication: Computing the smallest \(k\)-enclosing circle and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328752)
