A systolic algorithm for extracting regions from a planar graph

Computer Vision, Graphics, and Image Processing - Tập 47 - Trang 227-242 - 1989
Zen-Chung Shih1
1Department and Institute of Information Science, National Chiao Tung University, Hsinchu 30050, Taiwan, Republic of China

Tài liệu tham khảo

Baudet, 1978, Optimal sorting algorithms for parallel computers, IEEE Trans. Comput., C-27, 84, 10.1109/TC.1978.1674957 Knuth, 1972, Vol. 3 Lee, 1981, An on-chip compare/steer bubble sorter, IEEE Trans. Comput., C-30, 396, 10.1109/TC.1981.1675805 Miranker, 1983, A zero-time VLSI sorter, IBM J. Res. Develop, 27, 140, 10.1147/rd.272.0140 Nievergelt, 1982, Plane-sweep algorithms for intersecting geometric figures, Commun. ACM, 25, 739, 10.1145/358656.358681 Shamos, 1978, Computational Geometry Sugihara, 1984, An n log n algorithm for determining the congruity of polyhedra, J. Comput. System Sci., 29, 36, 10.1016/0022-0000(84)90011-4