Computing the smallest k-enclosing circle and related problems
From MaRDI portal
(Redirected from Publication:1328752)
Computing the smallest \(k\)-enclosing circle and related problems
Computing the smallest \(k\)-enclosing circle and related problems
Recommendations
Cites work
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 1256643 (Why is no real title available?)
- scientific article; zbMATH DE number 1256675 (Why is no real title available?)
- scientific article; zbMATH DE number 1003238 (Why is no real title available?)
- scientific article; zbMATH DE number 742950 (Why is no real title available?)
- scientific article; zbMATH DE number 742951 (Why is no real title available?)
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- 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
- Finding k points with minimum diameter and related problems
- Improvements on geometric pattern matching problems
- Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
- New upper bounds for neighbor searching
- On \(k\)-sets in arrangements of curves and surfaces
- On enclosing k points by a circle
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- Optimal Point Location in a Monotone Subdivision
- Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams
- Slowing down sorting networks to obtain faster sorting algorithms
- Sorting in \(c \log n\) parallel steps
- Static and dynamic algorithms for k-point clustering problems
Cited in
(43)- An Efficient Geometric Solution to the Minimum Spanning Circle Problem
- Computing the smallest k-enclosing circle and related problems
- Minimum enclosing circle of a set of fixed points and a mobile point
- Cause I'm a genial imprecise point: outlier detection for uncertain data
- A fast deterministic smallest enclosing disk approximation algorithm
- Quantile approximation for robust statistical estimation and \(k\)-enclosing problems
- Some variations on constrained minimum enclosing circle problem
- Computing the Smallest T-Shaped Polygon Containing k Points
- Offset-polygon annulus placement problems
- Selecting distances in arrangements of hyperplanes spanned by points.
- Fast algorithms for computing the smallest \(k\)-enclosing circle
- On the geometry of the smallest circle enclosing a finite set of points
- scientific article; zbMATH DE number 7651177 (Why is no real title available?)
- Offset-polygon annulus placement problems
- 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
- Enclosing k points in the smallest axis parallel rectangle
- Smallest \(k\)-enclosing rectangle revisited
- Geometric applications of posets
- Covering points with a polygon
- A novel approximation algorithm for max-covering circle problem
- 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 reformulation-linearization based algorithm for the smallest enclosing circle problem
- A near-linear algorithm for the planar segment-center problem
- Optimal algorithms for constrained 1-center problems
- Hybrid k-clustering: blending k-median and k-center
- Complexity and approximation of the smallest k-enclosing ball problem
- On k-Hulls and Related Problems
- Minimum enclosing circle with few extra variables
- On k-enclosing slab problems
- Efficient Speed-Up of the Smallest Enclosing Circle Algorithm
- Some variations on constrained minimum enclosing circle problem
- THE LARGEST EMPTY ANNULUS PROBLEM
- Minimum-area enclosing triangle with a fixed angle
- Hybrid k-clustering: blending k-median and k-center
- Finding k points with minimum diameter and related problems
- Discrete Voronoi games and -nets, in two and three dimensions
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)
