Inside-polygon algorithm for curvilinear contours. Design and lmplementation

Autores
Cacciola Carballal, Fernando Luis
Año de publicación
1999
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
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.
Eje: Ingeniería del software. Computación gráfica y visualización
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
Inside-polygon
curvilinear contours
Visual
COMPUTER GRAPHICS
Algorithms
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/22275

id SEDICI_162febff515c4e6682b289b68a4ea985
oai_identifier_str oai:sedici.unlp.edu.ar:10915/22275
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Inside-polygon algorithm for curvilinear contours. Design and lmplementationCacciola Carballal, Fernando LuisCiencias InformáticasInside-polygoncurvilinear contoursVisualCOMPUTER GRAPHICSAlgorithmsThis 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.Eje: Ingeniería del software. Computación gráfica y visualizaciónRed de Universidades con Carreras en Informática (RedUNCI)1999-05info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/22275enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T10:54:57Zoai:sedici.unlp.edu.ar:10915/22275Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 10:54:58.186SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Inside-polygon algorithm for curvilinear contours. Design and lmplementation
title Inside-polygon algorithm for curvilinear contours. Design and lmplementation
spellingShingle Inside-polygon algorithm for curvilinear contours. Design and lmplementation
Cacciola Carballal, Fernando Luis
Ciencias Informáticas
Inside-polygon
curvilinear contours
Visual
COMPUTER GRAPHICS
Algorithms
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
dc.creator.none.fl_str_mv Cacciola Carballal, Fernando Luis
author Cacciola Carballal, Fernando Luis
author_facet Cacciola Carballal, Fernando Luis
author_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
Inside-polygon
curvilinear contours
Visual
COMPUTER GRAPHICS
Algorithms
topic Ciencias Informáticas
Inside-polygon
curvilinear contours
Visual
COMPUTER GRAPHICS
Algorithms
dc.description.none.fl_txt_mv 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.
Eje: Ingeniería del software. Computación gráfica y visualización
Red de Universidades con Carreras en Informática (RedUNCI)
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.
publishDate 1999
dc.date.none.fl_str_mv 1999-05
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/22275
url http://sedici.unlp.edu.ar/handle/10915/22275
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1844615807940689920
score 13.070432