Optimal simplification of polygonal chains for subpixel-accurate rendering-Reference-Cited by-同舟云学术

Optimal simplification of polygonal chains for subpixel-accurate rendering

Published:2009-01 Issue:1 Volume:42 Page:45-59
ISSN:0925-7721
Container-title:Computational Geometry
language:en
Short-container-title:Computational Geometry

Author:

Buzer Lilian

Publisher

Elsevier BV

Subject

Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications

Reference30 articles.

1. Efficient algorithms for approximating polygonal chains;Agarwal;Discrete Comput. Geom.,2000

2. M. de Berg, M. van Kreveld, S. Schirra, A new approach to subdivision simplification, in: Proc. Twelfth International Symposium on Computer-Assisted Cartography, 1995, pp. 79–88

3. G.S. Brodal, R. Jacob, Dynamic planar convex hull, in: Proc. 43rd Annual Symp. on Foundations of Computer Science, 2002, pp. 617–626

4. L. Buzer, Digital line recognition, convex hull, thickness, a unified and logarithmic technique, in: Proc. IWCIA, 2006, pp. 189–198

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

1. On the Farey sequence and its augmentation for applications to image analysis;International Journal of Applied Mathematics and Computer Science;2017-09-01

2. Computing homotopic line simplification;Computational Geometry;2014-08

3. Feathered Tiles with Uniform Payload Size for Progressive Transmission of Vector Data;Web and Wireless Geographical Information Systems;2014

4. A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fréchet Distance;Discrete Geometry for Computer Imagery;2011

5. Taximeter verification with GPS and soft computing techniques;Soft Computing;2009-03-10