An optimal and practical algorithm for the planar 2-center problem
From MaRDI portal
Cites work
- A faster algorithm for the two-center decision problem
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- A near-linear algorithm for the planar 2-center problem
- An Expander-Based Approach to Geometric Optimization
- Computational geometry. Algorithms and applications.
- Covering convex polygons by two congruent disks
- Dynamic Three-Dimensional Linear Programming
- Efficient planar two-center algorithms
- Finding tailored partitions
- scientific article; zbMATH DE number 1696646 (Why is no real title available?)
- scientific article; zbMATH DE number 6472586 (Why is no real title available?)
- Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
- More planar two-center algorithms
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
- On the Complexity of Some Common Geometric Location Problems
- On the planar two-center problem and circular hulls
- Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem
- The 2-center problem in three dimensions
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
Cited in
(1)
This page was built for publication: An optimal and practical algorithm for the planar 2-center problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6940314)
