On the planar two-center problem and circular hulls
From MaRDI portal
Publication:2105328
DOI10.1007/s00454-021-00358-5OpenAlexW4210438866MaRDI QIDQ2105328
Publication date: 8 December 2022
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.07945
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (2)
Efficient \(k\)-center algorithms for planar points in convex position ⋮ Covering convex polygons by two congruent disks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A faster algorithm for the two-center decision problem
- A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions
- Making data structures persistent
- Maintenance of configurations in the plane
- The discrete 2-center problem
- A near-linear algorithm for the planar 2-center problem
- Time bounds for selection
- More planar two-center algorithms
- Bichromatic 2-center of pairs of points
- Improved algorithms for the Bichromatic Two-Center problem for pairs of points
- Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem
- The 2-Center Problem with Obstacles
- On the Complexity of Some Common Geometric Location Problems
- Finding tailored partitions
- An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
- On the shape of a set of points in the plane
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
- An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra
- Dynamic Three-Dimensional Linear Programming
- An Expander-Based Approach to Geometric Optimization
- Slowing down sorting networks to obtain faster sorting algorithms
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
This page was built for publication: On the planar two-center problem and circular hulls
