Henry Segerman
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Henry Segerman has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Craig D. Hodgson
School of Mathematics and Statistics, The University of Melbourne, Parkville, Victoria 3010, Australia
2 shared publications - Joachim Hyam Rubinstein
School of Mathematics and Statistics, University of Melbourne, Parkville, Australia
2 shared publications - Saul Schleimer
University of Warwick, Coventry, UK
2 shared publications - Stephan Tillmann
School of Mathematics and Statistics F07, The University of Sydney, Sydney, Australia
2 shared publications - Ahmad Issa
Department of Mathematics, The University of Texas at Austin, Austin, TX, USA
1 shared publication - Benjamin A. Burton
School of Mathematics and Physics, The University of Queensland, Brisbane, Australia
1 shared publication
Latest Publications
- Open Access
Cohomology fractals, Cannon-Thurston maps, and the geodesic flow
Cohomology fractals are images naturally associated to cohomology classes in hyperbolic three-manifolds. We generate these images for cusped, incomplete, and closed hyperbolic three-manifolds in real-time by ray-tracing to a fixed visual radius. We discovered cohomology fractals while attempting to illustrate Cannon-Thurston maps without using vector graphics; we prove a correspondence between these two, when the cohomology class is dual to a fibration. This allows us to verify our implementations by comparing our images of cohomology fractals to existing pictures of Cannon-Thurston maps. In a sequence of experiments, we explore the limiting behaviour of cohomology fractals as the visual radius increases. Motivated by these experiments, we prove that the values of the cohomology fractals are normally distributed, but with diverging standard deviations. In fact, the cohomology fractals do not converge to a function in the limit. Instead, we show that the limit is a distribution on the sphere at infinity, only depending on the manifold and cohomology class.
Open AccessCohomology fractals, Cannon-Thurston maps, and the geodesic flow
Cohomology fractals are images naturally associated to cohomology classes in hyperbolic three-manifolds. We generate these images for cusped, incomplete, and closed hyperbolic three-manifolds in real-time by ray-tracing to a fixed visual radius. We discovered cohomology fractals while attempting to illustrate Cannon-Thurston maps without using vector graphics; we prove a correspondence between these two, when the cohomology class is dual to a fibration. This allows us to verify our implementations by comparing our images of cohomology fractals to existing pictures of Cannon-Thurston maps. In a sequence of experiments, we explore the limiting behaviour of cohomology fractals as the visual radius increases. Motivated by these experiments, we prove that the values of the cohomology fractals are normally distributed, but with diverging standard deviations. In fact, the cohomology fractals do not converge to a function in the limit. Instead, we show that the limit is a distribution on the sphere at infinity, only depending on the manifold and cohomology class.
- Open Access
Essential loops in taut ideal triangulations
In this note we combinatorialise a technique of Novikov. We use this to prove that, in a three-manifold equipped with a taut ideal triangulation, any vertical or normal loop is essential in the fundamental group.
Open AccessEssential loops in taut ideal triangulations
In this note we combinatorialise a technique of Novikov. We use this to prove that, in a three-manifold equipped with a taut ideal triangulation, any vertical or normal loop is essential in the fundamental group.
- Open Access
Traversing three-manifold triangulations and spines
A celebrated result concerning triangulations of a given closed 3-manifold is that any two triangulations with the same number of vertices are connected by a sequence of so-called 2-3 and 3-2 moves. A similar result is known for ideal triangulations of topologically finite non-compact 3-manifolds. These results build on classical work that goes back to Alexander, Newman, Moise, and Pachner. The key special case of 1-vertex triangulations of closed 3-manifolds was independently proven by Matveev and Piergallini. The general result for closed 3-manifolds can be found in work of Benedetti and Petronio, and Amendola gives a proof for topologically finite non-compact 3-manifolds. These results (and their proofs) are phrased in the dual language of spines. The purpose of this note is threefold. We wish to popularise Amendola's result; we give a combined proof for both closed and non-compact manifolds that emphasises the dual viewpoints of triangulations and spines; and we give a proof replacing a key general position argument due to Matveev with a more combinatorial argument inspired by the theory of subdivisions.
Open AccessTraversing three-manifold triangulations and spines
A celebrated result concerning triangulations of a given closed 3-manifold is that any two triangulations with the same number of vertices are connected by a sequence of so-called 2-3 and 3-2 moves. A similar result is known for ideal triangulations of topologically finite non-compact 3-manifolds. These results build on classical work that goes back to Alexander, Newman, Moise, and Pachner. The key special case of 1-vertex triangulations of closed 3-manifolds was independently proven by Matveev and Piergallini. The general result for closed 3-manifolds can be found in work of Benedetti and Petronio, and Amendola gives a proof for topologically finite non-compact 3-manifolds. These results (and their proofs) are phrased in the dual language of spines. The purpose of this note is threefold. We wish to popularise Amendola's result; we give a combined proof for both closed and non-compact manifolds that emphasises the dual viewpoints of triangulations and spines; and we give a proof replacing a key general position argument due to Matveev with a more combinatorial argument inspired by the theory of subdivisions.
- Open Access
Visualizing Hyperbolic Honeycombs
We explore visual representations of tilings corresponding to Schl\"afli symbols. In three dimensions, we call these tilings "honeycombs". Schl\"afli symbols encode, in a very efficient way, regular tilings of spherical, euclidean and hyperbolic spaces in all dimensions. In three dimensions, there are only a finite number of spherical and euclidean honeycombs, but infinitely many hyperbolic honeycombs. Moreover, there are only four hyperbolic honeycombs with material vertices and material cells (the cells are entirely inside of hyperbolic space), eleven with ideal vertices or cells (the cells touch the boundary of hyperbolic space in some way), and all others have either hyperideal vertices or hyperideal cells (the cells go outside of the boundary of hyperbolic space in some way). We develop strategies for visualizing honeycombs in all of these categories, either via rendered images or 3D prints. High resolution images are available at hyperbolichoneycombs.org.
Open AccessVisualizing Hyperbolic Honeycombs
We explore visual representations of tilings corresponding to Schl\"afli symbols. In three dimensions, we call these tilings "honeycombs". Schl\"afli symbols encode, in a very efficient way, regular tilings of spherical, euclidean and hyperbolic spaces in all dimensions. In three dimensions, there are only a finite number of spherical and euclidean honeycombs, but infinitely many hyperbolic honeycombs. Moreover, there are only four hyperbolic honeycombs with material vertices and material cells (the cells are entirely inside of hyperbolic space), eleven with ideal vertices or cells (the cells touch the boundary of hyperbolic space in some way), and all others have either hyperideal vertices or hyperideal cells (the cells go outside of the boundary of hyperbolic space in some way). We develop strategies for visualizing honeycombs in all of these categories, either via rendered images or 3D prints. High resolution images are available at hyperbolichoneycombs.org.
- Open Access
Triangulations of 3-manifolds with essential edges
We define essential and strongly essential triangulations of 3-manifolds, and give four constructions using different tools (Heegaard splittings, hierarchies of Haken 3-manifolds, Epstein-Penner decompositions, and cut loci of Riemannian manifolds) to obtain triangulations with these properties under various hypotheses on the topology or geometry of the manifold. We also show that a semi-angle structure is a sufficient condition for a triangulation of a 3-manifold to be essential, and a strict angle structure is a sufficient condition for a triangulation to be strongly essential. Moreover, algorithms to test whether a triangulation of a 3-manifold is essential or strongly essential are given.
Open AccessTriangulations of 3-manifolds with essential edges
We define essential and strongly essential triangulations of 3-manifolds, and give four constructions using different tools (Heegaard splittings, hierarchies of Haken 3-manifolds, Epstein-Penner decompositions, and cut loci of Riemannian manifolds) to obtain triangulations with these properties under various hypotheses on the topology or geometry of the manifold. We also show that a semi-angle structure is a sufficient condition for a triangulation of a 3-manifold to be essential, and a strict angle structure is a sufficient condition for a triangulation to be strongly essential. Moreover, algorithms to test whether a triangulation of a 3-manifold is essential or strongly essential are given.
- Open Access
Non-geometric veering triangulations
Recently, Ian Agol introduced a class of "veering" ideal triangulations for mapping tori of pseudo-Anosov homeomorphisms of surfaces punctured along the singular points. These triangulations have very special combinatorial properties, and Agol asked if these are "geometric", i.e. realised in the complete hyperbolic metric with all tetrahedra positively oriented. This paper describes a computer program Veering, building on the program Trains by Toby Hall, for generating these triangulations starting from a description of the homeomorphism as a product of Dehn twists. Using this we obtain the first examples of non-geometric veering triangulations; the smallest example we have found is a triangulation with 13 tetrahedra.
Open AccessNon-geometric veering triangulations
Recently, Ian Agol introduced a class of "veering" ideal triangulations for mapping tori of pseudo-Anosov homeomorphisms of surfaces punctured along the singular points. These triangulations have very special combinatorial properties, and Agol asked if these are "geometric", i.e. realised in the complete hyperbolic metric with all tetrahedra positively oriented. This paper describes a computer program Veering, building on the program Trains by Toby Hall, for generating these triangulations starting from a description of the homeomorphism as a product of Dehn twists. Using this we obtain the first examples of non-geometric veering triangulations; the smallest example we have found is a triangulation with 13 tetrahedra.
- Open Access
Collection of abstracts of the Workshop on Triangulations in Geometry and Topology at CG Week 2014 in Kyoto
This workshop about triangulations of manifolds in computational geometry and topology was held at the 2014 CG-Week in Kyoto, Japan. It focussed on computational and combinatorial questions regarding triangulations, with the goal of bringing together researchers working on various aspects of triangulations and of fostering a closer collaboration within the computational geometry and topology community. Triangulations are highly suitable for computations due to their clear combinatorial structure. As a consequence, they have been successfully employed in discrete algorithms to solve purely theoretical problems in a broad variety of mathematical research areas (knot theory, polytope theory, 2- and 3-manifold topology, geometry, and others). However, due to the large variety of applications, requirements vary from field to field and thus different types of triangulations, different tools, and different frameworks are used in different areas of research. This is why today closely related research areas are sometimes largely disjoint leaving potential reciprocal benefits unused. To address these potentials a workshop on Triangulations was held at Oberwolfach Research Institute in 2012. Since then many new collaborations between researchers of different mathematical communities have been established. Regarding the computational geometry community, the theory of manifolds continues to contribute to advances in more applied areas of the field. Many researchers are interested in fundamental mathematical research about triangulations and thus will benefit from a broad set of knowledge about different research areas using different techniques. We hope that this workshop brought together researchers from many different fields of computational geometry to have fruitful discussions which will lead to new interdisciplinary collaborations and solutions.
Open AccessCollection of abstracts of the Workshop on Triangulations in Geometry and Topology at CG Week 2014 in Kyoto
This workshop about triangulations of manifolds in computational geometry and topology was held at the 2014 CG-Week in Kyoto, Japan. It focussed on computational and combinatorial questions regarding triangulations, with the goal of bringing together researchers working on various aspects of triangulations and of fostering a closer collaboration within the computational geometry and topology community. Triangulations are highly suitable for computations due to their clear combinatorial structure. As a consequence, they have been successfully employed in discrete algorithms to solve purely theoretical problems in a broad variety of mathematical research areas (knot theory, polytope theory, 2- and 3-manifold topology, geometry, and others). However, due to the large variety of applications, requirements vary from field to field and thus different types of triangulations, different tools, and different frameworks are used in different areas of research. This is why today closely related research areas are sometimes largely disjoint leaving potential reciprocal benefits unused. To address these potentials a workshop on Triangulations was held at Oberwolfach Research Institute in 2012. Since then many new collaborations between researchers of different mathematical communities have been established. Regarding the computational geometry community, the theory of manifolds continues to contribute to advances in more applied areas of the field. Many researchers are interested in fundamental mathematical research about triangulations and thus will benefit from a broad set of knowledge about different research areas using different techniques. We hope that this workshop brought together researchers from many different fields of computational geometry to have fruitful discussions which will lead to new interdisciplinary collaborations and solutions.
- 17 December 2013
- Published by Taylor & Francis in Journal of Mathematics and the Arts
- Vol. 7 (3-4) , 103-121
Developing fractal curves
Many fractal curves can be produced as the limit of a sequence of polygonal curves, where the curves are generated via an iterative process, for example, an L-system. One can visualize such a sequence of curves as an animation that steps through the sequence. A small part of the curve at one step of the iteration is close to a corresponding part of the curve at the previous step, and so it is natural to add frames to our animation that continuously interpolate between the curves of the iteration. We introduce sculptural forms based on replacing the time dimension of such an animation with a space dimension, producing a surface. The distances between the steps of the sequence are scaled exponentially, so that self-similarity of the set of polygonal curves is reflected in self-similarity of the surface. For surfaces based on the constructions of certain fractal curves, the approximating polygonal curves self-intersect, which means that the resulting surface would also self-intersect. To fix this we smooth the polygonal curves. We outline and compare two different approaches to producing and smoothing the geometry of such a ‘developing fractal curve’ surface, one based on using Bézier splines and the other based on Loop subdivision of a coarse polygonal control mesh.
- 17 December 2013
- Published by Taylor & Francis in Journal of Mathematics and the Arts
- Vol. 7 (3-4) , 103-121
Developing fractal curves
Many fractal curves can be produced as the limit of a sequence of polygonal curves, where the curves are generated via an iterative process, for example, an L-system. One can visualize such a sequence of curves as an animation that steps through the sequence. A small part of the curve at one step of the iteration is close to a corresponding part of the curve at the previous step, and so it is natural to add frames to our animation that continuously interpolate between the curves of the iteration. We introduce sculptural forms based on replacing the time dimension of such an animation with a space dimension, producing a surface. The distances between the steps of the sequence are scaled exponentially, so that self-similarity of the set of polygonal curves is reflected in self-similarity of the surface. For surfaces based on the constructions of certain fractal curves, the approximating polygonal curves self-intersect, which means that the resulting surface would also self-intersect. To fix this we smooth the polygonal curves. We outline and compare two different approaches to producing and smoothing the geometry of such a ‘developing fractal curve’ surface, one based on using Bézier splines and the other based on Loop subdivision of a coarse polygonal control mesh.