|
Sibirskii Zhurnal Vychislitel'noi Matematiki, 2002, Volume 5, Number 4, Pages 331–350
(Mi sjvm258)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Simulation of points uniformly distributed in polygons
A. O. Makhotkin Institute of Computational Mathematics and Mathematical Geophysics (Computing Center), Siberian Branch of the Russian Academy of Sciences
Abstract:
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.
Received: 01.03.2001 Revised: 16.11.2001
Citation:
A. O. Makhotkin, “Simulation of points uniformly distributed in polygons”, Sib. Zh. Vychisl. Mat., 5:4 (2002), 331–350
Linking options:
https://www.mathnet.ru/eng/sjvm258 https://www.mathnet.ru/eng/sjvm/v5/i4/p331
|
|