Computing Maximally Separated Sets in the Plane

DOI10.1137/S0097539704446591zbMath1120.68102OpenAlexW2044131007MaRDI QIDQ3446821

Micha Sharir, Pankaj K. Agarwal, Mark H. Overmars

Publication date: 26 June 2007

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539704446591

zbMATH Keywords

independent setgeometric optimizationdisk-intersection graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (3)

Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams ⋮ On reverse shortest paths in geometric proximity graphs ⋮ Shortest paths in intersection graphs of unit disks

This page was built for publication: Computing Maximally Separated Sets in the Plane