메뉴 건너뛰기




Volumn 5664 LNCS, Issue , 2009, Pages 266-277

Orientation-constrained rectangular layouts

Author keywords

[No Author keywords available]

Indexed keywords

DUAL GRAPHS; POLYNOMIAL-TIME;

EID: 69949151421     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03367-4_24     Document Type: Conference Paper
Times cited : (5)

References (14)
  • 2
    • 0342703812 scopus 로고
    • Architectural applications of graph theory
    • Wilson, R, Beineke, L, eds, Academic Press, London
    • Earl, C.F., March, L.J.: Architectural applications of graph theory. In: Wilson, R., Beineke, L. (eds.) Applications of Graph Theory, pp. 327-355. Academic Press, London (1979)
    • (1979) Applications of Graph Theory , pp. 327-355
    • Earl, C.F.1    March, L.J.2
  • 4
    • 33745671115 scopus 로고    scopus 로고
    • Fusy, É.: Transversal structures on triangulations, with application to straight-line drawing. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, 3843, pp. 177-188. Springer, Heidelberg (2006)
    • Fusy, É.: Transversal structures on triangulations, with application to straight-line drawing. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 177-188. Springer, Heidelberg (2006)
  • 5
    • 61749099418 scopus 로고    scopus 로고
    • Transversal structures on triangulations: A combinatorial study and straight-line drawings
    • to appear
    • Fusy, É.: Transversal structures on triangulations: A combinatorial study and straight-line drawings. Discrete Mathematics (to appear, 2009)
    • (2009) Discrete Mathematics
    • Fusy, E.1
  • 6
    • 0031069913 scopus 로고    scopus 로고
    • Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
    • Kant, G., He, X.: Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theoretical Computer Science 172(1-2), 175-193 (1997)
    • (1997) Theoretical Computer Science , vol.172 , Issue.1-2 , pp. 175-193
    • Kant, G.1    He, X.2
  • 7
    • 0022076860 scopus 로고
    • Rectangular duals of planar graphs
    • Koźmiński, K., Kinnen, E.: Rectangular duals of planar graphs. Networks 5(2), 145-157 (1985)
    • (1985) Networks , vol.5 , Issue.2 , pp. 145-157
    • Koźmiński, K.1    Kinnen, E.2
  • 8
    • 0041928206 scopus 로고    scopus 로고
    • Compact floor-planning via orderly spanning trees
    • Liao, C.-C., Lu, H.-I., Yen, H.-C.: Compact floor-planning via orderly spanning trees. Journal of Algorithms 48, 441-451 (2003)
    • (2003) Journal of Algorithms , vol.48 , pp. 441-451
    • Liao, C.-C.1    Lu, H.-I.2    Yen, H.-C.3
  • 10
    • 0347132820 scopus 로고    scopus 로고
    • Generating random elements of finite distributive lattices
    • Propp, J.: Generating random elements of finite distributive lattices. Electronic J. Combinatorics 4(2), R15 (1997)
    • (1997) Electronic J. Combinatorics , vol.4 , Issue.2
    • Propp, J.1
  • 11
    • 0009934360 scopus 로고
    • The rectangular statistical cartogram
    • Raisz, E.: The rectangular statistical cartogram. Geographical Review 24(2), 292-296 (1934)
    • (1934) Geographical Review , vol.24 , Issue.2 , pp. 292-296
    • Raisz, E.1
  • 12
    • 3342892045 scopus 로고
    • Rectangular and orthogonal floorplans with required rooms areas and tree adjacency
    • Rinsma, I.: Rectangular and orthogonal floorplans with required rooms areas and tree adjacency. Environment and Planning B: Planning and Design 15, 111-118 (1988)
    • (1988) Environment and Planning B: Planning and Design , vol.15 , pp. 111-118
    • Rinsma, I.1
  • 13
    • 0025623784 scopus 로고
    • Generation of rectangular duals of a planar triangulated graph by elementary transformations
    • Tang, H., Chen, W.-K.: Generation of rectangular duals of a planar triangulated graph by elementary transformations. In: IEEE Int. Symp. Circuits and Systems, vol. 4, pp. 2857-2860 (1990)
    • (1990) IEEE Int. Symp. Circuits and Systems , vol.4 , pp. 2857-2860
    • Tang, H.1    Chen, W.-K.2


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