Related papers: Affine invariant triangulations
This paper introduces invariant transforms that preserve the ratio of either two or three co-linear points in the Desargues affine plane skew field. The results given here have a clean, geometric presentation based based Desargues affine…
The Delaunay triangulation (DT) is one of the most common and useful triangulations of point sets $P$ in the plane. DT is not unique when $P$ is degenerate, specifically when it contains quadruples of co-circular points. One way to achieve…
We introduce an (equi-)affine invariant diffusion geometry by which surfaces that go through squeeze and shear transformations can still be properly analyzed. The definition of an affine invariant metric enables us to construct an invariant…
In this paper, we develop new affine-invariant algorithms for solving composite convex minimization problems with bounded domain. We present a general framework of Contracting-Point methods, which solve at each iteration an auxiliary…
Delaunay flip is an elegant, simple tool to convert a triangulation of a point set to its Delaunay triangulation. The technique has been researched extensively for full dimensional triangulations of point sets. However, an important case of…
An extension of the restricted Delaunay-refinement algorithm for surface mesh generation is described, where a new point-placement scheme is introduced to improve element quality in the presence of mesh size constraints. Specifically, it is…
We investigate algorithms with predictions in computational geometry, specifically focusing on the basic problem of computing 2D Delaunay triangulations. Given a set $P$ of $n$ points in the plane and a triangulation $G$ that serves as a…
This paper introduces advances in the geometry of the transforms for cross ratio of four points in a line in the Desargues affine plane. The results given here have a clean, based Desargues affine plan axiomatic's and definitions of…
Via circle pattern techniques, random planar triangulations (with angle variables) are mapped onto Delaunay triangulations in the complex plane. The uniform measure on triangulations is mapped onto a conformally invariant spatial point…
Natural objects can be subject to various transformations yet still preserve properties that we refer to as invariants. Here, we use definitions of affine invariant arclength for surfaces in R^3 in order to extend the set of existing…
An affine invariant point on the class of convex bodies in R^n, endowed with the Hausdorff metric, is a continuous map p which is invariant under one-to-one affine transformations A on R^n, that is, p(A(K))=A(p(K)). We define here the new…
We consider the problem of maintaining the Euclidean Delaunay triangulation $\DT$ of a set $P$ of $n$ moving points in the plane, along algebraic trajectories of constant description complexity. Since the best known upper bound on the…
Dense random sampling and surfacing of shapes encoded via implicit occupancy functions (OFs) are critical elements of many applications. Existing methods largely provide either one or the other of random sampling or mesh surfaces: ray…
It is important that a spatial network's construction algorithm reproduces the structural properties of the original physical embedding. Here, we assess the Delaunay triangulation as a spatial network construction algorithm for seven…
In this paper, we present a novel affine-invariant feature based on SIFT, leveraging the regular appearance of man-made objects. The feature achieves full affine invariance without needing to simulate over affine parameter space. Low-rank…
Affine transformation is one of the most common transformations in nature, which is an important issue in the field of computer vision and shape analysis. And affine transformations often occur in both shape and color space simultaneously,…
Two-dimensional Delaunay triangulation is a fundamental aspect of computational geometry. This paper presents a novel algorithm that is specifically designed to ensure the correctness of 2D Delaunay triangulation, namely the Polygonal…
Rotation-invariant recognition of shapes is a common challenge in computer vision. Recent approaches have significantly improved the accuracy of rotation-invariant recognition by encoding the rotational invariance of shapes as hand-crafted…
Let $P$ be a set of $n$ points in $\mathrm{R}^2$, and let $\mathrm{DT}(P)$ denote its Euclidean Delaunay triangulation. We introduce the notion of an edge of $\mathrm{DT}(P)$ being {\it stable}. Defined in terms of a parameter $\alpha>0$, a…
Image feature points are detected as pixels which locally maximize a detector function, two commonly used examples of which are the (Euclidean) image gradient and the Harris-Stephens corner detector. A major limitation of these feature…