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

An improved parallel algorithm for constructing voronoi diagram on a mesh-connected computer

โœ Scribed by Chang-Sung Jeong

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
455 KB
Volume
17
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Parallel voronoi diagram in L1 (Lโˆž) metr
Parallel voronoi diagram in L1 (Lโˆž) metric on a mesh-connected computer
โœ Chang-Sung Jeong ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 672 KB

Jeong, C.S., Parallel Voronoi diagram in L 1 (L~) metric on a mesh-connected computer, Parallel Computing 17 (1991) 241-252 In this paper, we consider the problem of constructing a Voronoi diagram in L~(L.o ) metric for a set of n points in the Cartesian plane on a mesh-connected computer. An o(vrn)

A fast general algorithm for extracting
A fast general algorithm for extracting image features on SIMD mesh-connected computers
โœ Hongchi Shi; Gerhard X. Ritter; Joseph N. Wilson ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 504 KB

Extracting features of components in an image is an important step for recognition of objects in the image. In this paper, we develop a general formula for extracting some geometric features of image components such as area, perimeter, compactness, height, width, diameter, moments, and centroid. We

A Fast Algorithm for Image Component Lab
A Fast Algorithm for Image Component Labeling with Local Operators on Mesh Connected Computers
โœ H.C. Shi; G.X. Ritter ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 562 KB

A new parallel algorithm for image component labeling with local operators on SIMD mesh connected computers is presented. This algorithm provides a positive answer to the open question of whether there exists an \(O(n)\)-time and \(O(\log n)\)-space local labeling algorithm on SIMD mesh connected co