Angle-restricted Steiner arborescences for flow map layout

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7074 LNCS, Issue , 2011, Pages 250-259

  Buchin, Kevin ^a   Speckmann, Bettina ^a   Verbeek, Kevin ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

FLOW MAPS; LOGARITHMIC SPIRAL; NP-HARD; OR FLUXES; SELF-INTERSECTIONS; STEINER ARBORESCENCE; VISUAL CLUTTER;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FORESTRY; OPTIMIZATION;

TREES (MATHEMATICS);

ALGORITHMS; FORESTRY; MATHEMATICS; OPTIMIZATION; TREES;

EID: 84055200221     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25591-5_27     Document Type: Conference Paper

References (18)

1. CSISS - Spatial Tools: Tobler's Flow Mapper, http://www.csiss.org/ clearinghouse/FlowMapper
2. Aichholzer, O., Aurenhammer, F., Icking, C., Klein, R., Langetepe, E., Rote, G.: Generalized self-approaching curves. Discr. Appl. Mathem. 109(1-2), 3-24 (2001)
3. Awerbuch, B., Baratz, A., Peleg, D.: Cost-sensitive analysis of communication protocols. In: Proc. 9th ACM Symposium on Principles of Distributed Computing, pp. 177-187. ACM (1990)
4. Brazil, M., Rubinstein, J.H., Thomas, D.A., Weng, J.F., Wormald, N.C.: Gradient-constrained minimum networks. I. Fundamentals. Journal of Global Optimization 21, 139-155 (2001)
5. Brazil, M., Thomas, D.A.: Network optimization for the design of underground mines. Networks 49, 40-50 (2007)
6. Buchin, K., Speckmann, B., Verbeek, K.: Flow map layout via spiral trees. IEEE Transactions on Visualization and Computer Graphics (to appear, 2011) (Proceedings Visualization / Information Visualization 2011)
7. Córdova, J., Lee, Y.: A heuristic algorithm for the rectilinear Steiner arborescence problem. Technical report, Engineering Optimization (1994)
8. Dent, B.D.: Cartography: Thematic Map Design, 5th edn. McGraw-Hill, New York (1999)
9. Krozel, J., Lee, C., Mitchell, J.: Turn-constrained route planning for avoiding hazardous weather. Air Traffic Control Quarterly 14(2), 159-182 (2006)
10. Lu, B., Ruan, L.: Polynomial time approximation scheme for the rectilinear Steiner arborescence problem. J. Comb. Optimization 4(3), 357-363 (2000)
11. Mitchell, J.: L1 shortest paths among polygonal obstacles in the plane. Algorithmica 8, 55-88 (1992)
12. Phan, D., Xiao, L., Yeh, R., Hanrahan, P., Winograd, T.: Flow map layout. In: Proc. IEEE Symposium on Information Visualization, pp. 219-224 (2005)
13. Ramnath, S.: New approximations for the rectilinear Steiner arborescence problem. IEEE Trans. Computer-Aided Design Integ. Circuits Sys. 22(7), 859-869 (2003)
14. Rao, S., Sadayappan, P., Hwang, F., Shor, P.: The rectilinear Steiner arborescence problem. Algorithmica 7, 277-288 (1992)
15. Shi, W., Su, C.: The rectilinear Steiner arborescence problem is NP-complete. In: Proc. 11th ACM-SIAM Symposium on Discrete Algorithms, pp. 780-787 (2000)
16. Shi, W., Su, C.: The rectilinear Steiner arborescence problem is NP-complete. SIAM Journal on Computing 35(3), 729-740 (2005)
17. Slocum, T.A., McMaster, R.B., Kessler, F.C., Howard, H.H.: Thematic Cartography and Geovisualization, 3rd edn. Pearson, New Jersey (2010)
18. Tobler, W.: Experiments in migration mapping by computer. The American Cartographer 14(2), 155-163 (1987)