2002
DOI: 10.1016/s0198-9715(01)00044-8
|View full text |Cite
|
Sign up to set email alerts
|

Argument free clustering for large spatial point-data sets via boundary extraction from Delaunay Diagram

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
37
0

Year Published

2003
2003
2018
2018

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 70 publications
(38 citation statements)
references
References 15 publications
0
37
0
Order By: Relevance
“…We used the AutoClust algorithm [32] for this purpose, which is a points clustering method with Delaunay triangulation. As for a Delaunay triangulation made of point set P, no point in P is inside the circumcircle of angle triangle in the Delaunay triangulation.…”
Section: Initial Clusteringmentioning
confidence: 99%
“…We used the AutoClust algorithm [32] for this purpose, which is a points clustering method with Delaunay triangulation. As for a Delaunay triangulation made of point set P, no point in P is inside the circumcircle of angle triangle in the Delaunay triangulation.…”
Section: Initial Clusteringmentioning
confidence: 99%
“…To determine which types of spatial patterns these sub-graphs are, in the following an indicator will be defined that considers the volumes of these sub-graphs. It should be pointed out that the previous multi-constraint Delaunay triangulation is mainly designed to detect various types of spatial clusters with different shapes and densities [25,26]. The proposed multi-constraint Delaunay triangulation in this study can give a more detailed analysis of the characteristics of edges from different levels, by which various spatial clusters and outliers can be simultaneously detected.…”
Section: Spatial Distribution Patterns Detectionmentioning
confidence: 96%
“…In order to detect spatial distribution patterns from spatial point events, a number of spatial clustering [25,26] and spatial outlier detection [27,28] methods have been proposed. However, these methods cannot accurately detect different types of spatial clusters and outliers simultaneously.…”
Section: Spatial Distribution Patterns Detectionmentioning
confidence: 99%
See 1 more Smart Citation
“…The most commonly used spatial clustering algorithms are as follows: partitioning methods, such as K-Means [39]; hierarchical methods, such as CURE (Clustering Using Representatives) [40]; and density-based methods, such as DBSCAN (Density-based Spatial Clustering of Applications with Noise) [41]. In fact, no particular clustering method has been shown to be superior to its competitors with regards to all of the necessary aspects [42]. To date, the advantages and disadvantages of various algorithms have been extensively analyzed [43][44][45][46].…”
Section: Layout Optimization Of Refueling Service Based On Cluster Anmentioning
confidence: 99%