A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fréchet Distance-Reference-Cited by-同舟云学术

A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fréchet Distance

Published:2011 Issue: Volume: Page:333-345
ISSN:0302-9743
Container-title:Discrete Geometry for Computer Imagery
language:
Short-container-title:

Author:

Sivignon Isabelle

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-19867-0_28

Reference11 articles.

1. Abam, M.A., de Berg, M., Hachenberger, P., Zarei, A.: Streaming algorithms for line simplification. In: SoCG 2007, pp. 175–183. ACM, New York (2007)

2. Agarwal, P.K., Har-Peled, S., Mustafa, N.H., Wang, Y.: Near-linear time approximation algorithms for curve simplification. Algorithmica 42(3-4), 203–219 (2005)

3. Alt, H., Godau, M.: Computing the Fréchet distance between two polygonal curves. International Journal of Computational Geometry 5(1), 75–91 (1995)

4. Buzer, L.: Optimal simplification of polygonal chains for subpixel-accurate rendering. Comput. Geom. Theory Appl. 42(1), 45–59 (2009)

5. Lecture Notes in Computer Science;W.S. Chan,1992

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Geometric Preservation of 2D Digital Objects Under Rigid Motions;Journal of Mathematical Imaging and Vision;2018-09-01

2. Greyscale Image Vectorization from Geometric Digital Contour Representations;Discrete Geometry for Computer Imagery;2017

3. A Near-Linear Time Guaranteed Algorithm for Digital Curve;Image Processing On Line;2014-05-22

4. A combined multi-scale/irregular algorithm for the vectorization of noisy digital contours;Computer Vision and Image Understanding;2013-04