Region-restricted clustering for geographic data mining
From MaRDI portal
Publication:1000925
DOI10.1016/j.comgeo.2008.08.003zbMath1158.65310OpenAlexW2040113825MaRDI QIDQ1000925
Joachim Gudmundsson, Giri Narasimhan, Marc J. van Kreveld
Publication date: 12 February 2009
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/24628
clusteringdata structurescomputational geometryapproximation algorithmscomplex geographical settingdetection of clusters
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Geodesy, mapping problems (86A30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On enclosing k points by a circle
- Fractional cascading. I: A data structuring technique
- Algorithms for bichromatic line-segment problems and polyhedral terrains
- Iterated nearest neighbors and finding minimal polytopes
- Time bounds for selection
- Fast algorithms for computing the smallest \(k\)-enclosing circle
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Finding k points with minimum diameter and related problems
- Generalized Selection and Ranking: Sorted Matrices
- Determining approximate shortest paths on weighted polyhedral surfaces
- The hunting of the bump
- Priority Search Trees
- On k-Nearest Neighbor Voronoi Diagrams in the Plane
- Path Planning in 0/1/∞ Weighted Regions with Applications
- Printer graphics for clustering
- The weighted region problem
- Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
- Static and Dynamic Algorithms for k-Point Clustering Problems
- GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING
