All Farthest Neighbors in the Presence of Highways and Obstacles-Reference-Cited by-同舟云学术

All Farthest Neighbors in the Presence of Highways and Obstacles

Published:2009 Issue: Volume: Page:71-82
ISSN:0302-9743
Container-title:WALCOM: Algorithms and Computation
language:
Short-container-title:

Author:

Bae Sang Won,Korman Matias,Tokuyama Takeshi

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-00202-1_7

Reference12 articles.

1. Agarwal, P.K., Matoušek, J.: On range searching with semialgebraic sets. Discrete Comput. Geom. 11(1), 393–418 (1994)

2. Ahn, H.-K., Alt, H., Asano, T., Bae, S.W., Brass, P., Cheong, O., Knauer, C., Na, H.-S., Shin, C.-S., Wolff, A.: Constructing optimal highways. In: Proc. 13th Comput., Australasian Theory Sympos. (CATS), Ballarat, Australia. CRPIT, vol. 65, pp. 7–14. ACS (2007)

3. Aichholzer, O., Aurenhammer, F., Palop, B.: Quickest paths, straight skeletons, and the city Voronoi diagram. In: Proc. 18th Annu. ACM Sympos. Comput. Geom., pp. 151–159 (2002)

4. Bae, S.W., Chwa, K.-Y.: The farthest city Voronoi diagram. In: Proc. of the First Meeting of AAAC (2008)

5. Lecture Notes in Computer Science;S.W. Bae,2006

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The 1-Center and 1-Highway problem revisited;Annals of Operations Research;2015-01-26

2. Locating a single facility and a high-speed line;European Journal of Operational Research;2014-07

3. The 1-median and 1-highway problem;European Journal of Operational Research;2013-03

4. Group Nearest Neighbor Queries in the L 1 Plane;Lecture Notes in Computer Science;2013

5. The 1-Center and 1-Highway Problem;Lecture Notes in Computer Science;2012