Skip to main navigation
Skip to search
Skip to main content
Research portal Eindhoven University of Technology Home
Help & FAQ
English
Nederlands
Home
Researchers
Research output
Organisational Units
Activities
Projects
Prizes
Press/Media
Facility/Lab/Equipment
Datasets
Courses
Research areas
Student theses
Search by expertise, name or affiliation
Optimal geometric data structures
A. Khosravi Dehkordi
Algorithms
Research output
:
Thesis
›
Phd Thesis 1 (Research TU/e / Graduation TU/e)
334
Downloads (Pure)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Optimal geometric data structures'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Rectilinear
100%
Data Structure
100%
Polygon
54%
Crossing Number
45%
Worst Case
27%
Cost Function
27%
Bounding Box
27%
Spatial Data
27%
Approximates
18%
Linear Function
18%
Simple Polygon
18%
Line Segment
18%
Rectangular Decomposition
18%
Set Point
18%
Piecewise Linear
18%
Minimizes
9%
Running Time
9%
Probability Theory
9%
Polynomial
9%
Optimality
9%
Planar Point
9%
Diagonal
9%
Vertical Line
9%
Discrete Set
9%
Underlying Space
9%
Uncertain Function
9%
Input Parameter
9%
Horizontal Line
9%
Kd-tree
9%
Input Function
9%