Time-Optimal Visibility-Related Algorithms on Meshes with Multiple Broadcasting

Given a collection of objects in the plane along with a viewpoint /spl omega/, the visibility problem involves determining the portion of each object that is visible to an observer positioned at /spl omega/. 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/spl times/n. This is the first instance of time-optimal solutions for these problems on this architecture. >

[1]  John E. Howland,et al.  Computer graphics , 1990, IEEE Potentials.

[2]  Richard Cole,et al.  Cascading divide-and-conquer: A technique for designing parallel algorithms , 1989, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[3]  Fabrizio Luccio,et al.  A Visibility Problem in VLSI Layout Compaction , 1984 .

[4]  Godfried T. Toussaint,et al.  Movable Separability of Sets , 1985 .

[5]  Lynn Conway,et al.  Introduction to VLSI systems , 1978 .

[6]  Laxmi N. Bhuyan,et al.  High-performance computer architecture , 1995, Future Gener. Comput. Syst..

[7]  F. Frances Yao,et al.  Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[8]  Stephan Olariu,et al.  Optimal convex hull algorithms on enhanced meshes , 1993, BIT Comput. Sci. Sect..

[9]  Jean-Paul Laumond,et al.  Obstacle Growing in a Nonpolygonal World , 1987, Inf. Process. Lett..

[10]  James C. Miller,et al.  Computer graphics principles and practice, second edition , 1992, Comput. Graph..

[11]  Viktor K. Prasanna,et al.  Array Processor with Multiple Broadcasting , 1985, ISCA.

[12]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[13]  Stephan Olariu,et al.  A Unifying Look at Semigroup Computations on Meshes with Multiple Broadcasting , 1993, Parallel Process. Lett..

[14]  Jingyuan Zhang,et al.  Convex Polygon Problems on Meshes with Multiple Broadcasting , 1992, Parallel Process. Lett..

[15]  Stephan Olariu,et al.  Time- and VLSI-optimal Sorting on Meshes with Multiple Broadcasting , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[16]  Yung H. Tsin,et al.  An O(log n) Time Parallel Algorithm for Triangulating a Set of Points in the Plane , 1987, Inf. Process. Lett..

[17]  Rangachar Kasturi,et al.  Machine vision , 1995 .

[18]  D. Parkinson,et al.  The AMT DAP 500 , 1988, Digest of Papers. COMPCON Spring 88 Thirty-Third IEEE Computer Society International Conference.

[19]  Kang G. Shin,et al.  Implementation of Decentralized Load Sharing in Networked Workstations Using the Condor Package , 1997, J. Parallel Distributed Comput..

[20]  Kenneth E. Batcher,et al.  Design of a Massively Parallel Processor , 1980, IEEE Transactions on Computers.

[21]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[22]  Uzi Vishkin,et al.  Highly parallelizable problems , 1989, STOC '89.

[23]  Jerome Rothstein.  Bus automata, brains, and mental models , 1988, IEEE Trans. Syst. Man Cybern..

[24]  David Vernon,et al.  Machine vision - automated visual inspection and robot vision , 1991 .

[25]  Hungwen Li,et al.  Connection Autonomy in SIMD Computers: A VLSI Implementation , 1989, J. Parallel Distributed Comput..

[26]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[27]  Chak-Kuen Wong,et al.  A note on visibility graphs , 1987, Discret. Math..

[28]  Ivan Stojmenovic,et al.  Time-Optimal Nearest-Neighbor Computations on Enhanced Meshes , 1994, J. Parallel Distributed Comput..

[29]  Peter E. Hart,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[30]  Linda Pagli,et al.  A VLSI Solution to the Vertical Segment Visibility Problem , 1986, IEEE Transactions on Computers.

[31]  Dionysios I. Reisis,et al.  Image Computations on Meshes with Multiple Broadcast , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[32]  Amotz Bar-Noy,et al.  Square meshes are not always optimal , 1989, SPAA '89.

[33]  Y. Chien,et al.  Pattern classification and scene analysis , 1974 .

[34]  Stephan Olariu,et al.  A Time-Optimal Multiple Search Algorithm on Enhanced Meshes, with Applications , 1994, J. Parallel Distributed Comput..

[35]  Stephan Olariu,et al.  A Fast Selection Algorithm for Meshes with Multiple Broadcasting , 1994, IEEE Trans. Parallel Distributed Syst..

[36]  Massimo Maresca,et al.  Polymorphic-Torus Network , 1989, IEEE Trans. Computers.

[37]  Donald K. Friesen,et al.  An Optimal Parallel Algorithm for the Vertical Segment Visibility Reporting Problem , 1991, ICCI.

[38]  Harold Stuart Stone.  High-performance computer architecture (2nd ed.) , 1990 .

[39]  Stephen A. Cook,et al.  Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes , 1986, SIAM J. Comput..

[40]  Stephan Olariu,et al.  Simulating Enhanced Meshes, with Applications , 1993, Parallel Process. Lett..

[41]  Stephan Olariu,et al.  Square Meshes are not Optimal for Convex Hull Computation , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[42]  Herbert Freeman,et al.  Computer Architectures for Spatially Distributed Data , 1985, NATO ASI Series.

[43]  Shahid H. Bokhari,et al.  Finding Maximum on an Array Processor with a Global Bus , 1984, IEEE Transactions on Computers.

[44]  Ivan Stojmenovic,et al.  Time-optimal proximity algorithms on meshes with multiple broadcasting , 1994, Proceedings of 8th International Parallel Processing Symposium.

[45]  Jang-Ping Sheu,et al.  Designing Efficient Parallel Algorithms on Mech-Connected Computers with Multiple Broadcasting , 1990, IEEE Trans. Parallel Distributed Syst..