The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
A Procedure to Generate Thiessen Polygons
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 15,999
Spatial Interaction and the Statistical Analysis of Lattice Systems
Besag, J. (1974) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1974.tb00999.x · Cited by 6,067
Voronoi, G. (1908) · Journal für die reine und angewandte Mathematik (Crelles Journal) · doi:10.1515/crll.1908.134.198 · Cited by 2,248
PRECIPITATION AVERAGES FOR LARGE AREAS
THIESSEN, A. H. (1911) · Monthly Weather Review · doi:10.1175/1520-0493(1911)39<1082b:pafla>2.0.co;2 · Cited by 1,187
Shamos, M. I., & Hoey, D. (1975) · 16th Annual Symposium on Foundations of Computer Science (sfcs 1975) · doi:10.1109/sfcs.1975.8 · Cited by 1,057
Algorithms+Data Structures = Programs
(2024) · Data Structures and Algorithms in Java · doi:10.1017/9781009260350.002 · Cited by 953
The Art of Computer Programming, Vol. 3: Sorting and Searching
McClellan, M. T., Minker, J., & Knuth, D. E. (1974) · Mathematics of Computation · doi:10.2307/2005383 · Cited by 910
Computing Dirichlet Tessellations in the Plane
Green, P. J., & Sibson, R. (1978) · The Computer Journal · doi:10.1093/comjnl/21.2.168 · Cited by 719
Brent, R. P. (1975) · Mathematics of Computation · doi:10.1090/s0025-5718-1975-0371062-9 · Cited by 603
Zassenhaus, H., & Rogers, C. A. (1966) · The American Mathematical Monthly · doi:10.2307/2315450 · Cited by 576
Cited by
Voronoi diagrams—a survey of a fundamental geometric data structure
Aurenhammer, F. (1991) · ACM Computing Surveys · doi:10.1145/116873.116880 · Cited by 4,340
Landscape genetics: combining landscape ecology and population genetics
Manel, S., Schwartz, M. K., Luikart, G., & Taberlet, P. (2003) · Trends in Ecology & Evolution · doi:10.1016/s0169-5347(03)00008-9 · Cited by 1,859
A global map of roadless areas and their conservation status
Ibisch, P. L., Hoffmann, M. T., Kreft, S., Pe’er, G., Kati, V., Biber-Freudenberger, L., DellaSala, D. A., Vale, M. M., Hobson, P. R., & Selva, N. (2016) · Science · doi:10.1126/science.aaf7166 · Cited by 623
Rosser, Z. H., Zerjal, T., Hurles, M. E., Adojaan, M., Alavantic, D., Amorim, A., Amos, W., Armenteros, M., Arroyo, E., Barbujani, G., et al. (2000) · The American Journal of Human Genetics · doi:10.1086/316890 · Cited by 424
Lizundia-Loiola, J., Otón, G., Ramo, R., & Chuvieco, E. (2020) · Remote Sensing of Environment · doi:10.1016/j.rse.2019.111493 · Cited by 408
Metadata
- Authors
- Brassel, K. E., & Reif, D.
- Venue
- Geographical Analysis
- Publisher
- Wiley
- Published
- 1979-07
- Volume
- 11
- Issue
- 3
- Pages
- 289-303
- ISSN
- 0016-7363 (ISSN-L)
- 1538-4632
- OpenAlex
- W2019079424
- Cited by
- 292
- References
- 16
- FWCI
- 7.11
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Procedure to Generate Thiessen Polygons. https://app.cochat.ai/papers/10.1111/j.1538-4632.1979.tb00695.x
- The paper
- Brassel, K. E., & Reif, D. (1979). A Procedure to Generate Thiessen Polygons. Geographical Analysis. https://doi.org/10.1111/j.1538-4632.1979.tb00695.x
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.