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
Decision estimation and classification: an introduction to pattern recognition and related topics
Decision estimation and classification: an introduction to pattern recognition and related topics
Connection autonomy in SIMD computers: a VLSI implementation
Journal of Parallel and Distributed Computing
IEEE Transactions on Computers
Journal of Parallel and Distributed Computing
Fast computer vision algorithms for reconfigurable meshes
Image and Vision Computing
Curves and surfaces for computer aided geometric design (3rd ed.): a practical guide
Curves and surfaces for computer aided geometric design (3rd ed.): a practical guide
Parallel Computations on Reconfigurable Meshes
IEEE Transactions on Computers
Sorting and computing convex hulls on processor arrays with reconfigurable bus systems
Information Sciences: an International Journal
Leftmost one computation on meshes with row broadcasting
Information Processing Letters
Reconfigurable Buses with Shift Switching: Concepts and Applications
IEEE Transactions on Parallel and Distributed Systems
Constant-time tree algorithms on reconfigurable meshes on size n × n
Journal of Parallel and Distributed Computing
Constant-time convexity problems on reconfigurable meshes
Journal of Parallel and Distributed Computing
Triangulation on reconfigurable meshes: a natural decomposition approach
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh
IEEE Transactions on Parallel and Distributed Systems
The Massively Parallel Processor
The Massively Parallel Processor
Computer-Aided Design and Manufacture
Computer-Aided Design and Manufacture
IEEE Transactions on Parallel and Distributed Systems
Time-Optimal Visibility-Related Algorithms on Meshes with Multiple Broadcasting
IEEE Transactions on Parallel and Distributed Systems
An Optimal Sorting Algorithm on Reconfigurable Mesh
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
Computer implementation of the finite element method
Computer implementation of the finite element method
Time- and VLSI-Optimal Sorting on Enhanced Meshes
IEEE Transactions on Parallel and Distributed Systems
Approximated algorithms for the minimum dilation triangulation problem
Journal of Heuristics
Hi-index | 0.00 |
A number of applications in computer-aided manufacturing, CAD, and computer-aided geometric design ask for triangulating pieces of material with defects. These tasks are known collectively as constrained triangulations. Recently, a powerful architecture called the reconfigurable mesh has been proposed: In essence, a reconfigurable mesh consists of a mesh-connected architecture augmented by a dynamically reconfigurable bus system. The main contribution of this paper is to show that the flexibility of the reconfigurable mesh can be exploited for the purpose of obtaining constant-time algorithms for a number of constrained triangulation problems. These include triangulating a convex planar region containing any constant number of convex holes, triangulating a convex planar region in the presence of a collection of rectangular holes, and triangulating a set of ordered line segments. Specifically, with a collection of O(n) such objects as input, our algorithms run in O(1) time on a reconfigurable mesh of size n脳n. To the best of our knowledge, this is the first time constant time solutions to constrained triangulations are reported on this architecture.