Computational geometry: an introduction
Computational geometry: an introduction
Obstacle growing in a nonpolygonal world
Information Processing Letters
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
Connection autonomy in SIMD computers: a VLSI implementation
Journal of Parallel and Distributed Computing
Image Computations on Meshes with Multiple Broadcast
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Computers
Square Meshes are Not Always Optimal
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Parallel computational geometry
Parallel computational geometry
Leftmost one computation on meshes with row broadcasting
Information Processing Letters
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
Computer Vision
Computer Architectures for Spatially Distributed Data
Computer Architectures for Spatially Distributed Data
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
Time-Optimal Proximity Algorithms on Meshes with Multiple Broadcasting
Proceedings of the 8th International Symposium on Parallel Processing
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)
Computational Aspects of VLSI
Time-Optimal Domain-Specific Querying on Enhanced Meshes
IEEE Transactions on Parallel and Distributed Systems
Podality-Based Time-Optimal Computations on Enhanced Meshes
IEEE Transactions on Parallel and Distributed Systems
Time- and VLSI-Optimal Sorting on Enhanced Meshes
IEEE Transactions on Parallel and Distributed Systems
The Mesh with Hybrid Buses: An Efficient Parallel Architecture for Digital Geometry
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 0.00 |
Recently it has been noticed that for semigroup computations and for selection rectangular meshes with multiple broadcasting yield faster algorithms than their square counterparts. The contribution of this paper is to provide yet another example of a fundamental problem for which this phenomenon occurs. Specifically, we show that the problem of computing the convex hull of a set of n sorted points in the plane can be solved in ${\rm O}(n^{{\textstyle{1 \over 8}}}\, {\rm log}^{{\textstyle{3 \over 4}}}\,n)$ time on a rectangular mesh with multiple broadcasting of size$$n^{{\textstyle{3 \over 8}}}\,{\rm log}^{{\textstyle{1 \over 4}}}\,n\times {\textstyle{{n^{{ \textstyle{5 \over 8}}}} \over {{\rm log}^{{\textstyle{1 \over 4}}}\,n}}}.$$The fastest previously-known algorithms on a square mesh of size $\sqrt n\times \sqrt n$ run in ${\rm O}(n^{{\textstyle{1 \over 6}}})$ time in case the n points are pixels in a binary image, and in ${\rm O}(n^{{\textstyle{1 \over 6}}}\,{\rm log}^{{\textstyle{2 \over 3}}}\,n).$ time for sorted points in the plane.