Simulation of points uniformly distributed in polygons
Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 5 (2002) no. 4, pp. 331-350
Voir la notice de l'article provenant de la source Math-Net.Ru
An algorithm for the simulation of random points uniformly distributed in polygons is considered. This
algorithm uses the decomposition of polygons on triangles. The correctness of the proposed algorithm is proved,
its efficiency is demonstrated on different concrete examples. The problems of computer realization for the
methods of decomposition and simulation are discussed. The effective schemes of simulation algorithms are
listed using a pseudo-Pascal language.
@article{SJVM_2002_5_4_a2,
author = {A. O. Makhotkin},
title = {Simulation of points uniformly distributed in polygons},
journal = {Sibirskij \v{z}urnal vy\v{c}islitelʹnoj matematiki},
pages = {331--350},
publisher = {mathdoc},
volume = {5},
number = {4},
year = {2002},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/SJVM_2002_5_4_a2/}
}
A. O. Makhotkin. Simulation of points uniformly distributed in polygons. Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 5 (2002) no. 4, pp. 331-350. http://geodesic.mathdoc.fr/item/SJVM_2002_5_4_a2/