Results 101 to 110 of about 26,216 (246)

An advancing front Delaunay triangulation algorithm designed for robustness [PDF]

open access: yes
A new algorithm is described for generating an unstructured mesh about an arbitrary two-dimensional configuration. Mesh points are generated automatically by the algorithm in a manner which ensures a smooth variation of elements, and the resulting ...
Mavriplis, D. J.
core   +1 more source

The worst visibility walk in a random Delaunay triangulation is $O(\sqrt{n})$

open access: yesJournal of Computational Geometry, 2016
We show that the memoryless routing algorithms Greedy Walk, Compass Walk, and all variants of visibility walk based on orientation predicates are asymptotically optimal in the average case on the Delaunay triangulation. More specifically, we consider the
Olivier Devillers, Ross Hemsley
doaj   +1 more source

Generalizing CGAL Periodic Delaunay Triangulations

open access: yes, 2020
Even though Delaunay originally introduced his famous triangulations in the case of infinite point sets with translational periodicity, a software that computes such triangulations in the general case is not yet available, to the best of our knowledge.
Osang, Georg   +2 more
openaire   +4 more sources

Delaunay Triangulation and Randomized Constructions [PDF]

open access: yes, 2014
The Delaunay triangulation and the Voronoi diagram are two classic geometric structures in the field of computational geometry. Their success can perhaps be attributed to two main reasons: Firstly, there exist practical, efficient algorithms to construct them; and secondly, they have an enormous number of useful applications ranging from meshing and 3D-
openaire   +2 more sources

Order-2 Delaunay Triangulations Optimize Angles [PDF]

open access: green, 2023
Herbert Edelsbrunner   +2 more
openalex   +1 more source

Adaptive Distance Grid Based Algorithm for Farthest Point Seeding Streamline Placement

open access: yesOpen Computer Science, 2016
Streamlines are commonly used in scientific visualization. They are the most used geometric items in primitive-based visualization algorithms. In this paper, a modified version of the farthest point seeding strategy streamline placement is presented. The
Mebarki Abdelkrim
doaj   +1 more source

Home - About - Disclaimer - Privacy