English
Related papers

Related papers: Construction and shape optimization of simplicial …

200 papers

In 1984, Dancis proved that any $d$-dimensional simplicial manifold is determined by its $(\lfloor d/2 \rfloor + 1)$-skeleton. This paper adapts his proof to the setting of cubical complexes that can be embedded into a cube of arbitrary…

Combinatorics · Mathematics 2021-07-08 Rowan Rowlands

Generative models have attracted considerable attention for their ability to produce novel shapes. However, their application in mechanical design remains constrained due to the limited size and variability of available datasets. This study…

Computer Vision and Pattern Recognition · Computer Science 2025-06-17 Yongmin Kwon , Namwoo Kang

Shells, i.e., objects made of a thin layer of material following a surface, are among the most common structures in use. They are highly efficient, in terms of material required to maintain strength, but also prone to deformation and…

Graphics · Computer Science 2019-04-30 Francisca Gil-Ureta , Nico Pietroni , Denis Zorin

For the classical N-body problem, an approach is proposed based on the introduction of some natural in the physical sense optimization problems of mathematical programming for finding a conditional minimum for the characteristics of the…

Dynamical Systems · Mathematics 2023-07-26 Igor Pavlov

With advances in technology, there has been growing interest in developing effective mapping methods for 3-dimensional objects in recent years. Volumetric parameterization for 3D solid manifolds plays an important role in processing 3D…

Computational Geometry · Computer Science 2025-06-23 Zhiyuan Lyu , Qiguang Chen , Gary P. T. Choi , Lok Ming Lui

The maximally complicated arbitrary-dimensional "maximal" Galileon field equations simplify dramatically for symmetric configurations. Thus, spherical symmetry reduces the equations from the D- to the two-dimensional Monge-Ampere equation,…

General Relativity and Quantum Cosmology · Physics 2012-08-24 S. Deser , J. Franklin

3D printing of surfaces has become an established method for prototyping and visualisation. However, surfaces often contain certain degenerations, such as self-intersecting faces or non-manifold parts, which pose problems in obtaining a 3D…

Computational Geometry · Computer Science 2024-05-28 Christian Amend , Tom Goertzen

This is the first paper in a series on new higher categorical structures called higher Segal spaces. For every d > 0, we introduce the notion of a d-Segal space which is a simplicial space satisfying locality conditions related to…

Algebraic Topology · Mathematics 2021-06-01 Tobias Dyckerhoff , Mikhail Kapranov

In \cite{as}, Alfeld and Schumaker give a formula for the dimension of the space of piecewise polynomial functions (splines) of degree $d$ and smoothness $r$ on a generic triangulation of a planar simplicial complex $\Delta$ (for $d \ge…

Numerical Analysis · Mathematics 2007-05-23 Stefan Ovidiu Tohaneanu

We present a new model which represents data as a mixture of simplices. Simplices are geometric structures that generalize triangles. We give a simple geometric understanding that allows us to learn a simplicial structure efficiently. Our…

Computer Vision and Pattern Recognition · Computer Science 2014-12-15 Chunyu Wang , John Flynn , Yizhou Wang , Alan L. Yuille

The signed volume function for polyhedra can be generalized to a mean volume function for volume elements by averaging over the triangulations of the underlying polyhedron. If we consider these up to translation and scaling, the resulting…

Geometric Topology · Mathematics 2014-01-31 Dimitris Vartziotis , Benjamin Himpel

Multilevel self-assembly involving small structured groups of nano-particles provides new routes to development of functional materials with a sophisticated architecture. Apart from the inter-particle forces, the geometrical shapes and…

Physics and Society · Physics 2017-11-15 Milovan Suvakov , Miroslav Andjelkovic , Bosiljka Tadic

Some sufficient conditions on a simplicial space $X$ guaranteeing that $X_1\simeq \Omega|X|$ were given by Segal. We give a generalization of this result for multisimplicial spaces. This generalization is appropriate for the reduced bar…

Algebraic Topology · Mathematics 2015-04-14 Zoran Petric

We consider causal 3-dimensional triangulations with the topology of $S^2\times [0,1]$ or $D^2\times [0,1]$ where $S^2$ and $D^2$ are the two-dimensional sphere and disc, respectively. These triangulations consist of slices and we show that…

Mathematical Physics · Physics 2021-01-29 Bergfinnur Durhuus , Thordur Jonsson

In this paper we present a mixed projection- and density-based topology optimization approach. The aim is to combine the benefits of both parametrizations: the explicit geometric representation provides specific controls on certain design…

Computational Engineering, Finance, and Science · Computer Science 2019-10-09 Nicolò Pollini , Oded Amir

A completely well-centered tetrahedral mesh is a triangulation of a three dimensional domain in which every tetrahedron and every triangle contains its circumcenter in its interior. Such meshes have applications in scientific computing and…

Computational Geometry · Computer Science 2008-08-06 Evan VanderZee , Anil N. Hirani , Damrong Guoy

We investigate the question of whether any $d$-colorable simplicial $d$-polytope can be octahedralized, i.e., it can be subdivided to a $d$-dimensional geometric cross-polytopal complex. We give a positive answer in dimension $3$, with the…

Combinatorics · Mathematics 2019-12-19 Giulia Codenotti , Lorenzo Venturello

Existing methods for 3D face reconstruction from a few casually captured images employ deep learning based models along with a 3D Morphable Model(3DMM) as face geometry prior. Structure From Motion(SFM), followed by Multi-View Stereo (MVS),…

Computer Vision and Pattern Recognition · Computer Science 2023-08-29 Raja Kumar , Jiahao Luo , Alex Pang , James Davis

Let K be a simplicial complex with vertex set V = {v_1,..., v_n}. The complex K is d-representable if there is a collection {C_1,...,C_n} of convex sets in R^d such that a subcollection {C_{i_1},...,C_{i_j}} has a nonempty intersection if…

Combinatorics · Mathematics 2011-07-07 Martin Tancer

We prove that if a pure simplicial complex of dimension d with n facets has the least possible number of (d-1)-dimensional faces among all complexes with n faces of dimension d, then it is vertex decomposable. This answers a question of J.…

Combinatorics · Mathematics 2013-02-19 Michał Lasoń