Radu Litiu, Dionysios I. Kountanis  Home/Search
Context
Related
| umich.edu/~radu/private/....ITI98.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umich.edu/~radu/private/resume (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we present a sequential algorithm that computes the part of a set of parallel line segments visible in a direction. The algorithm performs in O(n log n) time and O(n) time with preprocessing-sorting, where n is the number of line segments. The worst possible configuration of the line segments is determined to be a staircase arrangement with a garbage collection segment. (Update)
Active bibliography (related documents): More All
0.5: Special Purpose Parallel Computing - McColl (1993) (Correct)
0.3: Optimal Mesh Computer Algorithms for Simple Polygons - Guha (Correct)
0.3: Optimal Mesh Algorithms for the Voronoi Diagram of Line.. - Rajasekaran, Ramaswami (Correct)
Similar documents based on text: More All
1.0: Closest Pair for Two Separated Sets of Points - Litiu, Kountanis (1997) (Correct)
0.3: Doing the Right Thing in Systems Programming Education -.. - Piatkowski (2000) (Correct)
0.3: Parallel Implementations of Evolutionary Strategies - Greenwood, Ahire, Gupta.. (1995) (Correct)
BibTeX entry: (Update)
@misc{ litiu-visibility,
author = "Radu Litiu and Dionysios I. Kountanis",
title = "Visibility Line in a Direction for a Set of Parallel Line Segments",
url = "citeseer.ist.psu.edu/500891.html" }
Citations (may not include all citations):1254 Computational Geometry an Introduction (context) - Preparata, Shamos - 1985
62 Introduction to Algorithms, a Creative Approach (context) - Manber - 1989
53 Parallel Computational Geometry (context) - Akl, Lyons - 1993
33 Pattern Recognition and Geometrical Complexity (context) - Toussaint - 1980
19 A Linear Algorithm for Computing the Visibility Polygon from.. (context) - ElGindy, Aris - 1981
7 Computational Geometry (context) - Mulmuley - 1994
3 Solving Visibility and Separability Problems in a Mesh-of-Pr.. (context) - Dehne - 1988
2 Systolic Algorithms for Computing the Visibility Polygon and.. (context) - Asano, Umeo - 1988
1 A Balanced Approach to the Rectilinear Steiner Tree Problem (context) - Kountanis, Kokkinos - 1995
Documents on the same site (http://www.eecs.umich.edu/~radu/private/resume.html): More
Adaptive Group Communication Services for Groupware Systems - Litiu, Prakash (1998) (Correct)
Stateful Multicast Services for Supporting Collaborative .. - Shim, Hall, Litiu.. (1997) (Correct)
Closest Pair for Two Separated Sets of Points - Litiu, Kountanis (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC