Related papers: Blocking of Dynamical Triangulations with Matter
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…
In \emph{Guo et al, arXiv:2005.08288}, we propose a decoupled form of the structure-preserving doubling algorithm (dSDA). The method decouples the original two to four coupled recursions, enabling it to solve large-scale algebraic Riccati…
A discrete system constituted of particles interacting by means of a centroid-based law is numerically investigated. The elements of the system move in the plane, and the range of the interaction can be varied from a more local form…
A method to define the complex structure and separate the conformal mode is proposed for a surface constructed by two-dimensional dynamical triangulation. Applications are made for surfaces coupled to matter fields such as $n$ scalar fields…
Two methods to decompose block matrices analogous to Singular Matrix Decomposition are proposed, one yielding the so called economy decomposition, and other yielding the full decomposition. This method is devised to avoid handling matrices…
The complex structure of a surface generated by the two-dimensional dynamical triangulation(DT) is determined by measuring the resistivity of the surface. It is found that surfaces coupled to matter fields have well-defined complex…
Even though the traditional dynamical decoupling methods have the ability to resist dynamic dephasing caused by low frequency noise, they are not appropriate for suppressing the residual geometric dephasing, which arises from the…
We propose a neural network-based approach for collision detection with deformable objects. Unlike previous approaches based on bounding volume hierarchies, our neural approach does not require an update of the spatial data structure when…
This paper presents decentralized algorithms for formation control of multiple robots in three dimensions. Specifically, we leverage the mathematical properties of cyclic pursuit along with results from contraction and partial contraction…
A block decomposition method is proposed for minimizing a (possibly non-convex) continuously differentiable function subject to one linear equality constraint and simple bounds on the variables. The proposed method iteratively selects a…
Multi-block grids provide the computational efficiency of structured grids and the flexibility for complex geometry. Thus, Multi-block structured grids are widely used for field simulation on complex domains. In this paper we propose a…
In this report, we try to improve the performance of existing approaches for search operations in multi-robot context. We propose three novel algorithms that are using a triangular grid pattern, i.e., robots certainly go through the…
Triangle meshes remain the most popular data representation for surface geometry. This ubiquitous representation is essentially a hybrid one that decouples continuous vertex locations from the discrete topological triangulation.…
A discretisation scheme that preserves topological features of a physical problem is extended so that differential geometric structures can be approximated in a consistent way thus giving access to the study of physical systems which are…
This paper uses clustering algorithms to introduce a shape framework for deformable objects. Until now, the shape detection of the deformable objects has faced several challenges: 1) unable to form a unified framework for multiple shapes;…
We propose a one-dimensional, nonconvex elastic constitutive model with higher gradients that can predict spontaneous fracture at a critical load via a bifurcation analysis. It overcomes the problem of discontinuous deformations without…
The structure-preserving doubling algorithm (SDA) is a fairly efficient method for solving problems closely related to Hamiltonian (or Hamiltonian-like) matrices, such as computing the required solutions to algebraic Riccati equations.…
This text presents the proofs of the technical facts underlying theoretical justification of the convergence and performance of the novel algorithm for reactive navigation of differential drive wheeled robots in dynamic uncertain…
The topologies of existing interface elements used to discretize cohesive cracks are such that they can be used to compute the relative displacements (displacement discontinuities) of two opposing segments (in 2D) or of two opposing facets…
One of the least studied universal deformations of incompressible nonlinear elasticity, namely the straightening of a sector of a circular cylinder into a rectangular block, is revisited here and, in particular, issues of existence and…