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...
Main Authors: | Hongyun Zhang, Quanhua Zhao, Yu Li |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2020-01-01
|
Series: | PLoS ONE |
Online Access: | https://doi.org/10.1371/journal.pone.0230342 |
Similar Items
-
A simple algorithm for calculating the area of an arbitrary polygon
by: K.R. Wijeweera, et al.
Published: (2017-06-01) -
Mesh algorithms for shortest path problems inside simple polygons
by: Li, Shui-Cang, et al.
Published: (1992) -
Base Point Split Algorithm for Generating Polygon Skeleton Lines on the Example of Lakes
by: Elżbieta Lewandowicz, et al.
Published: (2020-11-01) -
Linear time algorithms of simple polygon problems in computational geometry
by: WANG, DE-PEN, et al.
Published: (1988) -
Forms of Crossed and Simple Polygons
by: Luigi Togliani
Published: (2019-12-01)