-
1
-
-
23044519073
-
Schematizing maps: Simplification of geographic shape by discrete curve evolution
-
C. Freksa, W. Brauer, C. Habel, and K. F. Wender, editors, Proc. Spatial Cognition II
-
T. Barkowsky, L. J. Latecki, and K.-F. Richter. Schematizing maps: Simplification of geographic shape by discrete curve evolution. In C. Freksa, W. Brauer, C. Habel, and K. F. Wender, editors, Proc. Spatial Cognition II, volume 1849 of Lecture Notes in Artificial Intelligence, pages 41-53, 2000.
-
(2000)
Lecture Notes in Artificial Intelligence
, vol.1849
, pp. 41-53
-
-
Barkowsky, T.1
Latecki, L.J.2
Richter, K.-F.3
-
2
-
-
24344493850
-
Orthogonal drawings of graphs with vertex and edge labels
-
C. Binucci, W. Didimo, G. Liotta, and M. Nonato. Orthogonal drawings of graphs with vertex and edge labels. Comp. Geometry: Theory & Appi., 32(2):71-114, 2005.
-
(2005)
Comp. Geometry: Theory & Appi.
, vol.32
, Issue.2
, pp. 71-114
-
-
Binucci, C.1
Didimo, W.2
Liotta, G.3
Nonato, M.4
-
3
-
-
84867444566
-
Sketch-driven orthogonal graph drawing
-
Proc. 10th Int. Symp. on Graph Drawing (GD'02), Springer-Verlag
-
U. Brandes, M. Eiglsperger, M. Kaufmann, and D. Wagner, Sketch-driven orthogonal graph drawing. In Proc. 10th Int. Symp. on Graph Drawing (GD'02), volume 2528 of Lecture Notes in Computer Science, pages 1-11. Springer-Verlag, 2002.
-
(2002)
Lecture Notes in Computer Science
, vol.2528
, pp. 1-11
-
-
Brandes, U.1
Eiglsperger, M.2
Kaufmann, M.3
Wagner, D.4
-
4
-
-
0034826990
-
Schematization of road networks
-
New York. ACM Press
-
S. Cabello, M. d. Berg, S. v. Dijk, M. v. Kreveld, and T. Strijk. Schematization of road networks. In Proc. 17th Annual Symp. on Computational Geometry (SoCG'01), pages 33-39, New York, 2001. ACM Press.
-
(2001)
Proc. 17th Annual Symp. on Computational Geometry (SoCG'01)
, pp. 33-39
-
-
Cabello, S.1
Berg, M.D.2
Dijk, S.V.3
Kreveld, M.V.4
Strijk, T.5
-
6
-
-
24144446983
-
The metro map layout problem
-
J. Pach, editor, Proc. 12th Int. Symp. on Graph Drawing (GD'04) Springer-Verlag
-
S.-H. Hong, D. Merrick, and H. A. D. d. Nascimento. The metro map layout problem. In J. Pach, editor, Proc. 12th Int. Symp. on Graph Drawing (GD'04), volume 3383 of Lecture Notes in Computer Science, pages 482-491. Springer-Verlag, 2005.
-
(2005)
Lecture Notes in Computer Science
, vol.3383
, pp. 482-491
-
-
Hong, S.-H.1
Merrick, D.2
Nascimento, H.A.D.D.3
-
7
-
-
38349007404
-
Automated drawings of metro maps
-
Universität Karlsruhe
-
M. Nöllenburg. Automated drawings of metro maps. Technical Report 2005-25, Universität Karlsruhe, 2005. Available at http://www.ubka.uni- karlsruhe.de/cgi-bin/psview?document=/ira/2005/25.
-
(2005)
Technical Report
, vol.2005
, Issue.25
-
-
Nöllenburg, M.1
-
9
-
-
84987975715
-
A metro map metaphor for guided tours on the Web: The Webvise Guided Tour System
-
Hong Kong. ACM Press
-
E. S. Sandvad, K. Grønbaek, L. Sloth, and J. L. Knudsen. A metro map metaphor for guided tours on the Web: the Webvise Guided Tour System. In Proc. 10th Int. World Wide Web Conf. (WWW'01), p. 326-333, Hong Kong, 2001. ACM Press.
-
(2001)
Proc. 10th Int. World Wide Web Conf. (WWW'01)
, pp. 326-333
-
-
Sandvad, E.S.1
Grønbaek, K.2
Sloth, L.3
Knudsen, J.L.4
-
11
-
-
84858909099
-
-
Sydney CityRail. www.cityrail.nsw.gov.au/networkmaps/network_map.pdf.
-
-
-
-
12
-
-
0023366861
-
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):421-444, 1987.
-
(1987)
SIAM J. Comput.
, vol.16
, Issue.3
, pp. 421-444
-
-
Tamassia, R.1
|