Computational geometry: an introduction
Computational geometry: an introduction
Array processor with multiple broadcasting
Journal of Parallel and Distributed Computing
Efficient Parallel Convex Hull Algorithms
IEEE Transactions on Computers
Mesh Computer Algorithms for Computational Geometry
IEEE Transactions on Computers
An image algorithm for computing the Hausdorff distance efficiently in linear time
Information Processing Letters
Image Computations on Meshes with Multiple Broadcast
IEEE Transactions on Pattern Analysis and Machine Intelligence
Parallel algorithms for generating the raster representation of straight lines and circles
Journal of Parallel and Distributed Computing
Square Meshes are Not Always Optimal
IEEE Transactions on Computers
Machine vision: automated visual inspection and robot vision
Machine vision: automated visual inspection and robot vision
Computer vision, models and inspection
Computer vision, models and inspection
Journal of Parallel and Distributed Computing
VLSI circuits and systems in silicon
VLSI circuits and systems in silicon
Parallel computational geometry
Parallel computational geometry
A time-optimal multiple search algorithm on enhanced meshes, with applications
Journal of Parallel and Distributed Computing
Convexity problems on meshes with multiple broadcasting
Journal of Parallel and Distributed Computing
Time-optimal nearest-neighbor computations on enhanced meshes
Journal of Parallel and Distributed Computing
Time-Optimal Domain-Specific Querying on Enhanced Meshes
IEEE Transactions on Parallel and Distributed Systems
Parallel computation: models and methods
Parallel computation: models and methods
Computating the width of a set
SCG '85 Proceedings of the first annual symposium on Computational geometry
A linear algorithm for incremental digital display of circular arcs
Communications of the ACM
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Digital Picture Processing
Computer Vision
Designing Efficient Parallel Algorithms on Mech-Connected Computers with Multiple Broadcasting
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A Fast Selection Algorithm for Meshes with Multiple Broadcasting
IEEE Transactions on Parallel and Distributed Systems
Time-Optimal Visibility-Related Algorithms on Meshes with Multiple Broadcasting
IEEE Transactions on Parallel and Distributed Systems
Square Meshes Are Not Optimal for Convex Hull Computation
IEEE Transactions on Parallel and Distributed Systems
A Unifying Look at Semigroup Computations on Meshes with Multiple Broadcasting
PARLE '93 Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe
Time- and VLSI-optimal convex hull computation on meshes with multiple broadcasting
FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
Computational Aspects of VLSI
Time- and VLSI-Optimal Sorting on Enhanced Meshes
IEEE Transactions on Parallel and Distributed Systems
Timing for Associative Operations on the MASC Model
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Lower Bounds on the Loading of Multiple Bus Networks for Binary Tree Algorithms
IEEE Transactions on Computers
Hi-index | 0.00 |
The first main contribution of this work is to propose an efficient VLSI architecture obtained by augmenting the Mesh with Multiple Broadcasting (MMB) with precharged 1-bit row and column buses. The new architecture, which we call Mesh with Hybrid Buses (MHB for short), is realizable in VLSI with no increase in the area or the wiring complexity of the MMB chip. Our second main contribution is to show that the MHB is extremely well-suited for solving an entire slew of digital geometry tasks. The MHB is not a reconfigurable architecture. Yet, quite remarkably, for a large number of fundamental digital geometry tasks, the MHB offers a level of performance previously attained only by reconfigurable architectures. Specifically, with a digital image pretiled onto a MHB of size $\sqrt n \times \sqrt n$ one pixel per processor, we show that the problems of computing the convex hull of the image, computing the diameter and the width of the image, deciding whether a set of digital points is a digital line, computing the maximum distance between two images, deciding whether two images are linearly separable, computing several moments and low-level descriptors of the image, including the perimeter, area, center, and median row of its convex hull, can be solved in $O(\log n)$ time. By contrast, the fastest possible algorithms for the problems above on the MMB run in $\Theta(n^{1/6})$ time. Finally, we go on to show that, with minor changes, our algorithms can be implemented to run within cost-optimality on a MHB of size ${\frac{\sqrt n}{\log n}} \times {\frac{\sqrt n}{\log n}}$.