Related papers: Numerical computation of triangular complex spheri…
In this paper we find asymptotic equalities for the discrete logarithmic energy of sequences of well separated spherical $t$-designs on the unit sphere ${\mathbb{S}^{d}\subset\mathbb{R}^{d+1}}$, $d\geq2$. Also we establish exact order…
In this contribution, we present evidence for the occurrence of triangular symmetry in cluster nuclei. We discuss the structure of rotational bands for 3-alpha and 3-alpha+1 configurations with triangular D(3h) symmetry by exploiting the…
We derive formulas for the number of polycubes of size $n$ and perimeter $t$ that are proper in $n-1$ and $n-2$ dimensions. These formulas complement computer based enumerations of perimeter polynomials in percolation problems. We…
There are many applications in which a bounding sphere containing the given triangle E3 is needed, e.g. fast collision detection, ray-triangle intersecting in raytracing etc. This is a typical geometrical problem in E3 and it has also…
We embark in a program of studying the problem of better approximating surfaces by triangulations(triangular meshes) by considering the approximating triangulations as finite metric spaces and the target smooth surface as their…
Hypergraphs, which use hyperedges to capture groupwise interactions among different entities, have gained increasing attention recently for their versatility in effectively modeling real-world networks. In this paper, we study the problem…
We initiate the study of computing diverse triangulations to a given polygon. Given a simple $n$-gon $P$, an integer $ k \geq 2 $, a quality measure $\sigma$ on the set of triangulations of $P$ and a factor $ \alpha \geq 1 $, we formulate…
We present a scalable combinatorial algorithm for globally optimizing over the space of geometrically consistent mappings between 3D shapes. We use the mathematically elegant formalism proposed by Windheuser et al. (ICCV 2011) where 3D…
We construct a structure preserving non-conforming finite element approximation scheme for the bi-harmonic wave maps into spheres equation. It satisfies a discrete energy law and preserves the non-convex sphere constraint of the continuous…
We describe a smooth structure, called Fr\"olicher space, on CW complexes and spaces of triangulations. This structure enables differential methods for e.g. minimization of functionnals. As an application, we exhibit how an optimized…
We study the simplicial volume of manifolds obtained from Davis' reflection group trick, the goal being characterizing those having positive simplicial volume. In particular, we focus on checking whether manifolds in this class with nonzero…
Geometric rounding of a mesh is the task of approximating its vertex coordinates by floating point numbers while preserving mesh structure. Geometric rounding allows algorithms of computational geometry to interface with numerical…
We introduce a novel representation and optimization framework for discrete geodesics on triangle meshes that reduces artifacts of linear methods on uneven and coarse discretizations. Our method computes squared geodesic distances from…
A small polygon is a polygon of unit diameter. The maximal area of a small polygon with $n=2m$ vertices is not known when $m\ge 7$. Finding the largest small $n$-gon for a given number $n\ge 3$ can be formulated as a nonconvex quadratically…
The computation of the effect of a simple monodromy defect in the case of a sphere with twisted boundary conditions is revisited and streamlined using earlier calculations for a similar system. Compact and explicit expressions are found for…
This paper presents an efficient approach for the conceptual design of architectural surfaces which are composed of triangular panels. In the free-form design of discrete architectural surfaces, the Gaussian curvature plays an important…
This is a preliminary note on a family of minimal surfaces in the 3-sphere defined by a compatible fourth order equation. The minimal surfaces are geometrically characterized either by having a surface of revolution like induced metric, or…
Computing spherical harmonic decompositions is a ubiquitous technique that arises in a wide variety of disciplines and a large number of scientific codes. Because spherical harmonics are defined by integrals over spheres, however, one must…
This article proposes a new discrete framework for approximating solutions to shape optimization problems under convexity constraints. The numerical method, based on the support function or the gauge function, is guaranteed to generate…
Cubature formulas and geometrical designs are described in terms of reproducing kernels for Hilbert spaces of functions on the one hand, and Markov operators associated to orthogonal group representations on the other hand. In this way,…