✦ LIBER ✦

An optimal speed-up parallel algorithm for triangulating simplicial point sets in space

✍ Scribed by Hossam ElGindy

Publisher: Springer
Year: 1986
Tongue: English
Weight: 394 KB
Volume: 15
Category: Article
ISSN: 1573-7640
DOI: 10.1007/bf01414463

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal parallel algorithm for triang

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

✍ Ed Merks 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 510 KB

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