메뉴 건너뛰기




Volumn 22, Issue 1, 1997, Pages 142-157

Constructing Piecewise Linear Homeomorphisms of Simple Polygons

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0013002589     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1995.0808     Document Type: Article
Times cited : (24)

References (11)
  • 2
    • 51249179364 scopus 로고
    • Triangulating a simple polygon in linear time
    • B. Chazelle, Triangulating a simple polygon in linear time, Discrete Comput. Geom. 6 (1991), 485-524.
    • (1991) Discrete Comput. Geom. , vol.6 , pp. 485-524
    • Chazelle, B.1
  • 3
    • 0023247608 scopus 로고
    • Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
    • L. J. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. E. Tarjan, Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica 2 (1987), 209-233.
    • (1987) Algorithmica , vol.2 , pp. 209-233
    • Guibas, L.J.1    Hershberger, J.2    Leven, D.3    Sharir, M.4    Tarjan, R.E.5
  • 8
    • 0029273668 scopus 로고
    • Shape blending using the star-skeleton representation
    • M. Shapira and A. Rappoport, Shape blending using the star-skeleton representation, IEEE Comput. Graph. Appl. (1995), 44-50.
    • (1995) IEEE Comput. Graph. Appl. , pp. 44-50
    • Shapira, M.1    Rappoport, A.2
  • 10
    • 0022097228 scopus 로고
    • A linear time algorithm for minimum link paths inside a simple polygon
    • S. Suri, A linear time algorithm for minimum link paths inside a simple polygon, Comput. Vision Graph. Image Process. 35 (1986), 99-110.
    • (1986) Comput. Vision Graph. Image Process. , vol.35 , pp. 99-110
    • Suri, S.1


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