Sciweavers

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

60

Voted

COMGEO
2008
ACM

favoriteEmaildiscussreport

91views Applied Computing» more COMGEO 2008»

Query point visibility computation in polygons with holes

14 years 10 months ago

Query point visibility computation in polygons with holes

Download sharif.edu

Alireza Zarei, Mohammad Ghodsi

Real-time Traffic

Applied Computing | COMGEO 2008 |

claim paper

Related Content

» Computing the visibility graph of points within a polygon

» Watchman tours for polygons with holes

» SpaceQueryTime Tradeoff for Computing the Visibility Polygon

» Visibility Queries in Simple Polygons and Applications

» Weak Visibility of Two Objects in Planar Polygonal Scenes

» Optimal Mesh Algorithms for Proximity and Visibility Problems in Simple Polygons

» Visibility map for global illumination in point clouds

» MinimumLink Paths Among Obstacles in the Plane

» The Geodesic Diameter of Polygonal Domains

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	COMGEO
Authors	Alireza Zarei, Mohammad Ghodsi

Comments (0)