Related papers: Higher signature Delaunay decompositions
This paper constructs a family of constant mean curvature immersions of the thrice-punctured Riemann sphere into Euclidean 3-space with asymptotically Delaunay ends via loop group methods.
In this paper we study singular riemannian foliations that have sections,i.e., totally geodesic complete immersed submanifolds that meet each leaf orthogonally and whose dimensions are the codimensions of the regular leaves. We prove here…
This paper is devoted to the construction of order reduced method of fourth order problems. A framework is presented such that a problem on a high-regularity space can be deduced in a constructive way to an equivalent problem on three…
In this paper, a new framework for one-dimensional contour extraction from discrete two-dimensional data sets is presented. Contour extraction is important in many scientific fields such as digital image processing, computer vision, pattern…
A path decomposition of a graph G is a collection of edge-disjoint paths of G that covers the edge set of G. Gallai (1968) conjectured that every connected graph on n vertices admits a path decomposition of cardinality at most (n+1)/2.…
We provide the full classification of equidistant decomposition of a two-dimensional Euclidean plane and a two-dimensional sphere.
Reconstructing building wireframe from airborne LiDAR point clouds yields a compact, topology-centric representation that enables structural understanding beyond dense meshes. Yet a key limitation persists: conventional methods have failed…
This article describes a natural piecewise Euclidean bi-simplicial cell structure for the space of $n$-element multisets in a fixed Euclidean rectangle. In particular, we highlight some connections with spaces of complex polynomials and…
A new family of decagonal quasiperiodic tilings are constructed by the use of generalized point substitution processes, which is a new substitution formalism developed by the author [N. Fujita, Acta Cryst. A 65, 342 (2009)]. These tilings…
A complete characterization is given of the possible macroscopic deformations of periodic nonlinear affine unimode metamaterials constructed from rigid bars and pivots. The materials are affine in the sense that their macroscopic…
This paper describes a generalization of decomposition in orbifolds. In general terms, decomposition states that two-dimensional orbifolds and gauge theories whose gauge groups have trivially-acting subgroups decompose into disjoint unions…
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…
In this paper we introduce the notion of an Open Non-uniform Cylindrical Algebraic Decomposition (NuCAD), and present an efficient model-based algorithm for constructing an Open NuCAD from an input formula. A NuCAD is a generalization of…
Higher-dimensional rewriting is founded on a duality of rewrite systems and cell complexes, connecting computational mathematics to higher categories and homotopy theory: the two sides of a rewrite rule are two halves of the boundary of an…
We investigate a cancellation property satisfied by a connected Eulerian digraph $D$. Namely, unless $D$ is a single directed cycle, we have $\sum_{k\geq 1} (-1)^{k} f_k(D)=0$, where $f_k(D)$ is the number of partitions of Eulerian circuits…
In this paper we consider the PDE system of vanishing normal projection of the Laplacian for $C^2$ maps $u : \mathbb{R}^n \supseteq \Omega \longrightarrow \mathbb{R}^N$: \[ [\![\mathrm{D} u]\!]^\bot \Delta u = 0 \ \, \text{ in }\Omega. \]…
Let $B_{x}\subseteq\mathbb{R}^{n}$ denote the Euclidean ball with diameter $[0,x]$, i.e. with with center at $\frac{x}{2}$ and radius $\frac{\left|x\right|}{2}$. We call such a ball a petal. A flower $F$ is any union of petals, i.e.…
We look at generalized Delaunay graphs in the constrained setting by introducing line segments which the edges of the graph are not allowed to cross. Given an arbitrary convex shape $C$, a constrained Delaunay graph is constructed by adding…
This paper studies a generalization of the standard continuous-time consensus protocol, obtained by replacing the Laplacian matrix of the communication graph with the so-called deformed Laplacian. The deformed Laplacian is a second-degree…
A decomposition of a multigraph $G$ is a partition of its edges into subgraphs $G(1), \ldots , G(k)$. It is called an $r$-factorization if every $G(i)$ is $r$-regular and spanning. If $G$ is a subgraph of $H$, a decomposition of $G$ is said…