scholarly journals Space: The Re-Visioning Frontier of Biological Image Analysis with Graph Theory, Computational Geometry, and Spatial Statistics

Mathematics ◽  
2021 ◽  
Vol 9 (21) ◽  
pp. 2726
Author(s):  
John R. Jungck ◽  
Michael J. Pelsmajer ◽  
Camron Chappel ◽  
Dylan Taylor

Every biological image contains quantitative data that can be used to test hypotheses about how patterns were formed, what entities are associated with one another, and whether standard mathematical methods inform our understanding of biological phenomena. In particular, spatial point distributions and polygonal tessellations are particularly amendable to analysis with a variety of graph theoretic, computational geometric, and spatial statistical tools such as: Voronoi polygons; Delaunay triangulations; perpendicular bisectors; circumcenters; convex hulls; minimal spanning trees; Ulam trees; Pitteway violations; circularity; Clark-Evans spatial statistics; variance to mean ratios; Gabriel graphs; and, minimal spanning trees. Furthermore, biologists have developed a number of empirically related correlations for polygonal tessellations such as: Lewis’s law (the number of edges of convex polygons are positively correlated with the areas of these polygons): Desch’s Law (the number of edges of convex polygons are positively correlated with the perimeters of these polygons); and Errara’s Law (daughter cell areas should be roughly half that of their parent cells’ areas). We introduce a new Pitteway Law that the number of sides of the convex polygons in a Voronoi tessellation of biological epithelia is proportional to the minimal interior angle of the convex polygons as angles less than 90 degrees result in Pitteway violations of the Delaunay dual of the Voronoi tessellation.

Author(s):  
John R Jungck ◽  
Michael J Pelsmajer ◽  
Camron Chappel ◽  
Dylan Taylor

Every biological image contains quantitative data that can be used to test hypotheses about how patterns were formed, what entities are associated with one another, and whether standard mathematical methods inform our understanding of biological phenomena. In particular, spatial point distributions and polygonal tessellations are particularly amendable to analysis with a variety of graph theoretic, computational geometric, and spatial statistical tools such as: Voronoi Polygons; Delaunay Triangulations; Perpendicular Bisectors; Circumcenters; Convex Hulls; Minimal Spanning Trees; Ulam Trees; Pitteway Violations; Circularity; Clark-Evans spatial statistics; Variance to Mean Ratios; Gabriel Graphs; and, Minimal Spanning Trees. Furthermore, biologists have developed a number of empirically related correlations for polygonal tessellations such as: Lewis’s Law (the number of edges of convex polygons are positively correlated with the areas of these polygons): Desch’s Law (the number of edges of convex polygons are positively correlated with the perimeters of these polygons); and Errara’s Law (daughter cell areas should be roughly half that of their parent cells’ areas). We introduce a new Pitteway Law that the number of sides of the convex polygons in a Voronoi tessellation of biological epithelia is proportional to the minimal interior angle of the convex polygons as angles less than 90 degrees result in Pitteway violations of the Delaunay dual of the Voronoi tessellation.


1987 ◽  
Vol 24 (4) ◽  
pp. 809-826 ◽  
Author(s):  
J. Michael Steele ◽  
Lawrence A. Shepp ◽  
William F. Eddy

Let Vk,n be the number of vertices of degree k in the Euclidean minimal spanning tree of Xi, , where the Xi are independent, absolutely continuous random variables with values in Rd. It is proved that n–1Vk,n converges with probability 1 to a constant α k,d. Intermediate results provide information about how the vertex degrees of a minimal spanning tree change as points are added or deleted, about the decomposition of minimal spanning trees into probabilistically similar trees, and about the mean and variance of Vk,n.


Networks ◽  
1974 ◽  
Vol 4 (4) ◽  
pp. 299-310 ◽  
Author(s):  
A. Kershenbaum

2019 ◽  
Vol 47 (2) ◽  
pp. 323-336
Author(s):  
Mengta Yang ◽  
Reza Modarres ◽  
Lingzhe Guo

1987 ◽  
Vol 24 (04) ◽  
pp. 809-826 ◽  
Author(s):  
J. Michael Steele ◽  
Lawrence A. Shepp ◽  
William F. Eddy

Let Vk,n be the number of vertices of degree k in the Euclidean minimal spanning tree of Xi , , where the Xi are independent, absolutely continuous random variables with values in Rd. It is proved that n –1 Vk,n converges with probability 1 to a constant α k,d. Intermediate results provide information about how the vertex degrees of a minimal spanning tree change as points are added or deleted, about the decomposition of minimal spanning trees into probabilistically similar trees, and about the mean and variance of Vk,n.


2012 ◽  
Vol 7 (2) ◽  
pp. 774-788 ◽  
Author(s):  
Zanoni Dias ◽  
Anderson Rocha ◽  
Siome Goldenstein

Sign in / Sign up

Export Citation Format

Share Document