More planar two-center algorithms
type: Item
instance of: scholarly article
title: More planar two-center algorithms
zbMATH Open document ID: 0948.68196
DOI: 10.1016/S0925-7721(99)00019-X
author: Timothy M. Chan
published in: Computational Geometry
publication date: 2000-01-17T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1389794
zbMATH Keywords: planar Euclidean two-center problem
MaRDI profile type: Publication
full work available at URL: s0925-7721(99)00019-x
OpenAlex ID: W2046812523
Recommended article: Efficient planar two-center algorithms
Recommended article: A near-linear algorithm for the planar 2-center problem
Recommended article: Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem
Recommended article: An Algorithm for the p-Center Problem in the Plane
Recommended article: Q2766839
Recommended article: A near-linear algorithm for the planar segment-center problem
Recommended article: Q4335198
Recommended article: Improved algorithms for the Bichromatic Two-Center problem for pairs of points
Recommended article: Improved algorithms for the bichromatic two-center problem for pairs of points
description: scientific article; zbMATH DE number 1389794