Related papers: Construction and shape optimization of simplicial …
We employ Maxwell's equations formulated in Space-Time Algebra to perform discretization of moving geometries directly in space-time. All the derivations are carried out without any non-relativistic assumptions, thus the application area of…
We propose a method for constructing generative models of 3D objects from a single 3D mesh and improving them through unsupervised low-shot learning from 2D images. Our method produces a 3D morphable model that represents shape and albedo…
We say that a pure simplicial complex ${\mathbf K}$ of dimension $d$ satisfies the removal-collapsibility condition if ${\mathbf K}$ is either empty or ${\mathbf K}$ becomes collapsible after removing $\tilde \beta_d ({\mathbf K}; {\mathbb…
Three dimensional (3D) topology optimization problems always involve huge numbers of Degrees of Freedom (DOFs) in finite element analysis (FEA) and design variables in numerical optimization, respectively. This will inevitably lead to large…
Two important classes of three-dimensional elements in computational meshes are hexahedra and tetrahedra. While several efficient methods exist that convert a hexahedral element to a tetrahedral elements, the existing algorithm for…
The zero level set of a piecewise-affine function with respect to a consistent tetrahedral subdivision of a domain in $\mathbb{R}^3$ is a piecewise-planar hyper-surface. We prove that if a family of consistent tetrahedral subdivions…
We decompose each moduli space of semistable sheaves on the complex projective plane with support of dimension one and degree four into locally closed subvarieties, each subvariety being the good or geometric quotient of a set of morphisms…
The differential-geometric structure of the manifold of smooth shapes is applied to the theory of shape optimization problems. In particular, a Riemannian shape gradient with respect to the first Sobolev metric and the Steklov-Poincar\'{e}…
Simplicial complexes form an important class of topological spaces that are frequently used in many application areas such as computer-aided design, computer graphics, and simulation. Representation learning on graphs, which are just 1-d…
Single-image 3D shape reconstruction is an important and long-standing problem in computer vision. A plethora of existing works is constantly pushing the state-of-the-art performance in the deep learning era. However, there remains a much…
It is proven that the partition function of 3-dimensional simplicial gravity has an exponential upper bound with the following assumption: any three dimensional sphere $S^3$ is constructed by repeated identification of neighboring links and…
Simplification is one of the fundamental operations used in geoinformation science (GIS) to reduce size or representation complexity of geometric objects. Although different simplification methods can be applied depending on one's purpose,…
Shape optimization based on the shape calculus is numerically mostly performed by means of steepest descent methods. This paper provides a novel framework to analyze shape-Newton optimization methods by exploiting a Riemannian perspective.…
We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n halfspaces, with the property that the highest dimension of any bounded face is much smaller than D. We show that, if d is the maximum…
The d-Segal conditions of Dyckerhoff and Kapranov are exactness properties for simplicial objects based on the geometry of cyclic polytopes in d-dimensional Euclidean space. 2-Segal spaces are also known as decomposition spaces, and most…
In this article, we study the dimension of the spline space of di-degree $(d,d)$ with the highest order of smoothness over a hierarchical T-mesh $\mathscr T$ using the smoothing cofactor-conformality method. Firstly, we obtain a dimensional…
We learn a self-supervised, single-view 3D reconstruction model that predicts the 3D mesh shape, texture and camera pose of a target object with a collection of 2D images and silhouettes. The proposed method does not necessitate 3D…
Many time-dependent problems in the field of computational fluid dynamics can be solved using space-time methods. However, such methods can encounter issues with computational cost and robustness. In order to address these issues,…
A well-known conjecture of Simon (1994) states that any pure $d$-dimensional shellable complex on $n$ vertices can be extended to $\Delta_{n-1}^{(d)}$, the $d$-skeleton of the $(n-1)$-dimensional simplex, by attaching one facet at a time…
This paper is concerned with inserting three-dimensional computer-aided design (CAD) geometries into meshes composed of hexahedral elements using a volume fraction representation. An adaptive procedure for doing so is presented. The…