Some preliminary studies leading to this algorithm have been initiated by Dr. Thomas Peucker, Simon Fraser University, and have been supported by ONR Contract N00014–75–0886. Mr. Robert Fowler, Simon Fraser University, has pointed out and corrected some important shortcomings of a preliminary version of this algorithm. The implementation of the present procedure has been supported by the Erie and Niagara Counties Regional Planning Board. Mr. George Sicherman reviewed the manuscript and provided substantial help in formulating the proof section of this paper. Mr. Mike Wasilenko executed the illustrations. The authors gratefully acknowledge all these contributions.
A Procedure to Generate Thiessen Polygons
Article first published online: 3 SEP 2010
1979 The Ohio State University
Volume 11, Issue 3, pages 289–303, July 1979
How to Cite
Brassel, K. E. and Reif, D. (1979), A Procedure to Generate Thiessen Polygons. Geographical Analysis, 11: 289–303. doi: 10.1111/j.1538-4632.1979.tb00695.x
Douglas Reif is a graduate student in computer science, State University of New York at Buffalo.
- Issue published online: 3 SEP 2010
- Article first published online: 3 SEP 2010
- Submitted 6/78. Revised version accepted 12/78.
An algorithm to generate Thiessen diagrams for a set of n points defined in the plane is presented. First, existing proximal polygon computation procedures are reviewed and terms are defined. The algorithm developed here uses a rectangular window within which the Thiessen diagram is defined. The computation of Thiessen polygons uses an iterative walking process whereby the processing starts at the lower left corner of the diagram and proceeds toward the right top corner. The use of a sorted point sequence and dynamical core allocation provide for efficient processing. The presentation is concluded by the discussion of an implementation of the algorithm in a FORTRAN program.