✦ LIBER ✦

A parallel algorithm based on convexity for the computing of Delaunay tessellation

✍ Scribed by Phan Thanh An; Le Hong Trang

Publisher: Springer US
Year: 2011
Tongue: English
Weight: 310 KB
Volume: 59
Category: Article
ISSN: 1017-1398
DOI: 10.1007/s11075-011-9493-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A parallel computing application of the

A parallel computing application of the genetic algorithm for lubrication optimization

✍ Nenzi Wang 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 848 KB

Algorithms for computing the center of a

Algorithms for computing the center of area of a convex polygon

✍ Matthew Díaz; Joseph O'Rourke 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 1009 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 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

The performance of parallel matrix algor

The performance of parallel matrix algorithms on a broadcast-based architecture

✍ Constantine Katsinis; Diana Hecht; Ming Zhu; Harsha Narravula 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 304 KB

A parallel algorithm for computing eigen

A parallel algorithm for computing eigenvalues of very large real symmetric matrices on message passing architectures

✍ Susanne Balle; Jane Cullum 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 203 KB