On the planar two-center problem and circular hulls
type: Item
instance of: scholarly article
title: On the planar two-center problem and circular hulls
author: Haitao Wang
published in: Discrete \& Computational Geometry
publication date: 2022-12-08T00:00:00Z
full work available at URL: https://arxiv.org/abs/2002.07945
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 7628960
zbMATH Keywords: two centers
zbMATH Keywords: disk coverage
zbMATH Keywords: circular hulls
zbMATH Keywords: dynamic data structures
MaRDI profile type: Publication
OpenAlex ID: W4210438866
cites work: An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
cites work: The discrete 2-center problem
cites work: Bichromatic 2-center of pairs of points
cites work: Time bounds for selection
cites work: More planar two-center algorithms
cites work: A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions
cites work: An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra
cites work: On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
cites work: Slowing down sorting networks to obtain faster sorting algorithms
cites work: Q4038707
cites work: Making data structures persistent
cites work: On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
cites work: On the shape of a set of points in the plane
cites work: Dynamic Three-Dimensional Linear Programming
cites work: Q5501789
cites work: The 2-center problem with obstacles
cites work: A faster algorithm for the two-center decision problem
cites work: Finding tailored partitions
cites work: An Expander-Based Approach to Geometric Optimization
cites work: Q2766839
cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: On the Complexity of Some Common Geometric Location Problems
cites work: Maintenance of configurations in the plane
cites work: A near-linear algorithm for the planar 2-center problem
cites work: Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem
cites work: Improved algorithms for the Bichromatic Two-Center problem for pairs of points
DOI: 10.1007/S00454-021-00358-5
Recommended article: Q6060019
Recommended article: Topological analysis of the two-centre problem on the two-dimensional sphere
Recommended article: Q4828953
Recommended article: A Note on p-Center Problems in the Plane
Recommended article: The 2-center problem in three dimensions
Recommended article: Geometric p-Center Problems with Centers Constrained to Two Lines
Recommended article: On the planar piecewise quadratic 1-center problem
Recommended article: The geodesic 2-center problem in a simple polygon
Recommended article: On the 2-Center Problem Under Convex Polyhedral Distance Function
description: scientific article; zbMATH DE number 7628960