An efficient sweep-line Delaunay triangulation algorithm

alik, Borut

doi:10.1016/j.cad.2004.10.004

Cited by 34 publications

(30 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The sweep-line algorithm was also used to construct a Voronoi diagram, i.e., dual Delaunay triangulation [39]. The Delaunay algorithm examined in this study is based on the plane-scattered point sets used by Žalik [35] and Zhou [40].…”

Section: Plane-sweep Techniquesmentioning

confidence: 99%

“…According to a previous analysis [35], the relationship between CPU time spent and the number of entries into the hash-table h changes according to the value of k. If k is too small or too large, the computational time will be significantly altered. The k was set to 100 for these experiments in accordance to previous literature [35].…”

Section: Preprints (Wwwpreprintsorg) | Not Peer-reviewed | Posted: mentioning

confidence: 99%

“…The k was set to 100 for these experiments in accordance to previous literature [35]. During the sweeping phase, each point was projected onto the frontier, where it reached the frontier in a time period calculated as follows:…”

Section: Preprints (Wwwpreprintsorg) | Not Peer-reviewed | Posted: mentioning

confidence: 99%

“…We used the fastest SL algorithm according to the literature [35]. The experimental results suggested that ASC is more efficient than AUTOCLUST (Table 3).…”

Section: Cpu Time Spent For Clusteringmentioning

confidence: 99%

See 3 more Smart Citations

An Adaptive Sweep-Circle Spatial Clustering Algorithm Based on Gestalt

Zhan¹,

Deng²,

Zheng³

2017

Preprint

View full text Add to dashboard Cite

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 clusters. The proposed algorithm can automatically discover clusters in one pass, rather than through the modification of the initial model (for example, a minimal spanning tree, Delaunay triangulation or Voronoi diagram). It can quickly identify arbitrarily-shaped clusters while adapting efficiently to non-homogeneous density characteristics of spatial data, without the need of prior knowledge or parameters. The proposed algorithm is also ideal for use in data streaming technology with dynamic characteristics flowing in the form of spatial clustering in large data sets.

show abstract

Section: Plane-sweep Techniquesmentioning

confidence: 99%

Section: Preprints (Wwwpreprintsorg) | Not Peer-reviewed | Posted: mentioning

confidence: 99%

Section: Preprints (Wwwpreprintsorg) | Not Peer-reviewed | Posted: mentioning

confidence: 99%

“…We used the fastest SL algorithm according to the literature [35]. The experimental results suggested that ASC is more efficient than AUTOCLUST (Table 3).…”

Section: Cpu Time Spent For Clusteringmentioning

confidence: 99%

See 2 more Smart Citations

An Adaptive Sweep-Circle Spatial Clustering Algorithm Based on Gestalt

Zhan¹,

Deng²,

Zheng³

2017

Preprint

View full text Add to dashboard Cite

show abstract

“…Bowyer-Watson algorithm (Bowyer 1981;Watson 1981) just takes advantage of the in-circle criterion. In recent years, Delaunay triangulation algorithm has attracted many research scholars because of its excellent flexibility and extensibility (Žalik 2005;Ebeida et al 2011). Therefore, this paper adopts Delaunay triangulation method to generate triangular meshes, which are used as the background grid to create quadrilateral meshes.…”

Section: Introductionmentioning

confidence: 99%

An Automatic Method for Complete Triangular Mesh Conversion into Quadrilateral Mesh for Multiple Domain Geometry

Sun

Yeh²,

Lin

et al. 2016

Terr. Atmos. Ocean. Sci.

View full text Add to dashboard Cite

This research developed an automatic two-dimensional finite element meshing system to resolve practical engineering problems in the fields of geology, hydrology, and water resources. This system first used the Delaunay triangulation method to create reasonable-density triangular mesh and then converted it into quadrilateral mesh by combining proper pairs of adjacent triangles. A series of combination patterns aiming at three cases were established. The effect of the number of boundary edges on the subsequent meshing procedures were studied and summarized. For the geometry with multiple domains an adjustment method is proposed to completely eliminate the residual triangles during quadrilateral meshing through adjusting the number of boundary edges in each loop to be even. A special boundary loop identification method is proposed for priority treatment. Corresponding treatment methods aimed at three different situations are established for common boundary loops. For a certain boundary loop with an odd number of boundary edges, the appropriate edge for new point insertion is determined by the position properties and relative density errors. Practical applications confirm that the method proposed in this paper could successfully implement the full conversion from the triangular mesh to the quadrilateral mesh.

show abstract

Tessellation

Phillips

2014

WIREs Computational Stats

View full text Add to dashboard Cite

This article provides a brief introduction to the definition, properties, and use of Voronoi diagrams, including the special cases of the Poisson-Voronoi and centroidal Voronoi diagrams. It highlights applications to problems in spatial statistics, probability, and large-scale simultaneous hypothesis testing. Generalizations of the Voronoi diagram and computational considerations are also discussed. These diagrams have been widely used in the fields of statistics, mathematics, computational geometry, and various applied sciences, making them an important topic of study.

show abstract

An efficient sweep-line Delaunay triangulation algorithm

Cited by 34 publications

References 13 publications

An Adaptive Sweep-Circle Spatial Clustering Algorithm Based on Gestalt

An Adaptive Sweep-Circle Spatial Clustering Algorithm Based on Gestalt

An Automatic Method for Complete Triangular Mesh Conversion into Quadrilateral Mesh for Multiple Domain Geometry

Tessellation

Contact Info

Product

Resources

About