An algorithm to generate random points in polygon based on triangulation

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Random point generation plays an important role in assisting random sampling and is widely used in various disciplines. This paper proposes a new algorithm to generate random points in polygon based on Triangulation. Firstly, the polygons are triangulated, and then the number of random points in each triangle is allocated according to the triangle area. Finally, the given number of random points is generated inside the triangle. In the experiment, the results showed that the proposed algorithm is 20 times faster than the algorithm in QGIS software on average. And with the increase of the complexity of the polygon, the advantages of this algorithm are more obvious.

Cite

CITATION STYLE

APA

Xu, Z., Zhang, L., & Ma, R. (2020). An algorithm to generate random points in polygon based on triangulation. In IOP Conference Series: Earth and Environmental Science (Vol. 428). Institute of Physics Publishing. https://doi.org/10.1088/1755-1315/428/1/012064

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free