๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A time-optimal parallel algorithm for three-dimensional convex hulls

โœ Scribed by N. M. Amato; F. P. Preparata

Publisher
Springer
Year
1995
Tongue
English
Weight
937 KB
Volume
14
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An optimal real time algorithm for deter
An optimal real time algorithm for determine the convex hull of a set of points in a plane
โœ Z.Q. Wang; L.J. Xiao ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 282 KB

Based on the properties of star polygon and that the convex polygon is a special kind of star polygon, with the star point as the origin and the two lines respectively parallel to the x-axis and y-axis as coordinate axis, a relative coordinate system is built and the planar area is divided into four

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