Black Holes as Markers of Dimensionality

Black hole temperature TBH = TP/2πd as a function of its Planck length real diameter multiplier d is derived from black hole surface gravity and Hawking temperature w.l.o.g. It is conjectured d = 1/2π describes primordial Big Bang singularity as in this case TBH = TP. A black hole interacts with the environment and observable black holes have uniquely defined Delaunay triangulations with a natural number of spherical triangles having Planck areas (bits), where a Planck triangle is active and has gravitational potential of -c2 if all its vertices have black hole gravitational potential of -c2/2 and is inactive otherwise. As temporary distribution of active triangles on an event horizon tends to maximize Shannon entropy a black hole is a fundamental, one-sided thermodynamic equilibrium limit for a dissipative structure. Black hole blackbody radiation, informational capacity fluctuations, and quantum statistics are discussed. On the basis of the latter, wavelength bounds for BE, MB, and FD statistics are derived as a function of the diameter multiplier d. It is shown that black holes feature wave-particle duality only if d ≤ 8π, which also sets the maximum diameter of a totally collapsible black hole. This outlines the program for research of other nature phenomena that emit perfect blackbody radiation, such as neutron stars and white dwarfs.

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

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.

Acute PEBI Grid Generation for Reservoir Geometries

An unstructured grid generation method is presented that automates control-volume boundary alignment to geological objects and control point alignment to complex wells. The grid generation method is coupled with an iterative acute mesh reconstruction technique, to construct essentially acute triangulations, while satisfying quite general geometric constraints. For well aligned grids control points are constrained to the well trajectory and protection circles are used, whereas for boundary aligned grids halo construction is performed. Unstructured Delaunay triangulations (DT) have the desirable locally orthogonal perpendicular bisectional (PEBI) property, required by the industry standard two-point flux approximation for consistency for isotropic fields. The PEBI property can only be exploited if such grids are comprised of acute simplexes, with circumcentres located inside their respective elements. The method presented enables acute DT layered mesh generation while honoring internal boundaries and wells in a two dimensional space. A dual (Voronoi) grid derived from a feature honored simplicial mesh is then projected in the vertical direction generating 2.5D PEBI grids. Effectiveness of the method to construct acute PEBI grids honoring geological objects and complex wells is demonstrated by meshing representative reservoir geometries. Numerical results are presented that verify consistency of the two-point flux on the resulting boundary-aligned acute PEBI grids. Development of an unstructured grid generation method which 1) Automates interior boundary alignment, 2) Honors features with respect to control point and/or control volume, and 3) Generates acute PEBI grids for reservoir geometries is presented. A unique workflow is presented to generate boundary aligned acute PEBI grids for complex geometries. Development of boundary aligned grids that honor both geological objects and multilateral complex wells, together with mesh reconstruction to ensure circumcenter containment is presented. Further, 3D PEBI grid generation method which can limit refinement to well perforations and geological objects is also described.

Black Holes as Markers of Dimensionality

Black hole temperature as a function of its Planck length diameter multiple is derived from black hole surface gravity and Hawking temperature. It is conjectured that this multiple corresponds to dimensionality of the graph of nature with d = 1/2pi describing primordial Big Bang singularity. A black hole interacts with the environment and observable black holes have uniquely defined Delaunay triangulations with a natural number of spherical triangles having Planck areas (bits), where a Planck triangle is active and has gravitational potential of -c^2 if all its vertices have black hole gravitational potential of -c^2/2 and is inactive otherwise. Temporary distribution of active triangles on an event horizon tends to maximize Shannon entropy. Black hole blackbody radiation, informational capacity fluctuations, and quantum statistics are discussed. On the basis of the latter, wavelength bounds for BE, MB, and FD statistics are derived as a function of a diameter. A similarity of the logistic function and black hole FD statistics leads to the BE logistic function and map. This outlines the program for research of other nature phenomena that emit perfect blackbody radiation, such as neutron stars and white dwarfs.

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

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.

FAST ROBUST ARITHMETICS FOR GEOMETRIC ALGORITHMS AND APPLICATIONS TO GIS

Geometric predicates are used in many GIS algorithms, such as the construction of Delaunay Triangulations for Triangulated Irregular Networks (TIN) or geospatial predicates. With floating-point arithmetic, these computations can incur roundoff errors that may lead to incorrect results and inconsistencies, causing computations to fail. This issue has been addressed using a combination of exact arithmetics for robustness and floating-point filters to mitigate the computational cost of exact computations. The implementation of exact computations and floating-point filters can be a difficult task, and code generation tools have been proposed to address this. We present a new C++ meta-programming framework for the generation of fast, robust predicates for arbitrary geometric predicates based on polynomial expressions. We show examples of how this approach produces correct results for GIS data sets that could lead to incorrect predicate results for naive implementations. We also show benchmark results that demonstrate that our implementation can compete with state-of-the-art solutions.

ENCRYPTION OF 3D PLANE IN GIS USING VORONOI-DELAUNAY TRIANGULATIONS AND CATALAN NUMBERS

A method of encryption of the 3D plane in Geographic Information Systems (GIS) is presented. The method is derived using Voronoi-Delaunay triangulation and properties of Catalan numbers. The Voronoi-Delaunay incremental algorithm is presented as one of the most commonly used triangulation techniques for random point selection. In accordance with the multiple applications of Catalan numbers in solving combinatorial problems and their "bit-balanced" characteristic, the process of encrypting and decrypting the coordinates of points using the Lattice Path method (walk on the integer lattice) or LIFO model is given. The triangulation of the plane started using decimal coordinates of a set of given planar points. Afterward, the resulting decimal values of the coordinates are converted to corresponding binary records and the encryption process starts by a random selection of the Catalan key according to the LIFO model. These binary coordinates are again converted into their original decimal values, which enables the process of encrypted triangulation. The original triangulation of the plane can be generated by restarting the triangulation algorithm. Due to its exceptional efficiency in terms of launching programs on various computer architectures and operating systems, Java programming language enables an efficient implementation of our method.