Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

ISAAC
1998
Springer

favoriteEmaildiscussreport

81views Algorithms» more ISAAC 1998»

Visibility Queries in Simple Polygons and Applications

14 years 3 months ago

Visibility Queries in Simple Polygons and Applications

Download research.microsoft.com

Abstract. In this paper we explore some novel aspects of visibility for stationary and moving points inside a simple polygon

Boris Aronov, Leonidas J. Guibas, Marek Teichmann,

Real-time Traffic

Algorithms | ISAAC 1998 | Kinetic Algorithms | Visibility Polygon | Weak Visibility |

claim paper

Related Content

» Visibility Queries and Maintenance in Simple Polygons

» The visibility skeleton a powerful and efficient multipurpose global visibility tool

» A LinearTime Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon

» The VisibilityVoronoi Complex and Its Applications

» Parabola Separation Queries and their Application to Stone Throwing

» Animating a Camera for Viewing a Planar Polygon

» Directional Discretized Occluders for Accelerated Occlusion Culling

» Visibility Sorting and Compositing Without Splitting for Image Layer Decompositions

» Static and kinetic geometric spanners with applications

Post Info
More Details (n/a)

Added	06 Aug 2010
Updated	06 Aug 2010
Type	Conference
Year	1998
Where	ISAAC
Authors	Boris Aronov, Leonidas J. Guibas, Marek Teichmann, Li Zhang

Comments (0)