• Corpus ID: 15878846

Delaunay Triangulation Algorithm and Application to Terrain Generation

  title={Delaunay Triangulation Algorithm and Application to Terrain Generation},
  author={Faniry H. Razafindrazaka},
We describe a randomized incremental algorithm for computing the Delaunay triangulation of a set of points and a recent technique of applying it to terrain generation. The algorithm is optimal, using a Directed Acyclic Graph (DAG)-based location structure for the incremental insertion which achieves an expected running time of O(n log n) and O(n) expected storage. The analysis of the expected storage is simplified, and the algorithm is implemented and tested. The implementation is done, in its… 
Representation of spatial proximity for various spatial data using Geometric methods
This paper is proposing Delaunay triangulation approach to model the neighbourhood between the objects and eliminates the parameters from the user to define the neighbourhood of objects and avoid multiple test and trail repetitions in the process of mining.
Feature-based multi-resolution topography
This thesis proposes two methods to carry out the generalization of distinct spatial features with respect to the geometry of terrain and employs the Global Indexing Grid (GIG) as an indexing and paging mechanism.
Spatial Clustering Algorithm Based on Neighboring Structure Approach
The experiments show that the performance of the proposed clustering method has promising results such that clusters based on neighbor structure could approximate arbitrary shape of object very well.
Contribution à la reconstruction de surfaces complexes à partir d'un grand flot de données non organisées pour la métrologie 3D.
Les surfaces complexes ont des applications dans divers domaines tels que ceux de la photonique, de l'energie, du biomedical, du transport... Par contre, elles posent de veritables defis quant a leur


Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams
Two algorithms are given, one that constructs the Voronoi diagram of the given sites, and another that inserts a new site in O(n) time, based on the use of the Vor onoi dual, the Delaunay triangulation, and are simple enough to be of practical value.
Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations
The proposed procedure finds the query point by simply “walking through” the triangulation, after selecting a “good starting point” by random sampling, and generalizes and extends a recent result for dD 2 dimensions by proving this procedure takes expected time close to O.
Randomized incremental construction of Delaunay and Voronoi diagrams
A new randomized incremental algorithm for the construction of planar Voronoi diagrams and Delaunay triangulations is given that takes expected timeO(nℝgn) and spaceO( n), and is eminently practical to implement.
The Delaunay Hierarchy
  • O. Devillers
  • Computer Science
    Int. J. Found. Comput. Sci.
  • 2002
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small memory occupation and
Towards Dynamic Randomized Algorithms in Computational Geometry
  • M. Teillaud
  • Computer Science
    Lecture Notes in Computer Science
  • 1993
A very general data structure, the influence graph, is introduced that allows us to construct various geometric structures : Voronoi diagrams, arrangements of line segments...
A sweepline algorithm for Voronoi diagrams
A transformation is used to obtain simple algorithms for computing the Voronoi diagram of point sites, of line segment sites, and of weighted point sites with sweepline technique.
Computational geometry: algorithms and applications
This introduction to computational geometry focuses on algorithms as all techniques are related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems.
Algorithms in Combinatorial Geometry
  • H. Edelsbrunner
  • Mathematics
    EATCS Monographs in Theoretical Computer Science
  • 1987
This book offers a modern approach to computational geo- metry, an area thatstudies the computational complexity of geometric problems with an important role in this study.