Computational geometry: an introduction
Computational geometry: an introduction
Upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
A VLSI Solution to the Vertical Segment Visibility Problem
IEEE Transactions on Computers
Obstacle growing in a nonpolygonal world
Information Processing Letters
An O(log n) time parallel algorithm for triangulating a set of points in the plane
Information Processing Letters
Array processor with multiple broadcasting
Journal of Parallel and Distributed Computing
Discrete Mathematics
Connection autonomy in SIMD computers: a VLSI implementation
Journal of Parallel and Distributed Computing
Cascading divide-and-conquer: a technique for designing parallel algorithms
SIAM Journal on Computing
Image Computations on Meshes with Multiple Broadcast
IEEE Transactions on Pattern Analysis and Machine Intelligence
Highly parallelizable problems
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
IEEE Transactions on Computers
Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
High-performance computer architecture (2nd ed.)
High-performance computer architecture (2nd ed.)
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
An introduction to parallel algorithms
An introduction to parallel algorithms
A time-optimal multiple search algorithm on enhanced meshes, with applications
Journal of Parallel and Distributed Computing
Introduction to VLSI Systems
Designing Efficient Parallel Algorithms on Mech-Connected Computers with Multiple Broadcasting
IEEE Transactions on Parallel and Distributed Systems
A Fast Selection Algorithm for Meshes with Multiple Broadcasting
IEEE Transactions on Parallel and Distributed Systems
An Optimal Parallel Algorithm for the Vertical Segment Visibility Reporting Problem
ICCI '91 Proceedings of the International Conference on Computing and Information: Advances in Computing and Information
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-Optimal Nearest-Neighbor Computations on Enhanced Meshes
PARLE '94 Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe
Time-Optimal Domain-Specific Querying on Enhanced Meshes
IEEE Transactions on Parallel and Distributed Systems
Efficient Parallel Manipulations of IBB Coded Imageson Meshes with Multiple Broadcasting
Journal of Mathematical Imaging and Vision
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
Constant-Time Algorithms for Constrained Triangulations on Reconfigurable 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
Square Meshes Are Not Optimal for Convex Hull Computation
IEEE Transactions on Parallel and Distributed Systems
Some results on the computation of Voronoi diagrams on a mesh with multiple broadcasting
Journal of Parallel and Distributed Computing
The spin-wave nanoscale reconfigurable mesh and the labeling problem
ACM Journal on Emerging Technologies in Computing Systems (JETC)
| Hi-index | 0.00 |
Given a collection of objects in the plane along with a viewpoint 驴, the visibility problem involves determining the portion of each object that is visible to an observer positioned at 驴. The visibility problem is central to various application areas including computer graphics, image processing, VLSI design, and robot navigation, among many others. The main contribution of this work is to provide time-optimal solutions to this problem for several classes of objects, namely ordered line segments, disks, and iso-oriented rectangles in the plane. In addition, our visibility algorithm for line segments is at the heart of time-optimal solutions for determining, for each element in a given sequence of real numbers, the position of the nearest larger element within that sequence, triangulating a set of points in the plane, determining the visibility pairs among a set of vertical line segments, and constructing the dominance and visibility graphs of a set of iso-oriented rectangles in the plane. All the algorithms in this paper involve an input of size n and run in O(log n) time on a mesh with multiple broadcasting of size n脳n. This is the first instance of time-optimal solutions for these problems on this architecture.