✦ LIBER ✦

An O(log n) time parallel algorithm for triangulating a set of points in the plane

✍ Scribed by Cao An Wang; Yung H. Tsin

Book ID: 113163018
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 439 KB
Volume: 25
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(87)90093-7

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

Erratum: An $O(n\log \log n)$-Time Algor

Erratum: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon

✍ Tarjan, Robert E.; Van Wyk, Christopher J. 📂 Article 📅 1988 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 60 KB

A parallel O(log n) algorithm for the dr

A parallel O(log n) algorithm for the drawing of algebraic curves in an n × n square

✍ R. Sommerhalder; S.C. Van Westrhenen 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 477 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

An O(n-log-log-n) Time Algorithm for Con

An O(n-log-log-n) Time Algorithm for Constructing a Graph of Maximum Connectivity with Prescribed Degrees

✍ T. Asano 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 601 KB

An O(kN.log N) algorithm for decomposing

An O(kN.log N) algorithm for decomposing a set of polygons into d-separable components

✍ Sukhamay Kundu; Radhakrishnan Sridhar 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 630 KB