A faster circle-sweep Delaunay triangulation algorithm

@article{Biniaz2012AFC,
  title={A faster circle-sweep Delaunay triangulation algorithm},
  author={Ahmad Biniaz and Gholamhossein Dastghaibyfard},
  journal={Adv. Eng. Softw.},
  year={2012},
  volume={43},
  pages={1-13}
}
New triangulation method for surface scattered points
Triangulations for surface scattered points are used in the field of three-dimensional reconstruction widely. In order to reconstruct surface fast and efficiently, a combination triangulation
The Design of Weldment Model Based on Improved Delaunay Triangulation Algorithm
TLDR
By using Delaunay triangulation algorithm, triangulating with split-merge algorithm and the incremental insertion algorithm, and with the corresponding improvement of the LOP optimization algorithm, the design of weldment model in the virtual welding system has achieved good result.
Delaunay Triangulation of a missing points
Surface reconstruction of scattered data points is one of the challenging area where the main purpose is to produce a smooth surface. In this research, Delaunay triangulation method was used to
A New Hand Shape Recognition Algorithm Based on Delaunay Triangulation
TLDR
This paper proposes to form a more robust and non-parametric finger central axis extraction algorithm, by using a Delaunay triangulation algorithm, and shows that this robust algorithm achieves the recognition rate of 99.89% on the authors' database, while the mean time of feature extraction is 0.09 s.
Recursive average triangulation modeling algorithm for bounded noise system
TLDR
A novel recursive average triangulation modeling algorithm is proposed for the unknown but bounded noise systems where the noise signal at each recursive step is warped in a strip with the hyperplanes obtained by the samples of input and output signals.
Tessellation
TLDR
Applications to problems in spatial statistics, probability, and large‐scale simultaneous hypothesis testing are highlighted, including the special cases of the Poisson–Voronoi and centroidal Voronoi diagrams.
Alignment of 3-D scanning data for polygonal mesh based on modified triangulation
TLDR
The outcome of the study shows effective reconstruction with legit triangulation, less computation time for determining convex hull and a smoothed polygon through proper edge flipping.
An Adaptive Sweep-Circle Spatial Clustering Algorithm Based on Gestalt
An adaptive spatial clustering (ASC) algorithm is proposed in this present study, which employs sweep-circle techniques and a dynamic threshold setting based on the Gestalt theory to detect spatial
Simulation of Two-Dimensional Random Structure Through Inversely Generated Delaunay Subgraphs
Subgraphs taken from Delaunay triangulations are used as a basis for the representation of spacing in twodimensional random structure. Stochastic simulations are presented in which Delaunay
Enhancing clearing-based niching method using Delaunay Triangulation
TLDR
Delaunay Triangulation based Clearing (DT-Clearing) procedure is proposed to handle multi-modal optimizations more efficiently while preserving simplicity of canonical clearing approach, and obtains promising results in comparison with the canonical clearing and demonstrates to be a competitive niching algorithm.
...
1
2
3
...

References

SHOWING 1-10 OF 46 REFERENCES
Two algorithms for constructing a Delaunay triangulation
  • D. Lee, B. Schachter
  • Computer Science
    International Journal of Computer & Information Sciences
  • 2004
TLDR
This paper provides a unified discussion of the Delaunay triangulation and two algorithms are presented for constructing the triangulations over a planar set ofN points.
A Comparison of Plane Sweep Delaunay Triangulation Algorithms
TLDR
This paper presents a survey as well as a new sweep-circle algorithm, on plane sweep algorithms for computing the Delaunay triangulation, and test implementations of these algorithms on a number of uniform and none-uniform distributed sites.
An efficient sweep-line Delaunay triangulation algorithm
Higher order Delaunay triangulations
Delaunay triangulation and the convex hull ofn points in expected linear time
TLDR
An algorithm is presented which produces a Delaunay triangulation ofn points in the Euclidean plane in expected linear time and treats most of the non-uniform distributions.
Randomized incremental construction of Delaunay and Voronoi diagrams
TLDR
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.
A faster divide-and-conquer algorithm for constructing delaunay triangulations
  • R. Dwyer
  • Computer Science
    Algorithmica
  • 2005
TLDR
An easily implemented modification to the divide-and-conquer algorithm for computing the Delaunay triangulation of sites in the plane reduces its expected running time toO(n log logn) for a large class of distributions that includes the uniform distribution in the unit square.
A sweepline algorithm for Voronoi diagrams
TLDR
A geometric transformation is introduced that allows Voronoi diagrams to be computed using a sweepline technique and is used to obtain simple algorithms for computing the Vor onoi diagram of point sites, of line segment sites, and of weighted point sites.
An incremental construction algorithm for Delaunay triangulation using the nearest-point paradigm
TLDR
The proposed algorithm is the second fastest except for input points with highly non-uniform distribution, which represents an attractive alternative to other Delaunay triangulation algorithms used in practice.
A comparison of sequential Delaunay triangulation algorithms
TLDR
An experimental comparison of a number of different algorithms for computing the Deluanay triangulation and analyzes the major high-level primitives that algorithms use and does an experimental analysis of how often implementations of these algorithms perform each operation.
...
1
2
3
4
5
...