Results 1 to 10 of about 456 (184)
Blocking Delaunay triangulations. [PDF]
Given a set B of n black points in general position, we say that a set of white points W blocks B if in the Delaunay triangulation of [Formula: see text] there is no edge connecting two black points. We give the following bounds for the size of the smallest set W blocking B: (i) [Formula: see text] white points are always sufficient to block a set of n
Aichholzer O +6 more
europepmc +5 more sources
Inherently Disordered Auxetic Metamaterials [PDF]
Inherently disordered auxetic systems represent a new class of metamaterial structures, which have the capability of exhibiting advanced functionalities despite the absence of global symmetry and ordered localized periodicity.
Matteo Montanari +3 more
doaj +2 more sources
Detection of DIAG and LINE Patterns in PassPoints Graphical Passwords Based on the Maximum Angles of Their Delaunay Triangles [PDF]
An alternative authentication method to traditional alphanumeric passwords is graphical password authentication, also known as graphical authentication, for which one of the most valuable cued-recall techniques is PassPoints.
Lisset Suárez-Plasencia +4 more
doaj +2 more sources
The Stretch Factor of Hexagon-Delaunay Triangulations
The problem of computing the exact stretch factor (i.e., the tight bound on the worst case stretch factor) of a Delaunay triangulation is one of the longstanding open problems in computational geometry. Over the years, a series of upper and lower bounds
Ljubomir Perkovic +2 more
doaj +1 more source
A short proof of the toughness of Delaunay triangulations
We present a self-contained short proof of the seminal result of Dillencourt (SoCG 1987 and DCG 1990) that Delaunay triangulations, of planar point sets in general position, are 1-tough.
Ahmad Biniaz
doaj +1 more source
THE STABILITY OF DELAUNAY TRIANGULATIONS [PDF]
We introduce a parametrized notion of genericity for Delaunay triangulations which, in particular, implies that the Delaunay simplices of δ-generic point sets are thick. Equipped with this notion, we study the stability of Delaunay triangulations under perturbations of the metric and of the vertex positions.
JEAN-DANIEL BOISSONNAT +2 more
openaire +5 more sources
Delaunay Triangulation of Manifolds [PDF]
We present an algorithm for producing Delaunay triangulations of manifolds. The algorithm can accommodate abstract manifolds that are not presented as submanifolds of Euclidean space. Given a set of sample points and an atlas on a compact manifold, a manifold Delaunay complex is produced provided the transition functions are bi-Lipschitz with a ...
Jean-Daniel Boissonnat +2 more
openaire +5 more sources
PROVABLY CONSISTENT DISTRIBUTED DELAUNAY TRIANGULATION [PDF]
This paper deals with the distributed computation of Delaunay triangulations of massive point sets, mainly motivated by the needs of a scalable out-of-core surface reconstruction workflow from massive urban LIDAR datasets.
M. Brédif +3 more
doaj +1 more source
Many neighborly inscribed polytopes and Delaunay triangulations [PDF]
We present a very simple explicit technique to generate a large family of point configurations with neighborly Delaunay triangulations. This proves that there are superexponentially many combinatorially distinct neighborly $d$-polytopes with $n$ vertices
Bernd Gonska, Arnau Padrol
doaj +1 more source
DECOMPOSING IMAGES INTO TRIANGLES BY DELAUNAY POINT PROCESSES [PDF]
We propose a method for decomposing images into triangles. Contrary to superpixel methods, our output representation both preserves the geometric information disseminated in input images, and has an attractive storage capacity.
D. Chai
doaj +1 more source

