A geometric proof of the combinatorial bounds for the number of optimal solutions for the Euclidean 2-center problem

DOI10.1016/S0925-7721(99)00035-8zbMath0939.68149OpenAlexW2072918044MaRDI QIDQ1969591

Jerzy W. Jaromczyk, Mirosław Kowaluk

Publication date: 25 April 2000

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(99)00035-8

zbMATH Keywords

two-center problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

This page was built for publication: A geometric proof of the combinatorial bounds for the number of optimal solutions for the Euclidean 2-center problem