Voronoi representation for areal data processing in data-rich environments

Authors:
David Breitkreutz;Ickjai Lee
Affiliations:
eResearch Center, James Cook University, Townsville, QLD, Australia;School of Business, James Cook University, Cairns, QLD, Australia
Venue:
ISI'09 Proceedings of the 2009 IEEE international conference on Intelligence and security informatics
Year:
2009

Citing 5
Cited 0

Fast triangulation of the plane with respect to simple polygons

Information and Control
Voronoi diagrams—a survey of a fundamental geometric data structure

ACM Computing Surveys (CSUR)
Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
GIS: A Computing Perspective, 2nd Edition

GIS: A Computing Perspective, 2nd Edition
Technical Section: Point-in-polygon tests by convex decomposition

Computers and Graphics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Privacy and data explosion issues are major concerns in intelligence and security informatics. An areal data representation is a popular way to overcome these two issues. As data grows at an unprecedented rate, there still needs an improvement in area data representations to be more scalable. This paper determines the potential for an alternative areal representation that can offer performance benefits over traditional methods for use within data-rich environments. From the experiments performed, improvements are promising, especially within timecritical applications that need to consider large amounts of data quickly.