Geospatial cluster tessellation through the complete order-k Voronoi diagrams

Authors:
Ickjai Lee;Reece Pershouse;Kyungmi Lee
Affiliations:
School of Math, Physics & IT, James Cook University, Townsville, QLD, Australia;School of Math, Physics & IT, James Cook University, Townsville, QLD, Australia;School of Business and Information Technology, Charles Sturt University, Albury, NSW, Australia
Venue:
COSIT'07 Proceedings of the 8th international conference on Spatial information theory
Year:
2007

Citing 15
Cited 0

An improved algorithm for constructing kth-order voronoi diagrams

IEEE Transactions on Computers
A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Spatial tessellations: concepts and applications of Voronoi diagrams

Spatial tessellations: concepts and applications of Voronoi diagrams
Computational geometry in C

Computational geometry in C
A spatial data mining method by clustering analysis

Proceedings of the 6th ACM international symposium on Advances in geographic information systems
Conceptual Spaces: The Geometry of Thought

Conceptual Spaces: The Geometry of Thought
Machine Learning

Machine Learning
Qualitative Spatial Representation and Reasoning with the Region Connection Calculus

Geoinformatica
On O(N^4) Algorithm to Contstruct all Vornoi Diagrams for K Nearest Neighbor Searching

Proceedings of the 10th Colloquium on Automata, Languages and Programming
Finding Boundary Shape Matching Relationships in Spatial Data

SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
Geographic Data Mining and Knowledge Discovery

Geographic Data Mining and Knowledge Discovery
GIS: A Computing Perspective, 2nd Edition

GIS: A Computing Perspective, 2nd Edition
Fast Cluster Polygonization and its Applications in Data-Rich Environments

Geoinformatica
On k-Nearest Neighbor Voronoi Diagrams in the Plane

IEEE Transactions on Computers
What is the region occupied by a set of points?

GIScience'06 Proceedings of the 4th international conference on Geographic Information Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a postclustering process that robustly computes cluster regions at different levels of granularity through the complete Order-k Voronoi diagrams. The robustness and flexibility of the proposed method overcome the application-dependency and rigidity of traditional approaches. The proposed cluster tessellation method robustly models monotonic and nonmonotonic cluster growth, and provides fuzzy membership in order to represent indeterminacy of cluster regions. It enables the user to explore cluster structures hidden in a dataset in various scenarios and supports "what-if" and "what-happen" analysis. Tessellated clusters can be effectively used for cluster reasoning and concept learning.