Related papers: Delaunay Edge Flips in Dense Surface Triangulation…
A triangulation of a surface is irreducible if there is no edge whose contraction produces another triangulation of the surface. In this work we propose an algorithm that constructs the set of irreducible triangulations of any surface with…
The Delaunay filtration $\mathcal{D}_{\bullet}(X)$ of a point cloud $X\subset \mathbb{R}^d$ is a central tool of computational topology. Its use is justified by the topological equivalence of $\mathcal{D}_{\bullet}(X)$ and the offset (i.e.,…
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…
In this paper, we propose a new two-dimensional directional discrete wavelet transform that can decompose an image into 12 multiscale directional edge components. The proposed transform is designed in a fully discrete setting and thus is…
Consider the Delaunay triangulation T of a set P of points in the plane as a Euclidean graph, in which the weight of every edge is its length. It has long been conjectured that the dilation in T of any pair p, p \in P, which is the ratio of…
3D dense reconstruction refers to the process of obtaining the complete shape and texture features of 3D objects from 2D planar images. 3D reconstruction is an important and extensively studied problem, but it is far from being solved. This…
Here we introduce the Delaunay Density Estimator Method. Its purpose is rendering a fully volume-covering reconstruction of a density field from a set of discrete data points sampling this field. Reconstructing density or intensity fields…
Wave groups can be detected and studied by using the wave envelope. So far, the method used to compute the wave envelope employs the Riesz transform. However, such a technique always produces symmetric envelopes, which is only realistic in…
We combine the DPW method and Opening Nodes to construct embedded surfaces of positive constant mean curvature with Delaunay ends in euclidean space, with no limitation to the genus or number of ends.
We derive parametrizations of the Delaunay constant mean curvature surfaces of revolution that follow directly from parametrizations of the conics that generate these surfaces via the corresponding roulette. This uniform treatment exploits…
The main result of this paper is a proof that a nearly flat, acutely triangulated convex cap C in R^3 has an edge-unfolding to a non-overlapping polygon in the plane. A convex cap is the intersection of the surface of a convex polyhedron…
Given a triangulation of a closed surface, we consider a cross ratio system that assigns a complex number to every edge satisfying certain polynomial equations per vertex. Every cross ratio system induces a complex projective structure…
Deformable surface tracking from monocular images is well-known to be under-constrained. Occlusions often make the task even more challenging, and can result in failure if the surface is not sufficiently textured. In this work, we…
Smooth and curved microstructural topologies found in nature - from soap films to trabecular bone - have inspired several mimetic design spaces for architected metamaterials and bio-scaffolds. However, the design approaches so far have been…
This work considers a new task in geometric deep learning: generating a triangulation among a set of points in 3D space. We present PointTriNet, a differentiable and scalable approach enabling point set triangulation as a layer in 3D…
This paper proposes two contributions to the calculation of free surface flows using the particle finite element method (PFEM). The PFEM is based on a Lagrangian approach: a set of particles defines the fluid. Then, unlike a pure Lagrangian…
We study flips in hypertriangulations of planar points sets. Here a level-$k$ hypertriangulation of $n$ points in the planes is a subdivision induced by the projection of a $k$-hypersimplex, which is the convex hull of the barycenters of…
For both triangulations of point sets and simple polygons, it is known that determining the flip distance between two triangulations is an NP-hard problem. To gain more insight into flips of triangulations and to characterize "where edges…
In this work, we propose a Triangle based approach to classify flower images. Initially, flowers are segmented using whorl based region merging segmentation. Skeleton of a flower is obtained from the segmented flower using a skeleton…
In this paper, a new framework for one-dimensional contour extraction from discrete two-dimensional data sets is presented. Contour extraction is important in many scientific fields such as digital image processing, computer vision, pattern…