메뉴 건너뛰기




Volumn 1999-January, Issue , 1999, Pages 5-8

Symmetry detection for automatic analog-layout recycling

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN;

EID: 0037992086     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASPDAC.1999.759663     Document Type: Conference Paper
Times cited : (7)

References (11)
  • 1
    • 0040346764 scopus 로고
    • Computational geometry algorithms
    • T. Ohtsuki ed.), Elsvier Science Pub.
    • T. Asano, M. Sato and T. Ohtsuki, " Computational geometry algorithms", in Layout Design and Verification (T. Ohtsuki ed.), Elsvier Science Pub., pp. 295-347, 1986.
    • (1986) Layout Design and Verification , pp. 295-347
    • Asano, T.1    Sato, M.2    Ohtsuki, T.3
  • 3
    • 0005256455 scopus 로고
    • Finding the connected components and a maximum clique of an intersecting graph of rectangles in the plane
    • H. Imai and T. Asano, "Finding the connected components and a maximum clique of an intersecting graph of rectangles in the plane," Journal of Algorithms, vol. 4, pp. 310-323, 1983.
    • (1983) Journal of Algorithms , vol.4 , pp. 310-323
    • Imai, H.1    Asano, T.2
  • 5
    • 0022060134 scopus 로고
    • Priority search trees
    • May
    • M. Mc Creight, "Priority search trees," SIAM Journal on Computing, vol. 14, no.2, pp. 257-276, May 1985.
    • (1985) SIAM Journal on Computing , vol.14 , Issue.2 , pp. 257-276
    • Mc Creight, M.1
  • 11
    • 0016495233 scopus 로고
    • Efficient of a good but not linear set union algorithm
    • R. E. Tarjan "Efficient of a good but not linear set union algorithm," Journal of ACM, 22, pp. 215-225, 1975.
    • (1975) Journal of ACM , vol.22 , pp. 215-225
    • Tarjan, R.E.1


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