SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

International Journal of Computational Geometry and Applications

Volumn 12, Issue 3, 2002, Pages 217-228

An optimal morphing between polylines

(1) Bespamyatnikh, Sergei a

a Duke University (United States)

Author keywords

Morphing; Polylines; Shortest path; Skeleton

Indexed keywords

EID: 0036045694 PISSN: 02181959 EISSN: None Source Type: Journal
DOI: 10.1142/S0218195902000839 Document Type: Article

Times cited : (16)

References (12)

1
- 0031534208
- Matching shapes with a reference point
- (1997) Internat. J. Comput. Geom. Appl. , vol.7 , pp. 349-363
- Aichholzer, O.¹ Alt, H.² Rote, G.³

2
- 0003140383
- Computing the Fréchet distance between two polygonal curves
- (1995) Internat. J. Comput. Geom. Appl. , vol.5 , pp. 75-91
- Alt, H.¹ Godau, M.²

3
- 0002404105
- Discrete geometric shapes: Matching, interpolation, and approximation
- eds. J.-R. Sack and J. Urrutia, chapter 3 (Elsevier)
- (2000) Handbook of Computational Geometry , pp. 121-153
- Alt, H.¹ Guibas, L.J.²

4
- 0001042483
- Congruence, similarity and symmetries of geometric objects
- (1998) Discrete Comput. Geom. , vol.3 , pp. 237-256
- Alt, H.¹ Mehlhorn, K.² Wagener, H.³ Welzl, E.⁴

5
- 84957054206
- Matching polygonal curves with respect to the Fréchet distance
- (2001) Proc. 18th Internat. Symp. on Theoretical Aspects of Computer Science , pp. 63-74
- Alt, H.¹ Knauer, C.² Wenk, C.³

6
- 0002837355
- Sweeping simple polygons with a chain of guards
- (2000) Proc. 11th ACM-SIAM Sympos. Discrete Algorithms , pp. 927-936
- Efrat, A.¹ Guibas, L.J.² Har-Peled, S.³ Lin, D.C.⁴ Mitchell, J.S.B.⁵ Murali, T.M.⁶

7
- 0005507893
- Morphing between polylines
- (2001) Proc. 12th ACM-SIAM Sympos. Discrete Algorithms , pp. 680-689
- Efrat, A.¹ Guibas, L.J.² Har-Peled, S.³ Murali, T.M.⁴

8
- 0034394646
- Morphing simple polygons
- (2000) Discrete Comput. Geom. , vol.24 , pp. 1-34
- Guibas, L.¹ Hershberger, J.² Suri, S.³

9
- 0023247608
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- (1987) Algorithmica , vol.2 , pp. 209-233
- Guibas, L.J.¹ Hershberger, J.² Leven, D.³ Sharir, M.⁴ Tarjan, R.E.⁵

10
- 0000855328
- Computing minimum length paths of a given homotopy class
- (1994) Comput. Geom. Theory Appl. , vol.4 , pp. 63-98
- Hershberger, J.¹ Snoeyink, J.²

11
- 84948792379
- Multiresolution mesh morphing
- (1999) Proc. 26th Int. Conf. on Computer Graphics and Interactive Techniques , pp. 343-350
- Lee, A.W.F.¹ Dobkin, D.² Sweldens, W.³ Schröder, P.⁴

12
- 0005422079
- Ph. D. thesis, Stanford University
- (1999) Geometric Shape Matching and Drug Design
- Venkatasubramanian, S.¹

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