✦ LIBER ✦

Scaleable Parallel Algorithms for Lower Envelopes with Applications

✍ Scribed by Laurence Boxer; Russ Miller; Andrew Rau-Chaplin

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 436 KB
Volume: 53
Category: Article
ISSN: 0743-7315
DOI: 10.1006/jpdc.1998.1478

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Incremental algorithms for finding the c

Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas

✍ Olivier Devillers; Mordecai J. Golin 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 771 KB

Parallel NC-algorithms for multifacility

Parallel NC-algorithms for multifacility location problems with mutual communication and their applications

✍ Igor Averbakh; Oded Berman 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 174 KB

Efficient parallel algorithms and softwa

Efficient parallel algorithms and software for compressed octrees with applications to hierarchical methods

✍ Bhanu Hariharan; Srinivas Aluru 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 434 KB

We describe the design and implementation of efficient parallel algorithms, and a software library for the parallel implementation of compressed octree data structures. Octrees are widely used in supporting hierarchical methods for scientific applications such as the N-body problem, molecular dynami

A parallel algorithm for finding a trico

A parallel algorithm for finding a triconnected component separator with an application

✍ Zhi-Zhong Chen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 591 KB

Efficient Parallel Nonlinear Multigrid R

Efficient Parallel Nonlinear Multigrid Relaxation Algorithms for Low-Level Vision Applications

✍ E. Memin; F. Heitz; F. Charot 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 824 KB

Multigrid techniques have been shown to significantly improve the convergence rate of the nonlinear relaxation algorithms used in computer vision for the extraction of low-level image features. It is also well known that the computations involved with relaxation algorithms are regular and local, and

Designing Lower-Dimensional Regular Arra

Designing Lower-Dimensional Regular Arrays for Algorithms with Uniform Dependencies

✍ Jong-Chuang Tsay; Pen-Yuang Chang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 360 KB

In this paper, we will propose a polynomial-time method to design m-dimensional regular arrays for n (n Ն m ؉ 1) dimensional algorithms with uniform dependencies, regular algorithms. The proposed method has two steps: the first one is to transform an independently partitioned regular algorithm to a