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.
- 1“Divide and Conquer Algorithms for Closest Point Problems in Multidimensional Space”. Ph.D. thesis, University of North Carolina at Chapel Hill, 1976.
- 2“Divide and Conquer in Multidimensional Space”. Proceedings of the Eighth Annual ACM Symposium on Theory of Computing, Hershey, Pa., 1976, pp. 220–30., and .
- 3Spatial Interaction and the Statistical Analysis of Lattice Systems. Journal of the Royal Statistical Society (B), 36 (1974), 192–236.
- 5Delaunay Triangles: An Alternative Approach to Point Pattern Analysis. Proceedings of the Association of American Geographers, 6 (1974), 26–29.
- 6Some Models of the Random Subdivision of Space. Geografiska Annaler, Ser. B, 55 (1973), 34–48.
- 7“Neighborhood Computations for Large Sets of Data Points”. Proceedings of the International Symposium on Computer-Assisted Cartography (AUTO-CARTO II). Washington, D.C.: American Congress on Surveying and Mapping, 1976, 337–45.
- 8A Topological Data Structure for Multi-Element Map Processing. Harvard Papers on Geographic Data Structures, 4 (1978).
- 10Sur la sphere vide. Bulletin of the Academy of Sciences of the USSR, Classe Sci. Mat. Nat. (1934), 793–800.
- 11The Complexity of Searching Lines in the Plane”. Department of Computer Science, Yale University, Research Report No. 71, 1975., and .
- 12Multidimensional Searching Problems. SIAM Journal of Computing, 5 (1976), 181–86.
- 13Instructions for Establishing Proximal Zones”. Unpublished manuscript. Harvard University, 1970.
- 15DELTRI: An Efficient Program for Producing Delaunay Triangulations”. Technical Report 18, ONR Contract N00014–75–0886, Department of Geography, Simon Fraser University, 1977.
- 19The Art of Computer Programming, Vol. 3: Sorting and Searching. New York: Addison Wesley, 1973.
- 20Laboratory for Computer Graphics and Spatial Analysis. SYMAP User's Reference Manual. Cambridge: Harvard University, 1975.
- 21Generation of a Triangular Grid with Application to Contour Plotting”. California Institute of Technology, Jet Propulsion Laboratory, Technical Memorandum No. 229, 1972.
- 22“On Triangulations of a Set of Points in the Plane”. Master's thesis, MIT, 1977.
- 24Models for Interplant Competition in Irregularly Spaced Populations. Statistical Ecology, 2 (1971), 13–30.
- 25Geographic Data Processing”. Department of Computer Science, University of Nebraska, 1978., and .
- 26Cartographic Data Structures. The American Cartographer, 2 (1975), 55–69., and .
- 27“The Triangulated Irregular Network”. Proceedings of the Digital Terrain Models (DTM) Symposium, American Society of Photogrammetry, St. Louis, 1978, 516–40., , , and .
- 29Packing and Covering. London: Cambridge University Press, 1964.
- 31“Computational Geometry”. Ph.D. thesis, Yale University, 1977.
- 32“Geometric Complexity”. Proceedings of the Seventh ACM Symposium on the Theory of Computing (1975), 224–33.
- 33Optimal Algorithms for Structuring Geographic Data. Harvard Papers on Geographical Information Systems, 6 (1978)., and .
- 34“Closest Point Problems”. Proceedings of the Sixteenth Annual Symposium on the Foundations of Computer Science, IEEE (1975), 151–62., and .
- 35“Locally Equiangular Triangulations”. Unpublished manuscript.
- 37Nouvelles applications des parametres continus à la theorie des formes quadratiques, Deuxieme Memoire, Recherches sur les paralleloedres primitifs. Journal Reine Angew. Math., 134 (1908), 198–287.
- 39Algorithms + Data Structures = Programs. Englewood Cliffs: Prentice-Hall, 1975.