\`x^2+y_1+z_12^34\`
Advanced Search
Article Contents
Article Contents

Chromatic alpha complexes

  • *Corresponding author: Ondřej Draganov

    *Corresponding author: Ondřej Draganov 
Abstract / Introduction Full Text(HTML) Figure(16) / Table(1) Related Papers Cited by
  • Motivated by applications in medical sciences, we study finite chromatic sets in Euclidean space from a topological perspective. Based on the persistent homology for images, kernels and cokernels, we design provably stable homological quantifiers that describe the geometric micro- and macro-structure of how the color classes mingle. These can be efficiently computed using chromatic variants of Delaunay and alpha complexes, and code that does these computations is provided.

    Mathematics Subject Classification: Primary: 62R40, 55N31; Secondary: 68T09, 57Q70.

    Citation:

    \begin{equation} \\ \end{equation}
  • 加载中
  • Figure 1.  Mingling patterns distinguished by the number of colors forming a cycle and the number of additional colors filling this cycle. The drawings are caricatures of similar patterns for cycles different from circles and fillings different from disks. The patterns are but a first attempt to differentiate types of interactions, and they are by no means precise or exhaustive. For example, two additional colors can fill a cycle in at least two different ways (see the pattern of type 1+2): in a collaboration as suggested in the drawing, or each individually, like two different patterns of type 1+1

    Figure 2.  On the left: a set, $ A \subseteq {{\mathbb R}}^2 $, together with its Voronoi tessellation, $ {{\rm Vor}_{({{A}})}} $, and one Voronoi ball highlighted. On the right: the union of disks, $ \bigcup_{a\in A} {{B}_{{r}}{({{a}})}} $, with the alpha complex, $ {{\rm Alf}_{{r}}{({{A}})}} $, superimposed

    Figure 3.  Two empty stacks in $ {{\mathbb R}}^2 $ that pass through one blue point, two green points, and one orange point forming a simplex $ \nu\in{{\rm Del}_{({{\chi}})}} $. (In fact, the stack on the right passes through two orange points, and it also passes through the one orange point that the left orange circle passes through.) The set of centers of all empty stacks that pass through these four points is the intersection of three Voronoi cells: a blue 2-cell, a green 1-cell, and an orange 2-cell. The right panel shows the smallest empty stack in this collection: its center lies on the boundary of the intersection of Voronoi cells, which is the reason why one of its circles passes through an extra point

    Figure 4.  An obtuse triangle with two blue points and an orange point at the obtuse angle. The smallest empty sphere that passes through the three points on the left has strictly larger radius than the smallest empty stack that passes through the three points on the right. Therefore, the triangle belongs to both, the Delaunay complex and the chromatic Delaunay complex, but it has a different value under the two radius functions

    Figure 5.  On the left: a chromatic set together with the Voronoi tessellations of the blue and orange points overlaid, and one chromatic Voronoi ball highlighted. On the right: the union of blue and the union of orange disks

    Figure 6.  The chromatic lifting for points in $ {{\mathbb R}}^2 $ with two colors. Left: the chromatic Delaunay complex embedded in three dimensions using the lifted points as vertices; it is isomorphic to the Delaunay complex of the lifted points. The triangles and tetrahedra with more than one color are left unfilled for clarity. Right: the union of disks of radius $ r $, for each color separately on the two sides, and for both colors together in the middle. As defined shortly in Section 3.4, each plank (solid cylinder) connects a disk in the middle with the same disk on one of the sides. We show one such cylinder for each color

    Figure 7.  The chromatic lifting for points in $ {{\mathbb R}}^1 $ with three colors. Left: the chromatic Delaunay complex embedded in three dimensions using the lifted points as vertices; it is isomorphic to the Delaunay complex of the lifted points. The triangles and tetrahedra are left unfilled for clarity. Right: the union of segments of length $ 2r $, for each color separately along the three lines. Note the barycentric subdivision of the triangle at the bottom, and the parallel lines emanating from the midpoints of the edges and the barycenter of the triangle. As defined shortly, each plank is a quadrangular prism that connects one of the intervals with its projections to three of these parallel lines. We show one such prism for each color

    Figure 8.  The union of bi-chromatic planks for a tri-chromatic point set in $ {{\mathbb R}}^1 $. It is homotopy equivalent to the bi-chromatic subcomplex of the corresponding chromatic alpha complex. On the left, we show the planks in the sides of the triangular prism erected on top of the barycentrically subdivided color triangle. On the right, the three sides of the triangular prism are unfolded into the plane, and the planks are glued along the orange dashed lines. A similar unfolding one dimension higher helps us to understand the situation for the 2-dimensional data in Figure 9

    Figure 9.  The union of bi-chromatic planks for a tri-chromatic point set in $ {{\mathbb R}}^2 $. For clarity, only one plank per color is shown. Every blue, green; and yellow disk is connected to its gray counterparts via a solid cylinder. By construction, the planks are subsets of the boundary faces of a 4-dimensional triangular prism. Similar to Figure 8, we unfold the 3-dimensional boundary so we can illustrate the planks in $ {{\mathbb R}}^3 $, as shown. Observe the highlighted 2-hole in the middle: this is a topological feature that captures a loop created by one color (blue) and filled by each of the other two colors. This is one variant of the pattern of type 1+2 from Figure 1

    Figure 10.  The columns in this matrix are the gradient vectors after combining them as explained in the proof of Lemma 4.5. Zero entries are left blank. There are $ s+1 $ blocks of columns, one for each color. The respective first columns of the first $ k+1 $ blocks contain $ \nabla h_0 $ and $ \nabla h_j - \nabla h_0 $, for $ 1 \leq j \leq k $. The points of colors 0 to $ k $ all lie on the same sphere, and we get vectors by subtracting the same point, $ c_0 $, from each such point. For each color $ j \geq k+1 $, we get vectors from the points in block $ j $ by subtracting an arbitrary but fixed point $ c_j \in B_j $

    Figure 11.  An example showing that chromatic genericity is needed for the radius function to be generalized discrete Morse. Two blue points, $ a,b $, and two orange points, $ c,d $, share a common bisector and therefore violate the chromatic genericity condition in Definition 4.1. Indeed, the four points also lie on a common circle. The two shown circles belong to the smallest empty circumstack of the simplex $ abcd $. This stack is still the smallest empty circumstack for the edges $ ab $, $ ad $, and $ bc $, but not of any single vertex. Hence, the set of simplices that share the radius with $ abcd $ does not have a unique minimum and is therefore not an interval

    Figure 12.  A bi-chromatic point set on the left, and a tri-chromatic point set on the right. The dotted line indicates the separation of green from orange points that form the background for the blue circle

    Figure 13.  The 6-pack for the bi-chromatic point set in the left panel of Figure 12. The domain, $ L $, is the blue subcomplex of the codomain, $ K $, which is the 3-dimensional chromatic Delaunay complex of the blue and orange points

    Figure 14.  Example showing that five diagrams do not imply the sixth. The two filtrations differ by a single 2-dimensional cell added in the respective fourth steps of the filtrations. Correspondingly, five of the 1-dimensional persistence diagrams (shown as barcodes) are the same, while the highlighted diagrams of the codomain differ on the two sides

    Figure 15.  The four exact sequences for three complexes drawn along sine-like curves in the plane. After each half-period, the dimension of the homology group drops by one

    Figure 16.  The 6-pack of $ (L,M) \subseteq (K,M) $ for the data in the right panel of Figure 12. $ M $, $ L $, and $ K $ are the 1-, 2- and 3-chromatic subcomplexes of the chromatic Delaunay complex

    Table 1.  The arrangement of the persistence diagrams in the 6-pack for the pair $ L \subseteq K $ in two rows and three columns. Read the six positions in a circle so that the domain lies between the kernel and the image, the image lies between the domain and the codomain, etc

    kernel: relative: cokernel:
    $ {{\rm Dgm}_{({{{\rm ker}_{\,{ {{f_L}} \to {{f_K}}}}}})}} $ $ {{\rm Dgm}_{({{ {{f_{K,L}}}}})}} $ $ {{\rm Dgm}_{({{{\rm cok}_{\,{ {{f_L}} \to {{f_K}}}}}})}} $
    domain: image: codomain:
    $ {{\rm Dgm}_{({{ {{f_L}}}})}} $ $ {{\rm Dgm}_{({{{\rm im}_{{\,}{ {{f_L}} \to {{f_K}}}}}})}} $ $ {{\rm Dgm}_{({{ {{f_K}}}})}} $
     | Show Table
    DownLoad: CSV
  • [1] U. Bauer and H. Edelsbrunner, The Morse theory of Čech and Delaunay complexes, Trans. Amer. Math. Soc., 369 (2017), 3741-3762.  doi: 10.1090/tran/6991.
    [2] U. Bauer, M. Kerber, F. Roll and A. Rolle, A unified view on the functorial nerve theorem and its variations, Expositiones Mathematicae, 41 (2023), 125503, 52 pp. doi: 10.1016/j.exmath.2023.04.005.
    [3] M. Binnewies et al., Understanding the tumor immune microenvironment (TIME) for effective therapy, Nat. Med., 24 (2018), 541-550. doi: 10.1038/s41591-018-0014-x.
    [4] R. Biswas, S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner and M. Saghafian, On the size of chromatic Delaunay mosaics, arXiv: 2212.03121 [math.CO], 2022.
    [5] K. Borsuk, On the imbedding of systems of compacta in simplicial complexes, Fund. Math., 35 (1948), 217-234.  doi: 10.4064/fm-35-1-217-234.
    [6] S. Boyd and  L. VandenbergheConvex Optimization, Cambridge Univ. Press, Cambridge, England, 2004. 
    [7] D. Cohen-SteinerH. Edelsbrunner and J. Harer, Stability of persistence diagrams, Discrete Comput. Geom., 37 (2007), 103-120.  doi: 10.1007/s00454-006-1276-5.
    [8] D. Cohen-Steiner, H. Edelsbrunner, J. Harer and D. Morozov, Persistent homology for kernels, images, and cokernels, In Proc. 20th Ann. ACM-SIAM Sympos. Discrete Alg., 2009, 1011-1020.
    [9] D. Cohen-Steiner, H. Edelsbrunner and D. Morozov, Vines and vineyards by updating persistence in linear time, In Proc. 22nd Ann. Sympos. Comput. Geom., 2006,119-126. doi: 10.1145/1137856.1137877.
    [10] O. Draganov, Structures and Computations in Topological Data Analysis, Ph.D. thesis, Institute of Science and Technology Austria, Klosterneuburg, Austria, 2024.
    [11] O. Draganov and M. Mahini, Chromatic-tda, github.com/OnDraganov/chromatic-tda, 2023.
    [12] H. Edelsbrunner and J. L. Harer, Computational Topology: An Introduction, Amer. Math. Soc., Providence, Rhode Island, 2010. doi: 10.1090/mbk/069.
    [13] H. EdelsbrunnerD. G. Kirkpatrick and R. Seidel, On the shape of a set of points in the plane, IEEE Trans. Inform. Theory, 29 (1983), 551-559.  doi: 10.1109/TIT.1983.1056714.
    [14] H. Edelsbrunner and E. P. Mücke, Three-dimensional alpha shapes, ACM Trans. Graphics, 13 (1994), 43-72.  doi: 10.1145/174462.156635.
    [15] G. Fejes Tóth, Multiple packing and covering of the plane with circles, Acta Math. Acad. Sci. Hung., 27 (1976), 135-140.  doi: 10.1007/BF01896768.
    [16] R. Forman, Morse theory for cell complexes, Adv. Math., 134 (1998), 90-145.  doi: 10.1006/aima.1997.1650.
    [17] R. Freij, Equivariant discrete Morse theory, Discrete Math., 309 (2009), 3821-3829.  doi: 10.1016/j.disc.2008.10.029.
    [18] I. M. Gelfand, M. M. Kapranov and A. V. Zelevinsky, Discriminants, Resultants and Multidimensional Determinants, Birkhäuser, Boston, Massachusetts, 1994. doi: 10.1007/978-0-8176-4771-1.
    [19] M. Kerber and H. Edelsbrunner, 3D kinetic alpha complexes and their implementation, In Proc. Mtg. Algorithm Engin. Experiments, 2013, 70-77. doi: 10.1137/1.9781611972931.6.
    [20] J. Leray, Sur la forme des espaces topologiques et sur les points fixes des représentations, J. Math. Pures Appl., 24 (1945), 95-167. 
    [21] J.-L. Maître et al., Adhesion functions in cell sorting by mechanically coupling the cortices of adhering cells, Science, 338 (2012), 253-256. doi: 10.1126/science.1225399.
    [22] Y. Miao et al., Reconstruction and deconstruction of human somitogenesis in vitro, Nature, 614 (2023), 500-508. doi: 10.1038/s41586-022-05655-4.
    [23] Y. Reani and O. Bobrowski, A coupled alpha complex, J. Comput. Geom., 14 (2023), 221-256. 
    [24] N. A. Scoville, Discrete Morse Theory, Amer. Math. Soc., Providence, Rhode Island, 2019. doi: 10.1090/stml/090.
    [25] M. I. Shamos and D. Hoey, Closest-point problems, In Proc. 16th Ann. Sympos. Found. Comput. Sci., 1975,151-162.
    [26] B. J. Stolz, J. Dhesi, J. A. Bull, H. A. Harrington, H. M. Byrne and I. H. R. Yoon, Relational persistent homology for multispecies data with application to the tumor microenvironment, Bull. Math. Biol., 86 (2024), Paper No. 128, 32 pp. doi: 10.1007/s11538-024-01353-6.
    [27] A. Weil, Sur les théorèmes de de Rham, Comment. Math. Helv., 26 (1952), 119-145.  doi: 10.1007/BF02564296.
    [28] E. Welzl, Smallest enclosing disks (balls and ellipsoids), In New Results and New Trends in Computer Science, ed.: H. Maurer, Springer LNCS 555 (1991), 359-370. doi: 10.1007/BFb0038202.
    [29] The CGAL Project, CGAL User and Reference Manual, CGAL Editorial Board, 4.10 edition, 2017.
  • 加载中

Figures(16)

Tables(1)

SHARE

Article Metrics

HTML views(4615) PDF downloads(525) Cited by(0)

Access History

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return