✦ LIBER ✦

Improved algorithms for the farthest colored Voronoi diagram of segments

✍ Scribed by Zhu, Yongding; Xu, Jinhui

Book ID: 123213665
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 357 KB
Volume: 497
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.06.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tight bound and improved algorithm for f

Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments

✍ Bae, Sang Won 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 297 KB

Optimal Parallel Randomized Algorithms f

Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane

✍ Rajasekaran; Ramaswami 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 214 KB

A Randomized Algorithm for the Voronoi D

A Randomized Algorithm for the Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors

✍ Xiaotie Deng, ; Binhai Zhu, 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 122 KB

A linear-time algorithm for computing th

A linear-time algorithm for computing the voronoi diagram of a convex polygon

✍ Alok Aggarwal; Leonidas J. Guibas; James Saxe; Peter W. Shor 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 906 KB

A nearly optimal parallel algorithm for

A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon

✍ Piotr Berman; Andrzej Lingas 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 756 KB

We present a parallel algorithm for the Voronoi diagram of the set of vertices of a convex polygon. The algorithm runs in time O(logn) and uses O(n loglogn/log n) processors in the CRCW PRAM model. The concurrent write is used only by an integer sorting subroutine. We also obtain an O(log n)-time an

The method of maximum constriction — An

The method of maximum constriction — An improved algorithm for the computer generation of potential-pH diagrams

✍ P.B. Linkson; B.D. Phillips; C.D. Rowles 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 384 KB