Geodesic
Simulation of points uniformly distributed in polygons
Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 5 (2002) no. 4, pp. 331-350 
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/
@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},
     year = {2002},
     volume = {5},
     number = {4},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/SJVM_2002_5_4_a2/}
}
TY  - JOUR
AU  - A. O. Makhotkin
TI  - Simulation of points uniformly distributed in polygons
JO  - Sibirskij žurnal vyčislitelʹnoj matematiki
PY  - 2002
SP  - 331
EP  - 350
VL  - 5
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/SJVM_2002_5_4_a2/
LA  - ru
ID  - SJVM_2002_5_4_a2
ER  - 
%0 Journal Article
%A A. O. Makhotkin
%T Simulation of points uniformly distributed in polygons
%J Sibirskij žurnal vyčislitelʹnoj matematiki
%D 2002
%P 331-350
%V 5
%N 4
%U http://geodesic.mathdoc.fr/item/SJVM_2002_5_4_a2/
%G ru
%F SJVM_2002_5_4_a2

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.

[1] Hammersley J. M. and Handscomb D. C., Monte Carlo Methods, Wiley, New York, 1964 | MR | Zbl

[2] Ermakov S. M., Mikhailov G. A., Statisticheskoe modelirovanie, Nauka, M., 1982. | MR

[3] Devroy L., Non-Uniform Random Variate Generation, Springer-Verlag, 1986

[4] Matematicheskaya entsiklopediya, T. 3, Sovetskaya entsiklopediya, M., 1982

[5] Chen H. C., Asau V., “On generating random variates from an empirical distribution”, AIDE Transactions, 6 (1974), 163–166

[6] Makhotkin O. A., “Kvantilnyi metod generirovaniya diskretnykh sluchainykh velichin”, Teoriya i prilozheniya statisticheskogo modelirovaniya, ed. Mikhailov G. A., VTs SO AN, Novosibirsk, 1989, 33–42 | MR

[7] Knut D. E., Iskusstvo programmirovaniya dlya EVM. T. 3. Sortirovka i poisk, Mir, M., 1978 | MR | Zbl

[8] Kendall M., Moran P., Geometricheskie veroyatnosti, Nauka, M., 1972 | MR | Zbl

[9] Santalo L. A., Integeral Geometry and Geometric Probability, Encyclopedia of Mathematics and its Applications, Addison-Wesley, 1976 | MR | Zbl