𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Time- and storage-efficient implementation of an optimal planar convex hull algorithm

✍ Scribed by BK Bhattacharya; GT Toussaint

Book ID
113302019
Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
609 KB
Volume
1
Category
Article
ISSN
0262-8856

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 efficient implementation of the finit
An efficient implementation of the finite-element time-domain algorithm on parallel computers using a finite-element tearing and interconnecting algorithm
✍ Umesh D. Navsariwala; Stephen D. Gedney πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 135 KB πŸ‘ 3 views

An efficient algorithm for implementing the finite-element ( ) time-domain FETD method on parallel computers is presented. An unconditionally stable implicit FETD algorithm is combined with the ( ) finite-element tearing and interconnecting FETI method. This domain decomposition algorithm con¨erges