English
Related papers

Related papers: Circle Pattern Theorem for Quasi-simplicial Triang…

200 papers

We prove that if $G$ is the graph of a connected triangulated $(d-1)$-manifold, for $d\geq 3$, then $G$ is generically globally rigid in $\mathbb R^d$ if and only if it is $(d+1)$-connected and, if $d=3$, $G$ is not planar. The special case…

Combinatorics · Mathematics 2024-09-26 James Cruickshank , Bill Jackson , Shin-ichi Tanigawa

We provide an alternative, simpler proof of the existence of thick triangulations for noncompact $\mathcal{C}^1$ manifolds. Moreover, this proof is simpler than the original one given in \cite{pe}, since it mainly uses tools of elementary…

Geometric Topology · Mathematics 2010-05-12 Emil Saucan , Meir Katchalski

In the given paper the algorithm describing original and universal principles of a triangulation of a smooth molecular surface: solvent excluding solvent (SES), received by primary and secondary rolling, and solvent accessible surface (SAS)…

Chemical Physics · Physics 2013-03-19 Oleg Kupervasser , N. E. Wanner

We define discrete constant mean curvature (cmc) surfaces in the three-dimensional Euclidean and Lorentz spaces in terms of sphere packings with orthogonally intersecting circles. These discrete cmc surfaces can be constructed from…

Differential Geometry · Mathematics 2024-10-14 Alexander I. Bobenko , Tim Hoffmann , Nina Smeenk

In this paper we present methods for triangulation of infinite cylinders from image line silhouettes. We show numerically that linear estimation of a general quadric surface is inherently a badly posed problem. Instead we propose to…

Computer Vision and Pattern Recognition · Computer Science 2022-12-06 Anna Gummeson , Magnus Oskarsson

Solving a long-standing open question in convex geometry, we will show that typical convex surfaces contain points of infinite curvature in all tangent directions. To prove this, we use an easy curvature definition imitating the idea of…

Metric Geometry · Mathematics 2011-09-13 Karim Adiprasito

We show that given an infinite triangulation $K$ of a surface with punctures (i.e., with no vertices at the punctures) and a set of target cone angles smaller than $\pi$ at the punctures that satisfy a Gauss-Bonnet inequality, there exists…

Geometric Topology · Mathematics 2024-12-31 Philip L. Bowers , Lorenzo Ruffoni

In a recent paper, {\it Algorithms for Deforming and Contracting Simply Connected Discrete Closed Manifolds (II)}, we discussed two algorithms for deforming and contracting a simply connected discrete closed manifold into a discrete sphere.…

Geometric Topology · Mathematics 2020-02-12 Li Chen

A model of simplicial quantum gravity in three dimensions(3D) was investigated numerically based on the technique of dynamical triangulation (DT). We are concerned with the genus of surfaces appearing on boundaries (i.e., sections) of a 3D…

High Energy Physics - Lattice · Physics 2009-10-30 H. S. Egawa , N. Tsuda

We show that, without any extra physical degree introduced, the Standard Model can be readily reformulated as a Double Field Theory. Consequently, the Standard Model can couple to an arbitrary stringy gravitational background in an…

High Energy Physics - Theory · Physics 2015-10-26 Kang-Sin Choi , Jeong-Hyuck Park

It was shown by Fock, Goncharov and Fomin, Shapiro, Thurston that some cluster algebras arise from triangulated orientable suraces. Subsequently Dupont and Palesi generalised this construction to include unpunctured non-orientable surfaces,…

Combinatorics · Mathematics 2018-02-21 Jon Wilson

We introduce the concept of pseudo-trisections of smooth oriented compact 4-manifolds with boundary. The main feature of pseudo-trisections is that they have lower complexity than relative trisections for given 4-manifolds. We prove…

Geometric Topology · Mathematics 2025-02-19 Shintaro Fushida-Hardy

In this paper, we introduce a new discretization of the Gaussian curvature on surfaces, which is defined as the quotient of the angle defect and the area of some dual cell of a weighted triangulation at the conic singularity. A discrete…

Differential Geometry · Mathematics 2023-09-12 Xu Xu , Chao Zheng

Two planar embedded circle patterns with the same combinatorics and the same intersection angles can be considered to define a discrete conformal map. We show that two locally finite circle patterns covering the unit disc are related by a…

Complex Variables · Mathematics 2020-02-26 Ulrike Bücking

We investigate a PL topology question: which circle bundles can be triangulated over a given triangulation of the base? The question got a simple answer emphasizing the role of minimal triangulations encoded by local systems of circular…

Geometric Topology · Mathematics 2019-08-28 Nikolai Mnëv

We consider a new type of mappings in metric spaces which can be characterized as mappings contracting perimeters of triangles. It is shown that such mappings are continuous. The fixed-point theorem for such mappings is proved and the…

General Topology · Mathematics 2023-08-03 Evgeniy Petrov

We adapt the method of Simon [JDG '93] to prove a $C^{1,\alpha}$-regularity theorem for minimal varifolds which resemble a cone $\bf{C}_0^2$ over an equiangular geodesic net. For varifold classes admitting a "no-hole" condition on the…

Differential Geometry · Mathematics 2017-09-29 Maria Colombo , Nick Edelen , Luca Spolaor

Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many heuristics have been proposed to partition models into few…

Computational Geometry · Computer Science 2007-05-23 M. Gopi , David Eppstein

We characterize constant mean curvature surfaces in the three-dimensional Heisenberg group by a family of flat connections on the trivial bundle $\D \times \GL$ over a simply connected domain $\mathbb{D}$ in the complex plane. In particular…

Differential Geometry · Mathematics 2015-01-26 Josef F. Dorfmeister , Jun-ichi Inoguchi , Shimpei Kobayashi

This extended abstract is about an effort to build a formal description of a triangulation algorithm starting with a naive description of the algorithm where triangles, edges, and triangulations are simply given as sets and the most complex…

Logic in Computer Science · Computer Science 2018-09-05 Yves Bertot