Back to Results
First PageMeta Content
Euclidean geometry / Euclidean plane geometry / Simple polygon / Connectivity / Shortest path problem / Tree / Computational geometry / Polyhedra / Art gallery problem / Geometry / Mathematics / Polygons


CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Efficient Visibility Maintenance of a Moving Segment Observer inside a Simple Polygon Amir Ali Khosravi∗†
Add to Reading List

Document Date: 2008-10-28 21:27:01

Open Document

File Size: 151,32 KB

Share Result on Facebook

City

Ottawa / /

Company

Vertex / /

Country

Japan / /

/

Facility

Sharif University of Technology / /

Organization

Computer Engineering Department / IPM School of Computer Science / Sharif University of Technology / Iran Telecommunication Research Center / /

Person

D. Avis A Linear / st. Then / D. Lee Visibility / Mohammad Ghodsi / Amir Ali Khosravi∗† Alireza / /

Position

SVP / VP / observer / /

ProvinceOrState

Ontario / /

Technology

Visibility Graph Algorithm / J. Algorithms / Linear Algorithm / Image Processing / /

SocialTag