Extreme Distances in Multicolored Point Sets

DOI10.7155/JGAA.00080MaRDI QIDQ4679079zbMATH OpenOpenAlexFDO

Authors Adrian Dumitrescu, Sumanta Guha

Publication date 25 May 2005

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/51531

zbMATH Keywords

maximum multiplicity of extreme bichromatic distances

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Extreme Distances in Multicolored Point Sets
• Near equipartitions of colored point sets
• On distance sets of large sets of integer points
• On point sets with many unit distances in few directions
• Point sets with distinct distances
• Distance sets of well-distributed planar point sets
• Coloring of distance graphs with intervals as distance sets
• On the diameter of separated point sets with many nearly equal distances
• On Sets of Distances of n Points
• On the distinct distances determined by a planar point set

Cited in

(4)

• Dynamic minimum bichromatic separating circle
• Extreme Distances in Multicolored Point Sets
• Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems
• Dynamic minimum bichromatic separating circle

This page was built for publication: Extreme Distances in Multicolored Point Sets

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