Inside-polygon algorithm for curvilinear contours. Design and lmplementation

This paper describes an algorithm to determine whether a point is inside or outside a curvilinear polygon, based on the well known algorithm consisting of counting the intersections of an horizontal ray with the polygon. Curvilinear polygons. as analytic resources. are not common in computer graphi...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Cacciola Carballal, Fernando Luis
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 1999
Materias:
Ciencias Informáticas
Inside-polygon
curvilinear contours
Visual
COMPUTER GRAPHICS
Algorithms
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/22275
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-22275
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Inside-polygon
curvilinear contours
Visual
COMPUTER GRAPHICS
Algorithms
spellingShingle Ciencias Informáticas
Inside-polygon
curvilinear contours
Visual
COMPUTER GRAPHICS
Algorithms
Cacciola Carballal, Fernando Luis
Inside-polygon algorithm for curvilinear contours. Design and lmplementation
topic_facet Ciencias Informáticas
Inside-polygon
curvilinear contours
Visual
COMPUTER GRAPHICS
Algorithms
description This paper describes an algorithm to determine whether a point is inside or outside a curvilinear polygon, based on the well known algorithm consisting of counting the intersections of an horizontal ray with the polygon. Curvilinear polygons. as analytic resources. are not common in computer graphics, but they do arise on sorne domains. Normally, parametric curves, such as cubic splines or beziers, are used to model curves in graphic applications. But parametric curves cannot be easily manipulated in analytic computations. For example, obtaining a curve parallel to another is not a simple task, and is not even possible under all circumstances. For this reason, sorne computational geometry applications use non-parametric polyline curves, formed by straight-Iine segments and circular arcs. The straightforward geometry of lines and circumferences makes it easy to develop complex algorithms to work with nonparametric curves. But despite the fact that this curves are easy to treat analytically, they lack the parametric benefits of c1assical curves; and for this reason, it is very hard to find in the literature any work about them. If we are to represent curvilinear polygons using patches of straight-line segments and circular arcs, named polyline curvilinear polygons, one ofthe fundamental óperations that we need to implement is the point-in-polygon test. Haven't been able to find any such algorithm. the author adapted the c1assical method used with straight-Iine polygons, and extended it for use with polyline curves.
format Objeto de conferencia
Objeto de conferencia
author Cacciola Carballal, Fernando Luis
author_facet Cacciola Carballal, Fernando Luis
author_sort Cacciola Carballal, Fernando Luis
title Inside-polygon algorithm for curvilinear contours. Design and lmplementation
title_short Inside-polygon algorithm for curvilinear contours. Design and lmplementation
title_full Inside-polygon algorithm for curvilinear contours. Design and lmplementation
title_fullStr Inside-polygon algorithm for curvilinear contours. Design and lmplementation
title_full_unstemmed Inside-polygon algorithm for curvilinear contours. Design and lmplementation
title_sort inside-polygon algorithm for curvilinear contours. design and lmplementation
publishDate 1999
url http://sedici.unlp.edu.ar/handle/10915/22275
work_keys_str_mv AT cacciolacarballalfernandoluis insidepolygonalgorithmforcurvilinearcontoursdesignandlmplementation
bdutipo_str Repositorios
_version_ 1764820465505796096

Ejemplares similares