𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An optimal parallel algorithm for triangulating a set of points in the plane

✍ Scribed by Ed Merks

Publisher
Springer
Year
1986
Tongue
English
Weight
510 KB
Volume
15
Category
Article
ISSN
1573-7640

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

An optimal parallel perceptron learning
An optimal parallel perceptron learning algorithm for a large training set
✍ Tzung-Pei Hong; Shian-Shyong Tseng πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 211 KB

In [2], a parallel perceptron learning algorithm on the single-channel broadcast communication model was proposed to speed up the learning of weights of perceptrons [3]. The results in [2] showed that given n training examples, the average speedup is 1.48\*n~ n by n processors. Here, we explain how