Related papers: Numerical computation of triangular complex spheri…
We discuss different approaches for the enumeration of triangulated surfaces. In particular, we enumerate all triangulated surfaces with 9 and 10 vertices. We also show how geometric realizations of orientable surfaces with few vertices can…
We study the curvature of a smooth algebraic surface $X\subset \mathbb R^3$ of degree $d$ from the point of view of algebraic geometry. More precisely, we consider umbilical points and points of critical curvature. We prove that the number…
We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs in polynomial time in the bit-size of the two edge vectors.…
Delsarte-Goethals-Seidel showed that if $X$ is a spherical $t$-design with degree $s$ satisfying $t\geq 2s-2$, $X$ carries the structure of an association scheme. Also Bannai-Bannai showed that the same conclusion holds if $X$ is an…
We describe a simple geometric transformation of triangles which leads to an efficient and effective algorithm to smooth triangle and tetrahedral meshes. Our focus lies on the convergence properties of this algorithm: we prove the…
We prove a correspondence theorem for singular tropical surfaces in real three space, which recovers singular algebraic surfaces in an appropriate toric three-fold that tropicalize to a given singular tropical surface. Furthermore, we…
A method to define the complex structure and separate the conformal mode is proposed for a surface constructed by two-dimensional dynamical triangulation. Applications are made for surfaces coupled to matter fields such as $n$ scalar fields…
This paper deals with a simple and straightforward procedure for automatic generation of finite-element or finite-volume meshes of spheroidal domains, consisting of tetrahedra. Besides the equation of the boundary, the generated meshes…
We consider the sets of dimensions for which there is an optimal sphere packing with special regularity properties (respectively, a lattice, or a periodic set with a given bound on the number of translations, or an arbitrary periodic set).…
It is shown that there exists a dihedral acute triangulation of the three-dimensional cube. The method of constructing the acute triangulation is described, and symmetries of the triangulation are discussed.
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,…
Representing complex shapes with simple primitives in high accuracy is important for a variety of applications in computer graphics and geometry processing. Existing solutions may produce suboptimal samples or are complex to implement. We…
The 3D tree visualization faces multiple challenges: the election of an appropriate layout, the use of the interactions that make the data exploration easier and a metaphor that helps in the process of information understanding. A good…
A suitable measure for the similarity of shapes represented by parameterized curves or surfaces is the Fr\'echet distance. Whereas efficient algorithms are known for computing the Fr\'echet distance of polygonal curves, the same problem for…
The dimension of a block design is the maximum positive integer $d$ such that any $d$ of its points are contained in a proper subdesign. Pairwise balanced designs PBD$(v,K)$ have dimension at least two as long as not all points are on the…
Computational mathematics plays an increasingly important role in computational fluid dynamics (CFD). The aeronautics and aerospace re- search community is working on next generation of CFD capacity that is accurate, automatic, and fast. A…
We give a fast algorithm for computing an irreducible triangulation $T^\prime$ of an oriented, connected, boundaryless, and compact surface $S$ in $E^d$ from any given triangulation $T$ of $S$. If the genus $g$ of $S$ is positive, then our…
Recent microscopy imaging techniques allow to precisely analyze cell morphology in 3D image data. To process the vast amount of image data generated by current digitized imaging techniques, automated approaches are demanded more than ever.…
It is important to have fast and effective methods for simplifying 3-manifold triangulations without losing any topological information. In theory this is difficult: we might need to make a triangulation super-exponentially more complex…
Geometry processing presents a variety of difficult numerical problems, each seeming to require its own tailored solution. This breadth is largely due to the expansive list of geometric primitives, e.g., splines, triangles, and hexahedra,…