𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Derandomization in Computational Geometry

✍ Scribed by Jiřı́ Matoušek

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
306 KB
Volume
20
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

✦ Synopsis

We survey techniques for replacing randomized algorithms in computational geometry by deterministic ones with a similar asymptotic running time.

📜 SIMILAR VOLUMES

Computational geometry
Computational geometry
✍ Tony C. Woo 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 191 KB
Computational geometry
Computational geometry
✍ Godfried T. Toussaint 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 264 KB
Applications of power series in computat
Applications of power series in computational geometry
✍ Yves de Montaudouin; Wayne Tiller; Havard Vold 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 827 KB

A number ofalgortthms are presented for obtaining power series expansions of curves and surfaces at a point. Some results on the radius of convergence are given. Two applications of series are given: • for curve tracing algorithms, where a truncated series ts used to approximate the curve of Inters