메뉴 건너뛰기




Volumn 30, Issue 3, 2005, Pages 223-238

Schematization of networks

Author keywords

Homotopy; Map; Schema; Visualization

Indexed keywords


EID: 84867928342     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2004.11.002     Document Type: Article
Times cited : (42)

References (21)
  • 1
    • 84867981108 scopus 로고    scopus 로고
    • http://www.cs.uu.nl/archive/sw/schematic-map/
  • 2
    • 0035148852 scopus 로고    scopus 로고
    • Rendering effective route maps: Improving usability through generalization
    • M. Agrawala, and C. Stolte Rendering effective route maps: improving usability through generalization Proc. SIGGRAPH 2001 2001 241 250 http://graphics.stanford.edu/papers/routemaps/
    • (2001) Proc. SIGGRAPH 2001 , pp. 241-250
    • Agrawala, M.1    Stolte, C.2
  • 3
    • 33750204236 scopus 로고    scopus 로고
    • Modeling a public transport network for generation of schematic maps and location queries
    • S. Avelar, and R. Huber Modeling a public transport network for generation of schematic maps and location queries Proc. 20th Int. Cartographic Conference 2001 1472 1480
    • (2001) Proc. 20th Int. Cartographic Conference , pp. 1472-1480
    • Avelar, S.1    Huber, R.2
  • 5
    • 23044519073 scopus 로고    scopus 로고
    • Schematizing maps: Simplification of geographic shape by discrete curve evolution
    • Lecture Notes in Artificial Intelligence
    • T. Barbowsky, L.J. Latecki, and K. Richter Schematizing maps: simplification of geographic shape by discrete curve evolution Spatial Cognition II Lecture Notes in Artificial Intelligence vol. 1849 2000 41 48
    • (2000) Spatial Cognition II , vol.1849 , pp. 41-48
    • Barbowsky, T.1    Latecki, L.J.2    Richter, K.3
  • 7
    • 52449145684 scopus 로고
    • An algorithm for segment-dragging and its implementation
    • B. Chazelle An algorithm for segment-dragging and its implementation Algorithmica 3 1988 205 221
    • (1988) Algorithmica , vol.3 , pp. 205-221
    • Chazelle, B.1
  • 10
  • 11
    • 84938062776 scopus 로고    scopus 로고
    • Computing homotopic shortest paths efficiently
    • Lecture Notes in Comput. Sci.
    • A. Efrat, S.G. Kobourov, and A. Lubiw Computing homotopic shortest paths efficiently 10th Annual European Symposium, ESA'02 Lecture Notes in Comput. Sci. vol. 2461 2002 411 423
    • (2002) 10th Annual European Symposium, ESA'02 , vol.2461 , pp. 411-423
    • Efrat, A.1    Kobourov, S.G.2    Lubiw, A.3
  • 12
    • 80052420281 scopus 로고
    • Designing a network line-map schematization software enhancement package
    • D. Elroi Designing a network line-map schematization software enhancement package Proc. 8th Ann. ESRI User Conference 1988 http://www.elroi.com/fr2- publications.html
    • (1988) Proc. 8th Ann. ESRI User Conference
    • Elroi, D.1
  • 13
    • 0024179985 scopus 로고
    • GIS and schematic maps: A new symbiotic relationship
    • D. Elroi GIS and schematic maps: a new symbiotic relationship Proc. GIS/LIS'88 1988 http://www.elroi.com/fr2-publications.html
    • (1988) Proc. GIS/LIS'88
    • Elroi, D.1
  • 16
    • 0022715631 scopus 로고
    • Efficient algorithms for geometric graph search problems
    • H. Imai, and T. Asano Efficient algorithms for geometric graph search problems SIAM J. Comput. 15 2 1986 478 494
    • (1986) SIAM J. Comput. , vol.15 , Issue.2 , pp. 478-494
    • Imai, H.1    Asano, T.2
  • 17
    • 0003651513 scopus 로고    scopus 로고
    • Testing homotopic routability under polygonal wiring rules
    • F.M. Maley Testing homotopic routability under polygonal wiring rules Algorithmica 15 1996 1 16
    • (1996) Algorithmica , vol.15 , pp. 1-16
    • Maley, F.M.1
  • 18
    • 84948953854 scopus 로고    scopus 로고
    • Line simplication with restricted orientations
    • Lecture Notes in Comput. Sci.
    • G. Neyer Line simplication with restricted orientations Algorithms and Data Structures, WADS'99 Lecture Notes in Comput. Sci. vol. 1663 1999 13 24
    • (1999) Algorithms and Data Structures, WADS'99 , vol.1663 , pp. 13-24
    • Neyer, G.1
  • 19
    • 0028667911 scopus 로고
    • Counting and reporting red/blue segment intersections
    • L. Palazzi, and J. Snoeyink Counting and reporting red/blue segment intersections CVGIP: Graph. Models Image Process. 56 4 1994 304 311
    • (1994) CVGIP: Graph. Models Image Process. , vol.56 , Issue.4 , pp. 304-311
    • Palazzi, L.1    Snoeyink, J.2
  • 21
    • 0023366861 scopus 로고
    • On embedding a graph in the grid with the minimum number of bends
    • R. Tamassia On embedding a graph in the grid with the minimum number of bends SIAM J. Comput. 16 3 1987 421 444
    • (1987) SIAM J. Comput. , vol.16 , Issue.3 , pp. 421-444
    • Tamassia, R.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.