✦ LIBER ✦

Voronoi diagrams of random lines and flats

✍ Scribed by R. A. Dwyer

Book ID: 110678492
Publisher: Springer
Year: 1997
Tongue: English
Weight: 609 KB
Volume: 17
Category: Article
ISSN: 0179-5376
DOI: 10.1007/bf02770869

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Voronoi Diagram of Three Lines

✍ Hazel Everett; Daniel Lazard; Sylvain Lazard; Mohab Safey El Din 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 774 KB

Voronoi Diagrams and Convex Hulls of Ran

Voronoi Diagrams and Convex Hulls of Random Moving Points

✍ R. A. Dwyer 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 146 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

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

Voronoi Diagrams and Spring Rain

✍ Arnold E. Perham, C.S.V. and Faustine L. Perham 📂 Article 📅 2011 🏛 National Council of Teachers of Mathematics ⚖ 740 KB

Voronoi Diagrams of Lines in 3-Space Und

Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions

✍ L.Paul Chew; Klara Kedem; Micha Sharir; Boaz Tagansky; Emo Welzl 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 261 KB

The combinatorial complexity of the Voronoi diagram of n lines in three dimensions under a convex distance function induced by a polytope with a constant Ž 2 Ž . . Ž . number of edges is shown to be O n ␣ n log n , where ␣ n is a slowly growing inverse of the Ackermann function. There are arrangemen