Mathematics
Approximates
100%
Set Point
96%
Linear Time
65%
Running Time
59%
Three-Dimension
52%
Data Structure
40%
Edge
38%
Polygon
36%
Two Dimensions
30%
Nearest Neighbor
29%
Polytope
26%
Polynomial
25%
Triangle
25%
Integer
21%
Frchet-Distance
21%
Convex Hull
20%
Clustering
20%
Higher Dimensions
18%
Convex Body
18%
Median
17%
Hausdorff
17%
Probability Theory
17%
Simple Polygon
14%
Line Segment
14%
Hyperplane
14%
Intersects
14%
Fast Algorithm
14%
Constant Factor
13%
Worst Case
13%
Euclidean Distance
12%
Upper Bound
11%
Minimum Spanning Tree
11%
VC Dimension
11%
Circle
10%
Small Set
9%
Bounding Box
9%
Polynomial Time
9%
Minimizes
9%
Euclidean Space
8%
Incidence Graph
8%
Restrictive Condition
8%
Combinatorial Geometry
8%
Distance Function
8%
Point Location
8%
Convex Set
8%
Total Number
7%
Cardinality
7%
Well-Separated Pair Decomposition
7%
Opts _ _ _
6%
Linear Programming
6%
Keyphrases
Approximation Algorithms
84%
Convex Hull
28%
Query Point
28%
Time Algorithm
26%
High Dimension
26%
Polygon
24%
Convex Polytope
24%
Nearest Neighbor
24%
Voronoi Diagram
23%
Approximate Nearest Neighbor Search
23%
Polygonal Curves
23%
K-points
22%
Near-linear Time
22%
Proximity Search
21%
Approximate Shortest Paths
20%
Expected Running Time
20%
Linear Size
19%
Shape Fitting
18%
Hyperplane
18%
Randomized Algorithms
18%
Two-point
18%
Convex Body
18%
Expected Time
18%
Center-based Clustering
17%
Oracle
17%
Line Segments
16%
Euclidean Distance
16%
Disk-shaped
16%
Expected Complexity
16%
Shortest Path
15%
Linear-time Algorithm
15%
Linear Time
15%
Nearest Neighbor Search
14%
Guard
14%
SIMPLE Algorithm
14%
Sublinear Space
14%
Fast Algorithm
13%
Half-space
13%
Number of Edges
13%
K-means
13%
Well-separated Pair Decomposition
13%
Combinatorial Complexity
12%
Computational Geometry
12%
Low Dimension
12%
Planar Arrangements
12%
Hausdorff Distance
12%
Line Arrangements
12%
Simple Polygon
12%
Time Approximation
12%
Spanners
11%
