Mathematics
Approximates
100%
Set Point
97%
Linear Time
68%
Running Time
65%
Three-Dimension
53%
Data Structure
45%
Edge
42%
Polygon
34%
Two Dimensions
31%
Nearest Neighbor
30%
Polytope
27%
Polynomial
26%
Triangle
26%
Convex Hull
22%
Integer
22%
Clustering
21%
Higher Dimensions
19%
Outlier
19%
Convex Body
18%
Median
18%
Hausdorff
17%
Probability Theory
17%
Line Segment
17%
Constant Factor
17%
Intersects
16%
Fast Algorithm
14%
Simple Polygon
13%
Hyperplane
13%
Worst Case
13%
Euclidean Distance
12%
Minimum Spanning Tree
11%
VC Dimension
11%
Small Set
10%
Upper Bound
9%
Bounding Box
9%
Polynomial Time
9%
Minimizes
9%
Euclidean Space
9%
Circle
8%
Intersection Graph
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%
Keyphrases
Approximation Algorithms
89%
Convex Hull
31%
Query Point
29%
Time Algorithm
27%
High Dimension
27%
Polygon
25%
Convex Polytope
24%
Nearest Neighbor
24%
Voronoi Diagram
24%
Near-linear Time
24%
Approximate Nearest Neighbor Search
23%
Polygonal Curves
23%
K-points
23%
Proximity Search
22%
Approximate Shortest Paths
21%
Expected Running Time
21%
Linear Size
20%
Shape Fitting
19%
Hyperplane
19%
Randomized Algorithms
19%
Two-point
19%
Convex Body
18%
Linear-time Algorithm
18%
Expected Time
18%
Center-based Clustering
18%
Oracle
17%
Line Segments
17%
Euclidean Distance
17%
Disk-shaped
17%
Expected Complexity
16%
Shortest Path
16%
Linear Time
16%
Nearest Neighbor Search
15%
Guard
15%
SIMPLE Algorithm
15%
Spanners
14%
Sublinear Space
14%
Number of Edges
14%
Fast Algorithm
14%
Half-space
14%
K-means
13%
Well-separated Pair Decomposition
13%
Combinatorial Complexity
13%
Computational Geometry
13%
Low Dimension
12%
Planar Arrangements
12%
Hausdorff Distance
12%
Line Arrangements
12%
Simple Polygon
12%
Time Approximation
12%
