A near-linear algorithm for the planar segment-center problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 732977 (Why is no real title available?)
- 1-Segment Center Problems
- A Turán-type theorem on chords of a convex polygon
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications
- Almost tight upper bounds for lower envelopes in higher dimensions
- An Extremal Problem on Sparse 0-1 Matrices
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- COMPUTING SHORTEST TRANSVERSALS OF SETS
- Computing a Segment Center for a Planar Point Set
- Computing the smallest k-enclosing circle and related problems
- Diameter, width, closest line pair, and parametric searching
- Extremal polygon containment problems
- Geometric complexity of some location problems
- Geometric pattern matching under Euclidean motion
- On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space
- Optimal Point Location in a Monotone Subdivision
- Parallel Transitive Closure and Point Location in Planar Structures
- Parallelism in Comparison Problems
- Static and dynamic algorithms for k-point clustering problems
- The maximum number of unit distances in a convex n-gon
- The overlay of lower envelopes and its applications
Cited in
(20)- Simple wriggling is hard unless you are a fat hippo
- Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem
- scientific article; zbMATH DE number 5667431 (Why is no real title available?)
- Linear-size universal discretization of geometric center-based problems in fixed dimensions
- scientific article; zbMATH DE number 7053339 (Why is no real title available?)
- More planar two-center algorithms
- Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane
- Approximation algorithms for a \(k\)-line center
- A near-linear algorithm for the planar 2-center problem
- Capturing the shape of a point set with a line segment
- A linear time deterministic algorithm to find a small subset that approximates the centroid
- Continuous location of dimensional structures.
- Efficient algorithms for computing one or two discrete centers hitting a set of line segments
- A simple linear algorithm for computing rectilinear 3-centers
- Computing a Segment Center for a Planar Point Set
- On 0-1 matrices and small excluded submatrices
- On solving the planar k-centrum problem with Euclidean distances
- 1-Segment Center Problems
- Tight bounds on the maximum size of a set of permutations with bounded VC-dimension
- Approximation algorithms for orthogonal line centers
This page was built for publication: A near-linear algorithm for the planar segment-center problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1816414)
