Related papers: Delaunay Edge Flips in Dense Surface Triangulation…
We introduce TriSearch, a reinforcement learning framework for optimizing objectives over triangulations of a polytope via bistellar flips. The key idea is a circuit-supported subtriangulation action representation: feasible flips are…
We present two versions of a method for generating all triangulations of any punctured surface in each of these two families: (1) triangulations with inner vertices of degree at least 4 and boundary vertices of degree at least 3 and (2)…
We consider methods of interpolating between the crystalline and dynamically triangulated random surface models. We argue that actions based on the deviation from six of the coordination number at a site are inadequate and propose an…
A new interactive approach to navigate on approximations of in general non-convex but connected Pareto fronts is introduced. Given a finite number of precalculated representative Pareto-efficient solutions, an adapted Delaunay triangulation…
Consider a graph drawn on a surface (for example, the plane minus a finite set of obstacle points), possibly with crossings. We provide an algorithm to decide whether such a drawing can be untangled, namely, if one can slide the vertices…
We present a computational approach for unfolding 3D shapes isometrically into the plane as a single patch without overlapping triangles. This is a hard, sometimes impossible, problem, which existing methods are forced to soften by allowing…
We show that any surface of infinite type admits an ideal triangulation. Furthermore, we show that a set of disjoint arcs can be completed into a triangulation if and only if, as a set, they intersect every simple closed curve a finite…
Metasurfaces have become a promising means for manipulating optical wavefronts in flat and high-performance optical devices. Conventional metasurface device design relies on trial-and-error methods to obtain target electromagnetic (EM)…
Modeling arbitrarily large deformations of surfaces smoothly embedded in three-dimensional space is challenging. The difficulties come from two aspects: the existing geometry processing or forward simulation methods penalize the difference…
In this paper, we propose a novel parameterization method for genus-one and multiply connected genus-zero surfaces, called periodic conformal flattening. The conformal energy minimization technique is utilized to compute the desired…
We construct codimension 1 surfaces of any dimension that minimize a periodic nonlocal perimeter functional among surfaces that are periodic, cylindrically symmetric and decreasing. These surfaces may be seen as a nonlocal analogue of the…
Given a triangulation of a closed orientable surface, we place single-mode resonators or single-orbital artificial atoms at its vertices, edges and facets, and we devise near-neighbor hopping terms derived from the boundary and Poincar\'e…
We study the configuration space of rectangulations and convex subdivisions of $n$ points in the plane. It is shown that a sequence of $O(n\log n)$ elementary flip and rotate operations can transform any rectangulation to any other…
Human faces are one interesting object class with numerous applications. While significant progress has been made in the generic deblurring problem, existing methods are less effective for blurry face images. The success of the…
Given a set of $n$ nonoverlapping circular discs on a plane, we aim to determine possible positions of points (referred to as cameras) that could fully illuminate all the circular discs' boundaries. This work presents a geometric approach…
We propose an approach for 3D reconstruction and segmentation of a single object placed on a flat surface from an input video. Our approach is to perform dense depth map estimation for multiple views using a proposed objective function that…
In this thesis, we use normal surface theory to understand certain properties of minimal triangulations of compact orientable 3-manifolds. We describe the collapsing process of normal 2-spheres and disks. Using some geometrical…
We consider triangulations of closed surfaces S with a given set of vertices V; every triangulation can be branched that is enhanced to a Delta-complex. Branched triangulations are considered up to the b-transit equivalence generated by…
Face Recognition is most used for biometric user authentication that identifies a user based on his or her facial features. The system is in high demand, as it is used by many businesses and employed in many devices such as smartphones and…
We present a new numerical approach that is able to solve the multi-dimensional radiative transfer equations in all opacity regimes on a Lagrangian, unstructured network of characteristics based on a stochastic point process. Our method…