Related papers: Algorithms for Deforming and Contracting Simply Co…

In an exploration paper, {\it L. Chen, Algorithms for Deforming and Contracting Simply Connected Discrete Closed Manifolds (I)}, we designed algorithms for deforming and contracting a simply connected discrete closed manifold to a discrete…

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.…

Compressed manifold modes are locally supported analogues of eigenfunctions of the Laplace-Beltrami operator of a manifold. In this paper we describe an algorithm for the calculation of modes for discrete manifolds that, in experiments,…

In this paper we prove that the problem of deciding contractibility of an arbitrary closed curve on the boundary of a 3-manifold is in NP. We emphasize that the manifold and the curve are both inputs to the problem. Moreover, our algorithm…

We give properties of strict pseudocontractions and demicontractions defined on a Hilbert space, which constitute wide classes of operators that arise in iterative methods for solving fixed point problems. In particular, we give necessary…

We study perfect discrete Morse functions on closed oriented n-dimensional manifolds. We show how to compose such functions on connected sums of closed oriented manifolds and how to decompose on connected sums of closed oriented surfaces.

We analyze constrained quantum systems where the dynamics do not preserve the constraints. This is done in particular for the restriction of a quantum particle in Euclidean n-space to a curved submanifold, and we propose a method of…

In order to meet the requirements of practical applications, a model of deforming manifold in the embedded space is proposed. The deforming vector and deforming field are presented to precisely describe the deforming process, which have…

In this paper, we introduce a definition of discrete conformality for triangulated surfaces with flat cone metrics and describe an algorithm for solving the problem of prescribing curvature, that is to deform the metric discrete conformally…

The problem of decomposing non-manifold object has already been studied in solid modeling. However, the few proposed solutions are limited to the problem of decomposing solids described through their boundaries. In this thesis we study the…

Transformations of digital spaces preserving local and global topology play an important role in thinning, skeletonization and simplification of digital images. In the present paper, we introduce and study contractions of simple pair of…

The problem of polycube construction or deformation is an essential problem in computer graphics. In this paper, we present a robust, simple, efficient and automatic algorithm to deform the meshes of arbitrary shapes into their polycube…

We study the discretization of (almost-)Dirac structures using the notion of retraction and discretization maps on manifolds. Additionally, we apply the proposed discretization techniques to obtain numerical integrators for port-Hamiltonian…

The evaluation of partition functions is a central problem in statistical physics. For lattice systems and other discrete models the partition function may be expressed as the contraction of a tensor network. Unfortunately computing such…

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…

Spectral clustering is a fundamental technique in the field of data mining and information processing. Most existing spectral clustering algorithms integrate dimensionality reduction into the clustering process assisted by manifold learning…

In the past decade, we had developed a series of splitting contraction algorithms for separable convex optimization problems, at the root of the alternating direction method of multipliers. Convergence of these algorithms was studied under…

We are concerned with decentralized optimization over a compact submanifold, where the loss functions of local datasets are defined by their respective local datasets. A key challenge in decentralized optimization is mitigating the…

We investigate discrete spin transformations, a geometric framework to manipulate surface meshes by controlling mean curvature. Applications include surface fairing -- flowing a mesh onto say, a reference sphere -- and mesh extrusion --…

We consider the problem of approximating a two-dimensional shape contour (or curve segment) using discrete assembly systems, which allow to build geometric structures based on limited sets of node and edge types subject to edge length and…