Cargando…
Generation of simple polygons from ordered points using an iterative insertion algorithm
To construct a simple polygon from a set of plane points, we propose an iterative inserting ordered points (IIOP) algorithm. Using a given a set of ordered non-collinear points, a simple polygon can be formed and its shape is dependent on the sorting method used. To form such simple polygons with a...
Autores principales: | Zhang, Hongyun, Zhao, Quanhua, Li, Yu |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7069625/ https://www.ncbi.nlm.nih.gov/pubmed/32168363 http://dx.doi.org/10.1371/journal.pone.0230342 |
Ejemplares similares
-
Salzburg Database of Polygonal Data: Polygons and Their Generators
por: Eder, Günther, et al.
Publicado: (2020) -
A simple algorithm for computing positively weighted straight skeletons of monotone polygons()
por: Biedl, Therese, et al.
Publicado: (2015) -
Near Polygons
por: De Bruyn, Bart
Publicado: (2006) -
Moufang polygons
por: Tits, Jacques, et al.
Publicado: (2002) -
Generalized polygons
por: Van Maldeghem, Hendrik
Publicado: (1998)