Related papers: When alpha-complexes collapse onto codimension-1 s…
This work presents a range of triangulated characterizations for important classes of singularities such as derived splinters, rational singularities, and Du Bois singularities. An invariant called 'level' in a triangulated category can be…
This paper gives sharp linear bounds on the genus of a normal surface in a triangulated compact, orientable 3--manifold in terms of the quadrilaterals in its cell decomposition---different bounds arise from varying hypotheses on the surface…
In this paper we show that many sequential randomized incremental algorithms are in fact parallel. We consider algorithms for several problems including Delaunay triangulation, linear programming, closest pair, smallest enclosing disk,…
Approximate convex decomposition aims to decompose a 3D shape into a set of almost convex components, whose convex hulls can then be used to represent the input shape. It thus enables efficient geometry processing algorithms specifically…
Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…
Traditional 3D shape reconstruction techniques from multi-view images, such as structure from motion and multi-view stereo, face challenges in reconstructing transparent objects. Recent advances in neural radiance fields and its variants…
This paper develops an algorithm that identifies and decomposes a median graph of a triangulation of a 2-dimensional (2D) oriented bordered surface and in addition restores all corresponding triangulation whenever they exist. The algorithm…
The construction of anisotropic triangulations is desirable for various applications, such as the numerical solving of partial differential equations and the representation of surfaces in graphics. To solve this notoriously difficult…
We show that the traditional criterion for a simplex to belong to the Delaunay triangulation of a point set is equivalent to a criterion which is a priori weaker. The argument is quite general; as well as the classical Euclidean case, it…
Segmentation of overlapping convex objects has various applications, for example, in nanoparticles and cell imaging. Often the segmentation method has to rely purely on edges between the background and foreground making the analyzed images…
This paper aims to investigate the distributed stochastic optimization problems on compact embedded submanifolds (in the Euclidean space) for multi-agent network systems. To address the manifold structure, we propose a distributed…
We study the problem of approximating a surface $F$ in $R^3$ by a high quality mesh, a piecewise-flat triangulated surface whose triangles are as close as possible to equilateral. The MidNormal algorithm generates a triangular mesh that is…
We present a practical algorithm to test whether a 3-manifold given by a triangulation or an ideal triangulation contains a closed essential surface. This property has important theoretical and algorithmic consequences. As a testament to…
Bayesian neural networks (BNNs) provide a formalism to quantify and calibrate uncertainty in deep learning. Current inference approaches for BNNs often resort to few-sample estimation for scalability, which can harm predictive performance,…
When three-dimensional bodies contain thin features, non-trivial topology, or scan-derived surfaces, volumetric meshing can become the dominant bottleneck in simulation workflows. We replace this step with a learned geometric…
We study the complexity of smoothed agnostic learning, recently introduced by~\cite{CKKMS24}, in which the learner competes with the best classifier in a target class under slight Gaussian perturbations of the inputs. Specifically, we focus…
We propose a template-driven triangulation framework that embeds raster- or segmentation-derived boundaries into a regular triangular grid for stable PDE discretization on image-derived domains. Unlike constrained Delaunay triangulation…
Could elementary complex analysis, which covers the topics such as algebra of complex numbers, elementary complex functions, complex differentiation and integration, series expansions of complex functions, residues and singularities, and…
This paper begins with a class of convex quadratic programs (QPs) with bounded variables solvable by the parametric principal pivoting algorithm with $\mathcal{O}(n^3)$ strongly polynomial complexity, where $n$ is the number of variables of…
We show that if a closed $C^1$-smooth surface in a Riemannian manifold has bounded Kolasinski--Menger energy, then it can be triangulated with triangles whose number is bounded by the energy and the area. Each of the triangles is an image…