Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications

Keyphrases

• Bivariate 100%
• Algebraic Function 100%
• Lower Envelope 100%
• Voronoi Diagram 100%
• General Distance Functions 100%
• Shallow Cuttings 100%
• Efficient Construction 100%
• Fast Algorithm 50%
• Construction Algorithm 50%
• Query Response Time 50%
• Update Time 50%
• N-factor 50%
• Combinatorial Complexity 50%
• Connectivity Queries 50%
• Randomized Incremental Construction 50%
• Line Segments 50%
• Dynamic Set 50%
• Vertical Decomposition 50%
• Additively Weighted 50%
• Distance Function 50%
• Weighted Euclidean Distance 50%
• Nearest Neighbor Query 50%
• Descriptional Complexity 50%
• Disk Graph 50%
• Linear Complexity 50%
• Disjoint 50%
• Binary Counter 50%
• Disk Intersection Graph 50%
• Lp-norm 50%
• Nearest Neighbor 50%
• Query Cost 50%
• Neighborhood Context 50%
• Structured Support 50%

Mathematics

• Distance Function 100%
• Data Structure 100%
• Algebraic Function 28%
• Nearest Neighbor 28%
• Bivariate 28%
• Random Sample 14%
• Line Segment 14%
• Vertical Decomposition 14%
• Intersection Graph 14%
• Pairwise Disjoint 14%
• Linear Complexity 14%
• Plane in R3 14%
• Fast Algorithm 14%
• Euclidean Distance 14%

Computer Science

• Data Structure 100%
• Distance Function 100%
• Construction Algorithm 14%
• Incremental Construction 14%
• near neighbor query 14%
• Fast Algorithm 14%
• Euclidean Distance 14%
• Intersection Graph 14%
• Vertical Decomposition 14%