Interactive analysis using Voronoi diagrams: Algorithms to support dynamic update from a generic triangle-based data structure

Transactions in GIS

Volumn 6, Issue 2, 2002, Pages 89-114

  Lee, Ickjai ^a   Gahegan, Mark ^b  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; GRAPHIC METHODS; PARALLEL PROCESSING SYSTEMS;

ALGORITHMIC COMPLEXITY; DYNAMIC UPDATE; INCREMENTAL UPDATES; INTERACTIVE ANALYSIS; LOCAL TOPOLOGY; ORDER-K VORONOI DIAGRAMS; PROOF OF CONCEPT; VORONOI; VORONOI DIAGRAMS; WEIGHTED VORONOI DIAGRAM;

DATA STRUCTURES;

ALGORITHM; DATA MANAGEMENT; SPATIAL ANALYSIS; TRIANGULATION;

EID: 0036209247     PISSN: 13611682     EISSN: None     Source Type: Journal    
DOI: 10.1111/1467-9671.00099     Document Type: Article

References (30)

1. Interactive techniques and exploratory spatial data analysis
2. Voronoi diagrams: A survey of a fundamental geometric data structure
3. An optimal algorithm for constructing the weighted Voronoi diagram in the plane
4. Weighting thiessen polygons
5. Mapping the geography of cyberspace using telecommunications infrastructure information
6. Exploring spatial data representation with dynamic graphics
7. Implementing Watson's algorithm in three dimensions
8. A sweepline algorithm for Voronoi diagrams
9. Data structures and algorithms to support interactive spatial analysis using dynamic Voronoi diagrams
10. Swap conditions for dynamic Voronoi diagram for circles and line segments
11. The meaning of "neighbour."
12. Dynamic spatial data structures: The Voronoi approach
13. An outline of an event-driven spatial data structure for managing time-varying maps
14. Advantages of the Voronoi spatial model
15. The quad-arc data structure
16. An efficient algorithms for determining the convex hull of a finite planar set
17. Computing Dirichlet tessellations in the plane
18. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams
19. Voronoi diagrams for moving points in the plane
20. Triangulation algorithms for adaptive terrain modelling
21. On k-nearest neighbour Voronoi diagrams in the plane
22. Two algorithms for constructing the Delaunay triangulation
23. Nearest neighbourhood operations with generalised Voronoi diagrams: A review