메뉴 건너뛰기




Volumn 74, Issue 5, 2012, Pages 283-289

Computing polygonal path simplification under area measures

Author keywords

Area difference; Computational geometry; Linear model simplification

Indexed keywords

ABSOLUTE ERROR; AREA DIFFERENCE; LINE SIMPLIFICATION; MODEL SIMPLIFICATION; OPTIMAL SOLUTIONS; POLYGONAL PATH; SIMPLIFICATION ALGORITHMS; TIME COMPLEXITY;

EID: 84862705972     PISSN: 15240703     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.gmod.2012.04.006     Document Type: Article
Times cited : (5)

References (19)
  • 1
    • 22344432453 scopus 로고    scopus 로고
    • Near-linear time approximation algorithms for curve simplification
    • DOI 10.1007/s00453-005-1165-y
    • P.K. Agarwal, S. Har-Peled, N.H. Mustafa, and Y. Wang Near-linear time approximation algorithms for curve simplification Algorithmica 42 2005 203 219 (Pubitemid 40997638)
    • (2005) Algorithmica (New York) , vol.42 , Issue.3-4 , pp. 203-219
    • Agarwal, P.K.1    Har-Peled, S.2    Mustafa, N.H.3    Wang, Y.4
  • 5
    • 35348815531 scopus 로고    scopus 로고
    • Optimal simplification of polygonal chain for rendering
    • DOI 10.1145/1247069.1247102, Proceedings of the Twenty-third Annual Symposium on Computational Geometry, SCG'07
    • L. Buzer, optimal simplification of polygonal chain for rendering, in: 23rd ACM Symposium on Computational Geometry (SoCG), 2007, pp. 168-174. (Pubitemid 47582059)
    • (2007) Proceedings of the Annual Symposium on Computational Geometry , pp. 168-174
    • Buzer, L.1
  • 9
    • 21844521630 scopus 로고
    • Efficient piecewise-linear function approximation using the uniform metric
    • M.T. Goodrich Efficient piecewise-linear function approximation using the uniform metric Journal of Discrete Computational Geometry 14 4 1995 45 462
    • (1995) Journal of Discrete Computational Geometry , vol.14 , Issue.4 , pp. 45-462
    • Goodrich, M.T.1
  • 14
    • 0023033490 scopus 로고
    • Optimal algorithm for approximating a piecewise linear function
    • H. Imai, and M. Iri An optimal algorithm for approximating a piecewise linear function Journal of Information Processing 9 3 1986 159 162 (Pubitemid 17572795)
    • (1986) Journal of information processing , vol.9 , Issue.3 , pp. 159-162
    • Imai Hiroshi1    Iri Masao2
  • 15
    • 85012762552 scopus 로고
    • Polygonal Approximations of a Curve-Formulations and Algorithms
    • North-Holland
    • H. Imai, M. Iri, Polygonal Approximations of a Curve-Formulations and Algorithms, Computational Morphology, North-Holland, 1988, pp. 71-86.
    • (1988) Computational Morphology , pp. 71-86
    • Imai, H.1    Iri, M.2
  • 16
    • 0348014488 scopus 로고    scopus 로고
    • The Complexity of Halfspace Area Queries
    • DOI 10.1007/s00454-003-2856-2
    • S. Langerman The complexity of halfspace area queries Discrete & Computational Geometry 30 4 2003 639 648 (Pubitemid 37528510)
    • (2003) Discrete and Computational Geometry , vol.30 , Issue.4 , pp. 639-648
    • Langerman, S.1
  • 17
    • 85023368831 scopus 로고
    • On polygonal chain approximation
    • G.T. Toussaint (Ed.) North-Holland
    • A. Melkman, J. ORourke, On polygonal chain approximation, in: G.T. Toussaint (Ed.), Computational Morphology, North-Holland, 1988, pp. 87-95.
    • (1988) Computational Morphology , pp. 87-95
    • Melkman, A.1    Orourke, J.2
  • 18
    • 0027877110 scopus 로고
    • Line generalisation by repeated elimination of points
    • M. Visvalingam, and J.D. Whyatt Line generalisation by repeated elimination of points Cartographic Journal 30 1 1993 46 51 (Pubitemid 24392949)
    • (1993) Cartographic Journal , vol.30 , Issue.1 , pp. 46-51
    • Visvalingam, M.1    Whyatt, J.D.2
  • 19
    • 0033513549 scopus 로고    scopus 로고
    • Line simplification, geometric distortion, and positional error
    • H. Veregin Line simplification, geometric distortion, and positional error Cartographica 36 1 1999 25 39 (Pubitemid 30354834)
    • (1999) Cartographica , vol.36 , Issue.1 , pp. 25-39
    • Veregin, H.1


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