메뉴 건너뛰기




Volumn 2980, Issue , 2004, Pages 128-141

Ensuring the drawability of extended euler diagrams for up to 8 sets

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; GRAPH THEORY; MAPPING; PROBLEM SOLVING; QUERY LANGUAGES; SEMANTICS; STUDENTS; VISUALIZATION; QUERY PROCESSING;

EID: 9444219648     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-25931-2_13     Document Type: Conference Paper
Times cited : (56)

References (12)
  • 5
    • 84893113459 scopus 로고    scopus 로고
    • Generating Euler diagrams
    • Callaway Gardens, Georgia, USA, April
    • J. Flower and J. Howse. Generating Euler diagrams. In Diagrams 2002, pages 61-75, Callaway Gardens, Georgia, USA, April 2002.
    • (2002) Diagrams 2002 , pp. 61-75
    • Flower, J.1    Howse, J.2
  • 6
    • 0032691349 scopus 로고    scopus 로고
    • Formalizing spider diagrams
    • Tokyo, September. IEEE Computer Society Press
    • J. Gil, S. Kent, and J. Howse. Formalizing spider diagrams. In IEEE Symposium on Visual Languages, pages 130-137, Tokyo, September 1999. IEEE Computer Society Press.
    • (1999) IEEE Symposium on Visual Languages , pp. 130-137
    • Gil, J.1    Kent, S.2    Howse, J.3
  • 7
    • 84986517167 scopus 로고
    • Hypergraph planarity and the complexity of drawing Venn diagrams
    • D.S. Johnson and H. O. Pollak. Hypergraph planarity and the complexity of drawing Venn diagrams. Journal of Graph Theory, 11(3):309-325, 1987.
    • (1987) Journal of Graph Theory , vol.11 , Issue.3 , pp. 309-325
    • Johnson, D.S.1    Pollak, H.O.2
  • 8
    • 0000157130 scopus 로고
    • Sur le probleme des courbes gauches en topologie
    • K. Kuratowski. Sur le probleme des courbes gauches en topologie. Fundamenta Mathematicae, 15:271-283, 1930.
    • (1930) Fundamenta Mathematicae , vol.15 , pp. 271-283
    • Kuratowski, K.1
  • 12
    • 9444225188 scopus 로고    scopus 로고
    • Ensuring the drawability of extended Euler diagrams for up to 8 sets
    • INRIA, October
    • A. Verroust and M-L. Viaud. Ensuring the drawability of extended Euler diagrams for up to 8 sets. Technical Report RR-4973, INRIA, October 2003.
    • (2003) Technical Report , vol.RR-4973
    • Verroust, A.1    Viaud, M.-L.2


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