Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

33

ALGORITHMICA
2005

favoriteEmaildiscussreport

95views more ALGORITHMICA 2005»

Near-Linear Time Approximation Algorithms for Curve Simplification

13 years 10 months ago

Near-Linear Time Approximation Algorithms for Curve Simplification

Download biogeometry.duke.edu

Abstract. We consider the problem of approximating a polygonal curve

Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Must

Real-time Traffic

ALGORITHMICA 2005 | Error Criterion | Polygonal Curve | Simplified Polygonal Curve |

claim paper

Related Content

» Approximate congruence in nearly linear time

» NearOptimal Pricing in NearLinear Time

» A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane

» NearLinear Time Construction of Sparse Neighborhood Covers

» Fast construction of nets in low dimensional metrics and their applications

» Speeding up Simplification of Polygonal Curves using Nested Approximations

» Shape fitting with outliers

» A RealTime Algorithm for the Approximation of LevelSetBased Curve Evolution

» When crossings count approximating the minimum spanning tree

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2005
Where	ALGORITHMICA
Authors	Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang

Comments (0)