✦ LIBER ✦

The side-lengths of Voronoi polygons for random nuclei

✍ Scribed by Guy S.M. Moore; Richard E.M. Moore

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 231 KB
Volume: 196
Category: Article
ISSN: 0378-4371
DOI: 10.1016/0378-4371(93)90077-h

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge length properties of random Voronoi

Edge length properties of random Voronoi polygons

✍ B.N. Boots 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 204 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

A New Approach for the Geodesic Voronoi

A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains

✍ E. Papadopoulou; D. T. Lee 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 561 KB

Rates of clustering in the Strassen law

Rates of clustering in the Strassen law for random polygons

✍ A. V. Bulinskii; M. A. Lifshits 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 397 KB

The mean intercept length polygons for s

The mean intercept length polygons for systems of planar nets

✍ G. M. Luo; A. M. Sadegh; S. C. Cowin 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 651 KB