some results on computing the visibility of a query point inside polygons with holes
Publish place: 10th Annual Conference of Computer Society of Iran
Publish Year: 1383
نوع سند: مقاله کنفرانسی
زبان: English
View: 1,046
This Paper With 8 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ACCSI10_029
تاریخ نمایه سازی: 25 آذر 1390
Abstract:
in this paper we consider the problem of computing the visibility polygon of a query point inside polygons with hoes. The goal is to perform this computation efficiently per query with more cost in the preprocessing phase our algorithm is based on solutions in 10 and 11 proposed for simple polygons in our solution the preprocessing is done in time On3logn to construct a data structure of size On3.
Keywords:
Authors
alireza zarei
computer engineering department sharif university