Technical Section: The multi-L-REP decomposition and its application to a point-in-polygon inclusion test

Authors:
Francisco Martínez;Antonio J. Rueda;Francisco R. Feito
Affiliations:
Departamento de Informática, Universidad de Jaén, Campus Las Lagunillas s/n, 23071 Jaén, Spain;Departamento de Informática, Universidad de Jaén, Campus Las Lagunillas s/n, 23071 Jaén, Spain;Departamento de Informática, Universidad de Jaén, Campus Las Lagunillas s/n, 23071 Jaén, Spain
Venue:
Computers and Graphics
Year:
2006

Citing 5
Cited 1

Computational geometry: an introduction

Computational geometry: an introduction
Point in polygon strategies

Graphics gems IV
Computational geometry in C

Computational geometry in C
Technical section: 2D point-in-polygon test by classifying edges into layers

Computers and Graphics
Technical section: A new algorithm for Boolean operations on general polygons

Computers and Graphics

A new hierarchical triangle-based point-in-polygon data structure

Computers & Geosciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a scheme for decomposing polygons called multi-L-REP. The scheme can be considered as a generalization of the L-REP decomposition, which associates the edges of a polygon with a set of layered triangles. In the multi-L-REP these layered triangles are grouped into regions of a plane division. The paper also shows some alternative algorithms for its construction, and one of its applications: the point-in polygon inclusion test. Finally, a special case of multi-L-REP that has several interesting properties and shows a very fast point-in-polygon inclusion test is presented.