Full metadata record
DC FieldValueLanguage
dc.contributor.authorHuang, CWen_US
dc.contributor.authorShih, TYen_US
dc.date.accessioned2014-12-08T15:02:02Z-
dc.date.available2014-12-08T15:02:02Z-
dc.date.issued1997-02-01en_US
dc.identifier.issn0098-3004en_US
dc.identifier.urihttp://hdl.handle.net/11536/749-
dc.description.abstractPoint-in-polygon is one of the fundamental operations of Geographic Information Systems. A number of algorithms can be applied. Different algorithms lead to different running efficiencies. In the study, the complexities of eight point-in-polygon algorithms were analyzed. General and specific examples are studied. In the general example, an unlimited number of nodes are assumed; whereas in the second example, eight nodes are specified. For convex polygons, the sum of area method, the sign of offset method, and the orientation method is well suited for a single point query. For possibly concave polygons, the ray intersection method and the swath method should be selected. For eight node polygons, the ray intersection method with bounding rectangles is faster. (C) 1997 Elsevier Science Ltd.en_US
dc.language.isoen_USen_US
dc.subjectpoint-in-polygonen_US
dc.subjectcomplexityen_US
dc.subjectray intersectionen_US
dc.subjectsum of angles methoden_US
dc.subjectswath methoden_US
dc.subjectsign of offset methoden_US
dc.titleOn the complexity of point-in-polygon algorithmsen_US
dc.typeArticleen_US
dc.identifier.journalCOMPUTERS & GEOSCIENCESen_US
dc.citation.volume23en_US
dc.citation.issue1en_US
dc.citation.spage109en_US
dc.citation.epage118en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.department土木工程學系zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.contributor.departmentDepartment of Civil Engineeringen_US
Appears in Collections:Articles


Files in This Item:

  1. A1997WM15100010.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.