140 search results - page 1 / 28 » Computing the visibility graph of points within a polygon |
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
GD
1994
Springer
14 years 2 months ago
1994
Springer
We describe a set of necessary conditions for a given graph to be the visibility graph of a simple polygon. For every graph satisfying these conditions we show that a uniform rank ...
ICCSA
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
PAAPP
1998
13 years 10 months ago
1998
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
COMGEO
2008
ACM
13 years 10 months ago
2008
ACM