Treewidth, crushing, and hyperbolic volume

We prove that there exists a universal constant $c$ such that any closed hyperbolic 3-manifold admits a triangulation of treewidth at most $c$ times its volume. The converse is not true: we show there exists a sequence of hyperbolic 3-manifolds of bounded treewidth but volume approaching infinity. Along the way, we prove that crushing a normal surface in a triangulation does not increase the carving-width, and hence crushing any number of normal surfaces in a triangulation affects treewidth by at most a constant multiple.Comment: 20 pages, 12 figures. V2: Section 4 has been rewritten, as the former argument (in V1) used a construction that relied on a wrong theorem. Section 5.1 has also been adjusted to the new construction. Various other arguments have been clarifie

A unified framework for isotropic meshing based on narrow-band Euclidean distance transformation

In this paper, we propose a simple-yet-effective method for isotropic meshing relying on Euclidean distance transformation based centroidal Voronoi tessellation (CVT). Our approach improves the performance and robustness of computing CVT on curved domains while simultaneously providing high-quality output meshes. While conventional extrinsic methods compute CVTs in the entire volume bounded by the input model, we restrict the computation to a 3D shell of user-controlled thickness. Taking voxels which contain surface samples as sites, we compute the exact Euclidean distance transform on the GPU. Our algorithm is parallel and memory-efficient, and can construct the shell space for resolutions up to 20483 at interactive speed. The 3D centroidal Voronoi tessellation and restricted Voronoi diagrams are also computed efficiently on the GPU. Since the shell space can bridge holes and gaps smaller than a certain tolerance, and tolerate non-manifold edges and degenerate triangles, our algorithm can handle models with such defects, which typically cause conventional remeshing methods to fail. Our method can process implicit surfaces, polyhedral surfaces, and point clouds in a unified framework. Computational results show that our GPU-based isotropic meshing algorithm produces results comparable to state-of- the-art techniques, but is significantly faster than conventional CPU-based implementations.MOE (Min. of Education, S’pore)Published versio

Shape of matchbox manifolds

In this work, we develop shape expansions of minimal matchbox manifolds without holonomy, in terms of branched manifolds formed from their leaves. Our approach is based on the method of coding the holonomy groups for the foliated spaces, to define leafwise regions which are transversely stable and are adapted to the foliation dynamics. Approximations are obtained by collapsing appropriately chosen neighborhoods onto these regions along a "transverse Cantor foliation". The existence of the "transverse Cantor foliation" allows us to generalize standard techniques known for Euclidean and fibered cases to arbitrary matchbox manifolds with Riemannian leaf geometry and without holonomy. The transverse Cantor foliations used here are constructed by purely intrinsic and topological means, as we do not assume that our matchbox manifolds are embedded into a smooth foliated manifold, or a smooth manifold.Comment: 36 pages. Revision of the earlier version: introduction is rewritten. Accepted to a special issue of Indagationes Mathematica

LIPIcs, Volume 258, SoCG 2023, Complete Volume

LIPIcs, Volume 258, SoCG 2023, Complete Volum