This article is cited 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.

UDC: 519.245 ББК 22.193

Received: 01.03.2001
Revised: 16.11.2001

Bibliographic databases:

•