Skip to main navigation
Skip to search
Skip to main content
Eindhoven University of Technology research portal Home
Help & FAQ
English
Nederlands
Home
Researchers
Research output
Organisational Units
Activities
Projects
Prizes
Press/Media
Facilities / 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)
234
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
Partition
100%
Data Structure
100%
Rectilinear
37%
Number
34%
Partitioning
24%
Polygon
20%
Points
17%
Approximation
17%
Crossing Number
17%
Algorithm
10%
Worst Case
10%
Cost Function
10%
Bounding Box
10%
Spatial Data
10%
Set Point
6%
Approximates
6%
Functions
6%
Parameters
6%
Characteristics
6%
Piecewise
6%
Linear Function
6%
Simple Polygon
6%
Line Segment
6%
Rectangular Decomposition
6%
Efficiency
3%
Computational
3%
Classes
3%
Minimizes
3%
Trees
3%
Constant
3%
Running Time
3%
Optimization
3%
Geometry
3%
Probability Theory
3%
Polynomial
3%
Optimality
3%
Input Parameter
3%
Planar Point
3%
Diagonal
3%
Vertical Line
3%
Horizontal Line
3%
Discrete Set
3%
Underlying Space
3%
Uncertain Function
3%
Input Function
3%
Vertex
3%