登入選單

返回Google圖書搜尋

Containment problem with geometric buffers

Matej Gomboši

出版	Faculty of Electrical Engineering and Computer Science, Laboratory for geometric modelling and multimedia algorithms, 2005
URL	http://books.google.com.hk/books?id=rY7zNAAACAAJ&hl=&source=gbs_api

註釋

In geographical information systems the point-in-polygon problem is often encountered. The algorithms usually work on polygons made from straight edges, but many times this is not enough. Other forms can be found among which polygons containing circular arcs - geometric buffers are very frequent in engineering practice. This paper presents different solutions for the point-in-polygon problem on geometric buffers. Presented algorithms handIe circular arcs easy and efficiently. Three approaches are developed: the Ray-Crossing method, the Cell-Based Algorithm and the Approximate approach. Each of them is developed and suited for a different kind of application demands.