Mathematical Geology

, Volume 19, Issue 6, pp 523–537 | Cite as

Detecting Voronoi (area-of-influence) polygons

  • David G. Evans
  • Steven M. Jones
Articles

Abstract

Voronoi, or area-of-influence, polygons are convex, space-filling polygons constructed around a set of points (Voronoi centers) such that each polygon contains all points closer to its Voronoi center than to the center of any other polygon. The relationship of Voronoi centers to edges of Voronoi polygons is used to test whether any convex tessellation consists of Voronoi polygons. This test amounts to finding Voronoi centers that best fit the given tessellation. Voronoi centers are found by solving two systems of linear equations. These equations represent (1) conditions on the slope of polygon edges relative to the slope of lines through Voronoi centers, and (2) conditions on the distance from edges to Voronoi centers. Least squares and constrained least-squares solutions are used to solve the two systems. Different methods of solution can provide insight as to how a tessellation varies from Voronoi polygons. A goodness-of-fit statistic is derived and examined by testing randomly generated convex tessellations. Some polygonal ice cracks provide an example of naturally occurring polygons that are approximated closely by Voronoi polygons.

Key words

Thiessen polygons constrained least squares ice cracks 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beard, C. N., 1959, Quantitative Study of Columnar Jointing: Geol. Soc. Am. Bull., v. 70, p. 379–382.Google Scholar
  2. Boots, B. N. and Murdoch, D. J., 1983, the Spatial Arrangement of Random Voronoi Polygons: Comput. & Geosci., v. 9, p. 351–365.Google Scholar
  3. Crain, I. K., 1978, The Monte-Carlo Generation of Random Polygons: Comput. & Geosci., v. 4, p. 131–141.Google Scholar
  4. Gilbert, E. N., 1962, Random Subdivision of Space into Crystals: Ann. Math. Stat., v. 33, p. 958–972.Google Scholar
  5. Golub, G. H. and Van Loan, C. F., 1983, Matrix Computations: The Johns Hopkins University Press, Baltimore, Maryland, 476 p.Google Scholar
  6. Green, P. J. and Sibson, R., 1978, Computing Dirchlet Tessellations in the Plane: Comput. J., v. 21, p. 168–173.Google Scholar
  7. Guibas, L. and Stolfi, J., 1985, Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams: ACM Trans. Graph., v. 4, p. 74–123.Google Scholar
  8. Hayes, W. B. and Koch, G. S., 1984, Constructing and Analyzing Area-of-Influence Polygons by Computer: Comput. Geosci., v. 10, p. 411–430.Google Scholar
  9. Lachenbruch, A. H., 1962, Mechanics of Thermal Contraction Cracks and Ice-Wedge Polygons in Permafrost: Geol. Soc. Amer. Spec. Paper 70, 69 p.Google Scholar
  10. Lawson, C. L. and Hanson, R. J., 1974, Solving Least Squares Problems: Prentice-Hall Inc., Englewood Cliffs, New Jersey, 340 p.Google Scholar
  11. Meijering, J. L., 1953, Interface Area, Edge Length, and Number of Vertices in Crystal Aggregrates with Random Nucleation: Philips Res. Rept., v. 8, p. 270–290.Google Scholar
  12. Noble, B. and Daniel, J. W., 1977, Applied Linear Algebra: Prentice-Hall Inc., Englewood Cliffs, New Jersey, 477 p.Google Scholar
  13. Preparata, F. P. and Shamos, M. I., 1985, Computational Geometry An Introduction: Springer-Verlag, New York, New York, 390 p.Google Scholar
  14. Smalley, I. J., 1966, Contraction Crack Networks in Basalt Flows: Geol. Mag., v. 103, p. 110–114.Google Scholar

Copyright information

© International Association for Mathematical Geology 1987

Authors and Affiliations

  • David G. Evans
    • 1
  • Steven M. Jones
    • 1
  1. 1.Department of Geology and GeophysicsLouisiana State UniversityBaton RougeUSA

Personalised recommendations