Teresa Heiss
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Teresa Heiss has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Alexey Garber
University of Texas Rio Grande Valley, Brownsville, USA
3 shared publications - Morteza Saghafian
Institute of Science and Technology Austria Klosterneuburg Austria
3 shared publications - Herbert Edelsbrunner
ISTA (Institute of Science and Technology Austria), Klosterneuburg, Austria
2 shared publications - Mohadese Ghafari
Khoury College of Computer Science Northeastern University Boston Massachusetts USA
2 shared publications - Adélie Garin
Laboratory for Topology and Neuroscience EPFL Lausanne Switzerland
1 shared publication Alexey Garber
School of Mathematical and Statistical Sciences, University of Texas Rio Grande Valley, Brownsville, TX 78520 USA
1 shared publication
Latest Publications
- 7 June 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 38 (2) , 1784-1807
Brillouin Zones of Integer Lattices and Their Perturbations
For a locally finite set, [Formula: see text], the [Formula: see text] th Brillouin zone of [Formula: see text] is the region of points [Formula: see text] for which [Formula: see text] is the [Formula: see text]th smallest among the Euclidean distances between [Formula: see text] and the points in [Formula: see text]. If [Formula: see text] is a lattice, the [Formula: see text]th Brillouin zones of the points in [Formula: see text] are translates of each other, and together they tile space. Depending on the value of [Formula: see text], they express medium- or long-range order in the set. We study fundamental geometric and combinatorial properties of Brillouin zones, focusing on the integer lattice and its perturbations. Our results include the stability of a Brillouin zone under perturbations, a linear upper bound on the number of chambers in a zone for lattices in [Formula: see text], and the convergence of the maximum volume of a chamber to zero for the integer lattice.
- 7 June 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 38 (2) , 1784-1807
Brillouin Zones of Integer Lattices and Their Perturbations
For a locally finite set, [Formula: see text], the [Formula: see text] th Brillouin zone of [Formula: see text] is the region of points [Formula: see text] for which [Formula: see text] is the [Formula: see text]th smallest among the Euclidean distances between [Formula: see text] and the points in [Formula: see text]. If [Formula: see text] is a lattice, the [Formula: see text]th Brillouin zones of the points in [Formula: see text] are translates of each other, and together they tile space. Depending on the value of [Formula: see text], they express medium- or long-range order in the set. We study fundamental geometric and combinatorial properties of Brillouin zones, focusing on the integer lattice and its perturbations. Our results include the stability of a Brillouin zone under perturbations, a linear upper bound on the number of chambers in a zone for lattices in [Formula: see text], and the convergence of the maximum volume of a chamber to zero for the integer lattice.
- Open Access
Flips in Two-dimensional Hypertriangulations
We study flips in hypertriangulations of planar points sets. Here a level-$k$ hypertriangulation of $n$ points in the planes is a subdivision induced by the projection of a $k$-hypersimplex, which is the convex hull of the barycenters of the $(k-1)$-dimensional faces of the standard $(n-1)$-simplex. In particular, we introduce four types of flips and prove that the level-2 hypertriangulations are connected by these flips.Open AccessFlips in Two-dimensional Hypertriangulations
We study flips in hypertriangulations of planar points sets. Here a level-$k$ hypertriangulation of $n$ points in the planes is a subdivision induced by the projection of a $k$-hypersimplex, which is the convex hull of the barycenters of the $(k-1)$-dimensional faces of the standard $(n-1)$-simplex. In particular, we introduce four types of flips and prove that the level-2 hypertriangulations are connected by these flips. - Open Access
Brillouin Zones of Integer Lattices and Their Perturbations
For a locally finite set, $A \subseteq \mathbb{R}^d$, the $k$-th Brillouin zone of $a \in A$ is the region of points $x \in \mathbb{R}^d$ for which $\|x-a\|$ is the $k$-th smallest among the Euclidean distances between $x$ and the points in $A$. If $A$ is a lattice, the $k$-th Brillouin zones of the points in $A$ are translates of each other, which tile space. Depending on the value of $k$, they express medium- or long-range order in the set. We study fundamental geometric and combinatorial properties of Brillouin zones, focusing on the integer lattice and its perturbations. Our results include the stability of a Brillouin zone under perturbations, a linear upper bound on the number of chambers in a zone for lattices in $\mathbb{R}^2$, and the convergence of the maximum volume of a chamber to zero for the integer lattice.Open AccessBrillouin Zones of Integer Lattices and Their Perturbations
For a locally finite set, $A \subseteq \mathbb{R}^d$, the $k$-th Brillouin zone of $a \in A$ is the region of points $x \in \mathbb{R}^d$ for which $\|x-a\|$ is the $k$-th smallest among the Euclidean distances between $x$ and the points in $A$. If $A$ is a lattice, the $k$-th Brillouin zones of the points in $A$ are translates of each other, which tile space. Depending on the value of $k$, they express medium- or long-range order in the set. We study fundamental geometric and combinatorial properties of Brillouin zones, focusing on the integer lattice and its perturbations. Our results include the stability of a Brillouin zone under perturbations, a linear upper bound on the number of chambers in a zone for lattices in $\mathbb{R}^2$, and the convergence of the maximum volume of a chamber to zero for the integer lattice. - Open Access
- 7 September 2023
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 72 (1) , 29-48
On Angles in Higher Order Brillouin Tessellations and Related Tilings in the Plane
For a locally finite set in $${{{\mathbb {R}}}}^2$$ , the order-k Brillouin tessellations form an infinite sequence of convex face-to-face tilings of the plane. If the set is coarsely dense and generic, then the corresponding infinite sequences of minimum and maximum angles are both monotonic in k. As an example, a stationary Poisson point process in $${{{\mathbb {R}}}}^2$$ is locally finite, coarsely dense, and generic with probability one. For such a set, the distributions of angles in the Voronoi tessellations, Delaunay mosaics, and Brillouin tessellations are independent of the order and can be derived from the formula for angles in order-1 Delaunay mosaics given by Miles (Math. Biosci. 6, 85–127 (1970)).- 7 September 2023
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 72 (1) , 29-48
Open AccessOn Angles in Higher Order Brillouin Tessellations and Related Tilings in the Plane
For a locally finite set in $${{{\mathbb {R}}}}^2$$ , the order-k Brillouin tessellations form an infinite sequence of convex face-to-face tilings of the plane. If the set is coarsely dense and generic, then the corresponding infinite sequences of minimum and maximum angles are both monotonic in k. As an example, a stationary Poisson point process in $${{{\mathbb {R}}}}^2$$ is locally finite, coarsely dense, and generic with probability one. For such a set, the distributions of angles in the Voronoi tessellations, Delaunay mosaics, and Brillouin tessellations are independent of the order and can be derived from the formula for angles in order-1 Delaunay mosaics given by Miles (Math. Biosci. 6, 85–127 (1970)). - 27 January 2022
- Published by Springer Nature
- p. 1-26
The Persistent Homology of Dual Digital Image Constructions
- 27 January 2022
- Published by Springer Nature
- p. 1-26
The Persistent Homology of Dual Digital Image Constructions
- Open Access
Streaming Algorithm for Euler Characteristic Curves of Multidimensional Images
We present an efficient algorithm to compute Euler characteristic curves of gray scale images of arbitrary dimension. In various applications the Euler characteristic curve is used as a descriptor of an image. Our algorithm is the first streaming algorithm for Euler characteristic curves. The usage of streaming removes the necessity to store the entire image in RAM. Experiments show that our implementation handles terabyte scale images on commodity hardware. Due to lock-free parallelism, it scales well with the number of processor cores. Our software---CHUNKYEuler---is available as open source on Bitbucket. Additionally, we put the concept of the Euler characteristic curve in the wider context of computational topology. In particular, we explain the connection with persistence diagrams.
Open AccessStreaming Algorithm for Euler Characteristic Curves of Multidimensional Images
We present an efficient algorithm to compute Euler characteristic curves of gray scale images of arbitrary dimension. In various applications the Euler characteristic curve is used as a descriptor of an image. Our algorithm is the first streaming algorithm for Euler characteristic curves. The usage of streaming removes the necessity to store the entire image in RAM. Experiments show that our implementation handles terabyte scale images on commodity hardware. Due to lock-free parallelism, it scales well with the number of processor cores. Our software---CHUNKYEuler---is available as open source on Bitbucket. Additionally, we put the concept of the Euler characteristic curve in the wider context of computational topology. In particular, we explain the connection with persistence diagrams.
- 28 July 2017
- Published by Springer Nature
- p. 397-409
Streaming Algorithm for Euler Characteristic Curves of Multidimensional Images
- 28 July 2017
- Published by Springer Nature
- p. 397-409
Streaming Algorithm for Euler Characteristic Curves of Multidimensional Images