Efficient algorithms for bichromatic separability

DOI10.1145/1150334.1150338zbMath1321.68422OpenAlexW2027237344MaRDI QIDQ2944513

Vladlen Koltun, Boris Aronov, Pankaj K. Agarwal

Publication date: 2 September 2015

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1150334.1150338

zbMATH Keywords

arrangementsseparabilitygeometric algorithms

Mathematics Subject Classification ID

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

Related Items (3)

Dynamic minimum bichromatic separating circle ⋮ Separating bichromatic point sets in the plane by restricted orientation convex hulls ⋮ Witness (Delaunay) graphs

This page was built for publication: Efficient algorithms for bichromatic separability