By Topic

Time-optimal visibility-related algorithms of meshes with multiple broadcasting

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

7 Author(s)
Bhagavathi, D. ; Dept. of Comput. Sci., Old Dominion Univ., Norfolk, VA, USA ; Bokka, V. ; Gurla, H. ; Olariu, S.
more authors

Given a sequence of objects in the plane along with a viewpoint O, the visibility problem involves determining the portion of each object that is visible to an observer positioned at O. The main contribution of this work is to provide time-optimal solutions to this problem for two classes of objects, namely disks and iso-oriented rectangles in the plane. This problem is of importance in various fields like computer graphics, VLSI design, and robot navigation. Additionally, the visibility algorithm provides the basis for a time-optimal algorithm to triangulate a set of points in the plane. Specifically, all algorithms presented involve an input of size n and run in O(log n) time on a mesh with multiple broadcasting of site n×n. This is the first instance of time-optimal solutions for these problems on this architecture

Published in:

Parallel Processing Symposium, 1994. Proceedings., Eighth International

Date of Conference:

26-29 Apr 1994