Extreme Distances in Multicolored Point Sets
Journal of Graph Algorithms and Applications, Tome 8 (2004) no. 1, pp. 27-38.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

Given a set of n colored points in some d-dimensional Euclidean space, a bichromatic closest (resp. farthest) pair is a closest (resp. farthest) pair of points of different colors. We present efficient algorithms to maintain both a bichromatic closest pair and a bichromatic farthest pair when the the points are fixed but they dynamically change color. We do this by solving the more general problem of maintaining a bichromatic edge of minimum (resp. maximum) weight in an undirected weighted graph with colored vertices, when vertices dynamically change color. We also give some combinatorial bounds on the maximum multiplicity of extreme bichromatic distances in the plane.
@article{JGAA_2004_8_1_a2,
     author = {Adrian Dumitrescu and Sumanta Guha},
     title = {Extreme {Distances} in {Multicolored} {Point} {Sets}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {27--38},
     publisher = {mathdoc},
     volume = {8},
     number = {1},
     year = {2004},
     doi = {10.7155/jgaa.00080},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00080/}
}
TY  - JOUR
AU  - Adrian Dumitrescu
AU  - Sumanta Guha
TI  - Extreme Distances in Multicolored Point Sets
JO  - Journal of Graph Algorithms and Applications
PY  - 2004
SP  - 27
EP  - 38
VL  - 8
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00080/
DO  - 10.7155/jgaa.00080
LA  - en
ID  - JGAA_2004_8_1_a2
ER  - 
%0 Journal Article
%A Adrian Dumitrescu
%A Sumanta Guha
%T Extreme Distances in Multicolored Point Sets
%J Journal of Graph Algorithms and Applications
%D 2004
%P 27-38
%V 8
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00080/
%R 10.7155/jgaa.00080
%G en
%F JGAA_2004_8_1_a2
Adrian Dumitrescu; Sumanta Guha. Extreme Distances in Multicolored Point Sets. Journal of Graph Algorithms and Applications, Tome 8 (2004) no. 1, pp. 27-38. doi : 10.7155/jgaa.00080. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00080/

Cité par Sources :