Mathematics
Data Structure
100%
Approximates
44%
Running Time
43%
Set Point
39%
Convex Hull
33%
Integer
32%
Linear Time
31%
Three-Dimension
28%
Nearest Neighbor
25%
Edge
24%
Two Dimensions
23%
Line Segment
23%
Worst Case
23%
Closest Pair
23%
Upper Bound
22%
Point Location
20%
Linear Programming
19%
Constant Factor
19%
Higher Dimensions
17%
Polynomial
16%
Convolution
16%
Linear Space
14%
Searching Range
14%
Fast Algorithm
14%
Matrix Multiplication
14%
Triangle
13%
Polynomial Time
13%
Intersection Graph
13%
Planar Graph
12%
Minimum Spanning Tree
12%
Path Problem
12%
Straight Line
11%
Intersects
10%
Median
10%
Binary Tree
10%
Open Problem
10%
Minimizes
10%
Unit Square
9%
Dimensional Euclidean Space
8%
Bounding Box
8%
Hausdorff
8%
Parabola
8%
Combinatorial Geometry
7%
Extreme Points
7%
Decision Tree
7%
Geometric Object
6%
Clustering
6%
Competitive Ratio
6%
Maximum Independent Set
6%
Dimensional Case
6%
Keyphrases
Query Response Time
58%
Log-log
43%
Update Time
33%
Convex Hull
31%
Computational Geometry
31%
Randomized Algorithms
28%
Half-space
28%
Approximation Algorithms
28%
Rectangle
25%
Expected Time
24%
Time Algorithm
23%
All-pairs Shortest Paths
22%
Closest Pair
22%
Dynamic Data Structures
20%
Orthogonal Range Searching
20%
Deterministic Algorithm
20%
Line Segments
19%
Linear Programming
18%
Word RAM Model
17%
Linear Space
17%
Point Location
16%
Fully Dynamic
16%
Subquadratic
16%
High Dimension
16%
Geometric Set Cover
14%
3SUM
14%
Fast Algorithm
13%
Linear Time
13%
Space-time Data
13%
Optimization Problem
12%
In(III)
12%
Unweighting
12%
Approximate Nearest Neighbor Search
11%
Geometric Algorithms
11%
Three-dimensional (3D)
11%
Klee's Measure Problem
11%
SIMPLE Algorithm
11%
Straight Line
11%
Range Reporting
10%
Streaming Algorithms
10%
Axis-parallel Rectangles
10%
Two Dimensional
10%
Shallow Cuttings
10%
Fixed Dimension
10%
Geometry Optimization
10%
Planar Graph
10%
Euclidean Space
9%
Output-sensitive
9%
Curve Arrangements
9%
Binary Tree
9%
