<<A>> cell-based point-in-polygon algorithm suitable for large sets of points

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F01%3A00065192" target="_blank" >RIV/49777513:23520/01:00065192 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

<<A>> cell-based point-in-polygon algorithm suitable for large sets of points

Original language description

The paper describes a new algorithm for solving the point-in-polygon problem. It is especially suitable when it is necessary to check whether many points are placed inside or outside a polygon. The algorithm works with O/n/ space complexity. The paper also gives practical results using artificial and real polygons from a GIS environment.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2001

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Computers & Geosciences

ISSN

00983004

e-ISSN

—

Volume of the periodical

Neuveden

Issue of the periodical within the volume

Č. 27

Country of publishing house

US - UNITED STATES

Number of pages

11

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—