Related papers: Enumeration and random realization of triangulated…
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,…
We survey some results on real rational surfaces focused on their topology and their birational geometry.
Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…
We provide a self-contained introduction to random matrices. While some applications are mentioned, our main emphasis is on three different approaches to random matrix models: the Coulomb gas method and its interpretation in terms of…
In this expository paper, we present a survey about the history of the geometrization conjecture and the background material on the classification of Thurston's eight geometries. We also discuss recent techniques for immersive visualization…
For a given pair of numbers $(d,k)$, we establish the minimal number of vertices in pure $d$-dimensional simplicial complexes with non-trivial homology in dimension $k$. Furthermore, we solve the problem under the additional constraint of…
We study the enumeration of bargraphs with respect to some corner statistics. We find generating functions for the number of bargraphs that tracks the corner statistics of interest, the number of cells, and the number of columns. The…
In this paper, we study the computation of curvatures at the singular points of algebraic curves and surfaces. The idea is to convert the problem to compute the curvatures of the corresponding regular parametric curves and surfaces, which…
Computing the number of realizations of a minimally rigid graph is a notoriously difficult problem. Towards this goal, for graphs that are minimally rigid in the plane, we take advantage of a recently published algorithm, which is the…
The symmetries of surfaces which can be embedded into the symmetries of the 3-dimensional Euclidean space $\mathbb{R}^3$ are easier to feel by human's intuition. We give the maximum order of finite group actions on $(\mathbb{R}^3, \Sigma)$…
The ideal (tagged resp.) triangulation of bounded surface with marked points are associated with skew-symmetric (skew-symmetrizable) exchange matrices. An algo- rithm is established to decompose the graph associated to such matrix. There…
This paper introduces even triangulations of n-dimensional pseudo-manifolds and links their combinatorics to the topology of the pseudo-manifolds. This is done via normal hypersurface theory and the study of certain symmetric…
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.…
3-manifolds are commonly represented as triangulations, consisting of abstract tetrahedra whose triangular faces are identified in pairs. The combinatorial sparsity of a triangulation, as measured by the treewidth of its dual graph, plays a…
All families of sextic surfaces with the maximal number of isolated triple points are found.
We investigate geometric properties of surfaces given by certain formulae. In particular, we calculate the singular curvature and the limiting normal curvature of such surfaces along the set of singular points consisting of singular points…
We describe the topology of singular real algebraic curves in a smooth surface. We enumerate and bound in terms of the degree the number of topological types of singular algebraic curves in the real projective plane.
We give coordinate-minimal geometric realizations in general position for 17 of the 20 vertex-minimal triangulations of the orientable surface of genus 3 in the 5x5x5-cube.
An efficient algorithm to enumerate the vertices of a two-dimensional (2D) projection of a polytope, is presented in this paper. The proposed algorithm uses the support function of the polytope to be projected and enumerated for vertices.…
This is a survey of known algorithms in algebraic topology with a focus on finite simplicial complexes and, in particular, simplicial manifolds. Wherever possible an elementary approach is chosen. This way the text may also serve as a…