✦ LIBER ✦

Near-Linear Time Approximation Algorithms for Curve Simplification

✍ Scribed by Pankaj K. Agarwal; Sariel Har-Peled; Nabil H. Mustafa; Yusu Wang

Publisher: Springer
Year: 2005
Tongue: English
Weight: 404 KB
Volume: 42
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-005-1165-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear Time Algorithm for Approximating

Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve

✍ Jinhee Chun; Kunihiko Sadakane; Takeshi Tokuyama 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 252 KB

Near-Linear Approximation Algorithms for

Near-Linear Approximation Algorithms for Geometric Hitting Sets

✍ Pankaj K. Agarwal; Esther Ezra; Micha Sharir 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 837 KB

Linear time algorithms for convex and mo

Linear time algorithms for convex and monotone approximation

✍ Vasant A. Ubhaya 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 833 KB

Algorithms for Trigonometric Curves (Sim

Algorithms for Trigonometric Curves (Simplification, Implicitization, Parameterization)

✍ Hoon Hong; Josef Schicho 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 556 KB

A trigonometric curve is a real plane curve where each coordinate is given parametrically by a truncated Fourier series. The trigonometric curves frequently arise in various areas of mathematics, physics, and engineering. Some trigonometric curves can also be represented implicitly by bivariate poly

A linear time approximation algorithm fo

A linear time approximation algorithm for multiprocessor scheduling

✍ Greg Finn; Ellis Horowitz 📂 Article 📅 1979 🏛 Springer Netherlands 🌐 English ⚖ 540 KB

Linear time algorithms for linear progra

Linear time algorithms for linear programming

✍ E.A. Galperin 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 557 KB