A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries

Keyphrases

• Nearest Neighbor Query 100%
• Dynamic Data Structures 100%
• Convex Hull 100%
• Time Method 50%
• Geometry Problems 50%
• Randomized Data Structures 50%
• Fully Dynamic 50%
• Query Cost 50%
• Point Query 50%
• Euclidean Minimum Spanning Tree 50%
• Update Cost 50%

Computer Science

• Data Structure 100%
• near neighbor query 100%
• Minimum Spanning Tree 50%