Binay K. Bhattacharya School of Computing Science, Simon Fraser University...  Home/Search
Context Related
| cgm.cs.mcgill.ca/~godfri...secvis.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: cgm.cs.mcgill.ca/~godfried/pub... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper we focus on weak external visibility of a polygon. This topic is as yet quite unexplored compared to its internal counterpart. Toussaint and Avis [TA] considered the problem of determining if a polygon is weakly externally visible. (Since we will restrict ourselves hereafter to notions of visibility that are both weak and external we will drop these adjectives for the sake of less cumbersome terminology). A polygon P is edge-visible if for each point x P there exists a ray that... (Update)
Context of citations to this paper: More
...point in the closure of A is visible from p. Detecting whether or not a polygon is weakly externally visible can be answered in O(n) time [1]. We give algorithms for explicitly constructing the locus of points from which a polygon is visible, and we analyze how this visibility...
...and van Kreveld [17] about the arrangements of fat geometric objects. Our result generalizes the case considered by Bhattacharya et al. [1], where the obstacles form a single simple polygon. In the second situation, we consider a collection of k polygonal goal regions of total...
Cited by: More
Computing Shortest Transversals - Binay Bhattacharya School (Correct)
Reaching a Goal with Directional Uncertainty - de Berg, Guibas, Halperin.. (1994) (Correct)
Visibility-Based Planning of Sensor Control Strategies - Briggs, Donald (2000) (Correct)
Active bibliography (related documents): More All
3.4: Determining Sector Visibility of a Polygon - Bhattacharya, Kirkpatrick.. (1989) (Correct)
0.6: Lower Bounds for Line Stabbing - Avis, Robert, Wenger (1997) (Correct)
0.6: Optimal Guarding of Polygons and Monotone Chains.. - Chen.. (Correct)
Similar documents based on text:
89.0: Unknown - (Correct)
Related documents from co-citation: More All
7: Fat triangles determine linearly many holes (context) - Matousek, Pach et al. - 1994
5: Art Gallery Theorems and Algorithms (context) - O'Rourke - 1987
5: Graphics in Flatland: A case study (context) - Edelsbrunner, Overmars et al. - 1983
BibTeX entry: (Update)
@inproceedings{ bhattacharya89determining,
author = "Binay K. Bhattacharya and David G. Kirkpatrick and Godfried T. Toussaint",
title = "Determining Sector Visibility of a Polygon",
booktitle = "Symposium on Computational Geometry",
pages = "247-253",
year = "1989",
url = "citeseer.ist.psu.edu/bhattacharya89determining.html" }
Citations (may not include all citations):508 Computational Geometry (context) - Preparata, Shamos - 1985
33 line construction of the convex hull of a simple polyline (context) - Melkman - 1987
30 Lower bounds for algebraic computation trees (context) - Ben-Or - 1983
29 An optimal algorithm for determining the visibility of a pol.. - Avis, Toussaint - 1981
15 Stabbing line segments (context) - Edelsbrunner, Maurer et al. - 1982
14 a convex hull algorithm for polygons and its application to .. (context) - Toussaint, Avis - 1982
14 Some properties of L-sets in the plane (context) - Horn, Valentine - 1949
13 Graphics in flatland: a case study (context) - Edelsbrunner, Overmars et al. - 1981
12 Efficient algorithms for common transversals (context) - Atallah, Bajaj - 1987
11 Polyhedral line transversals in space (context) - Avis, Wenger
10 line algorithm for fitting straight lines between data range.. (context) - O'Rourke - 1981
10 Computing shortest transversals of sets (context) - Bhattacharya, Czyzowicz et al. - 1992
10 Testing a simple polygon for monotonicity (context) - Preparata, Supowit - 1981
9 Finding transversals for sets of simple geometric figures (context) - Edelsbrunner - 1985
9 Two counter examples concerning transversals for convex subs.. (context) - Lewis - 1980
9 Computing shortest transversals - Bhattacharya, Toussaint - 1991
7 An optimal algorithm for detecting weak visibility of a poly.. (context) - Sack, Suri - 1990
7 Detecting the weak visibility of a simple polygon and relate.. (context) - Ke - 1988
7 Efficient algorithms for inserting and deleting edges from t.. (context) - ElGindy, Toussaint - 1985
5 Algorithms for line stabbers in space (context) - Avis, Wenger - 1987
4 Monotone pieces of chains (context) - Chandru, Rajan et al. - 1992
4 Separation of two monotone polygons in linear time - Toussaint, ElGindy - 1984
4 On common transversals (context) - Grunbaum - 1958
4 A linear-time algorithm for computing the shortest line segm.. (context) - Bhattacharya, Mukhopadhyay et al. - 1991
3 On illumination in the plane by line segments (context) - Bezdek, Bezdek et al. - 1992
3 Characterizations of convex and star-shaped polygons - Shermer, Toussaint - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://cgm.cs.mcgill.ca/~godfried/publications/): More
On the Sectional Area of Convex Polytopes - Avis, Bose, Shermer, Snoeyink.. (1996) (Correct)
Convexifying Polygons in 3D: a Survey - Soss, Toussaint (Correct)
A Faster Algorithm for Computing the Link Distance between .. - Colannino, Toussaint (2005) (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