FINDING k FARTHEST PAIRS AND k CLOSEST/FARTHEST BICHROMATIC PAIRS FOR POINTS IN THE PLANE

DOI10.1142/S0218195995000040MaRDI QIDQ4698351zbMATH OpenOpenAlexFDO

Authors Naoki Katoh, Kazuo Iwano

Publication date 22 August 1995

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195995000040

zbMATH Keywords

Voronoi diagramsgeometric enumeration problems

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Recommendations

• Extreme Distances in Multicolored Point Sets
• Extreme Distances in Multicolored Point Sets
• ON ENUMERATING AND SELECTING DISTANCES
• A simple algorithm for enumerating longest distances in the plane

Cited in

(10)

• Bichromatic 2-center of pairs of points
• Bichromatic 2-center of pairs of points
• Extreme Distances in Multicolored Point Sets
• Geometric applications of posets
• Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems
• Toward Tight Approximation Bounds for Graph Diameter and Eccentricities
• Searching edges in the overlap of two plane graphs
• Group nearest-neighbor queries in the \(L_1\) plane
• Approximate k-closest-pairs in large high-dimensional data sets
• ON ENUMERATING AND SELECTING DISTANCES

This page was built for publication: FINDING k FARTHEST PAIRS AND k CLOSEST/FARTHEST BICHROMATIC PAIRS FOR POINTS IN THE PLANE

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4698351)