Related papers: Construction and shape optimization of simplicial …
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices are among the vertices of the polytope. Triangulations are dissections that have the additional property that the set of all its simplices…
This paper proposes a construction of $C^r$ conforming finite element spaces with arbitrary $r$ in any dimension. It is shown that if $k \ge 2^{d}r+1$ the space $\mathcal P_k$ of polynomials of degree $\le k$ can be taken as the shape…
In this paper we develop methods to extend the minimal hypersurface approach to positive scalar curvature problems to all dimensions. This includes a proof of the positive mass theorem in all dimensions without a spin assumption. It also…
In the industrial practice, additive manufacturing processes are often followed by post-processing operations such as subtractive machining, milling, etc. to achieve the desired surface quality and dimensional accuracy. Hence, a given part…
If the four triangular facets of a tetrahedron can be partitioned into pairs having the same area, then the triangles in each pair must be congruent to one another. A Heron-style formula is then derived for the volume of a tetrahedron…
The algorithmic self-assembly of shapes has been considered in several models of self-assembly. For the problem of \emph{shape construction}, we consider an extended version of the Two-Handed Tile Assembly Model (2HAM), which contains…
This work introduces ``generalized meshes", a type of meshes suited for the discretization of partial differential equations in non-regular geometries. Generalized meshes extend regular simplicial meshes by allowing for overlapping elements…
Volume approximation is an important problem found in many applications of computer graphics, vision, and image processing. The problem is about computing an accurate and compact approximate representation of 3D volumes using some simple…
In this paper, we propose a topology optimization (TO) framework where the design is parameterized by a set of convex polygons. Extending feature mapping methods in TO, the representation allows for direct extraction of the geometry. In…
Let $M$ be the interior of a connected, oriented, compact manifold $V$ of dimension at least 2. If each path component of $\partial V$ has amenable fundamental group, then we prove that the simplicial volume of $M$ is equal to the relative…
We compute small rational models for configuration spaces of points on oriented surfaces, as right modules over the framed little disks operad. We do this by splitting these surfaces in unions of several handles. We first describe rational…
Although shape correspondence is a central problem in geometry processing, most methods for this task apply only to two-dimensional surfaces. The neglected task of volumetric correspondence--a natural extension relevant to shapes extracted…
We characterize the entire functions $P$ of $d$ variables, $d\ge 2,$ for which the $\mzd$-translates of $P\chi_{[0,N]^d}$ satisfy the partition of unity for some $N\in \mn.$ In contrast to the one-dimensional case, these entire functions…
Classical jittered sampling partitions $[0,1]^d$ into $m^d$ cubes for a positive integer $m$ and randomly places a point inside each of them, providing a point set of size $N=m^d$ with small discrepancy. The aim of this note is to provide a…
Motivated by the fact that the medial axis transform is able to encode nearly the complete shape, we propose to use as few medial balls as possible to approximate the original enclosed volume by the boundary surface. We progressively select…
This paper presents a new algorithm, Weighted Squared Volume Minimization (WSVM), for generating high-quality tetrahedral meshes from closed triangle meshes. Drawing inspiration from the principle of minimal surfaces that minimize squared…
We construct and study the space C(\R^d,n) of all partitions of \R^d into n non-empty open convex regions (n-partitions). A representation on the upper hemisphere of an n-sphere is used to obtain a metric and thus a topology on this space.…
We introduce Patchwork, a new general-purpose shape representation capable of modeling 2D and 3D geometry with a small number of parameters. Patchwork is grounded in a rigorous mathematical framework, providing provable complexity bounds…
We are generalizing to higher dimensions the Bavard-Ghys construction of the hyperbolic metric on the space of polygons with fixed directions of edges. The space of convex d-dimensional polyhedra with fixed directions of facet normals has a…
This paper proposes the application of some well known two-dimensional geometrical shape descriptors for the visualisation of the structure of architectural open spaces. The paper demonstrates the use of visibility measures such as distance…