StackRating

An Elo-based rating system for Stack Overflow
Home   |   About   |   Stats and Analysis   |   Get a Badge
Rating Stats for

TilmannZ

Rating
1487.40 (4,450,784th)
Reputation
1,153 (137,207th)
Page: 1 2 3
Title Δ
Find nearest neighbor with morton code +3.11
Find the smallest area rectangle covering a query point -1.17
Representation of binary matrix with space complexity of O(n) +0.43
How can I sort a very large log file, too large to load into main m... +1.97
Quadtree performance issue 0.00
alternative methods are used for location searches on dating sites... 0.00
Nearest Neighbour using KDtree -3.49
Dataset for meaningless “Nearest Neighbor”? +0.72
Growable multidimensional data structure supporting range queries +1.10
How to mix normal and quadtree-based collision detection? 0.00
Determine in which polygons a point is 0.00
Data structure with O(1) insertion and O(log(n)) search complexity? +0.78
3D Nearest neighbour for query points located far away from set of... -3.27
Complexity of quad tree's range search 0.00
Data structure for fast searching of custom object using its attrib... -2.22
how to create a de-duplication engine that acts as a file storage,... 0.00
Data Structure For Determining Intersection of Rectangle with a Lar... 0.00
Cache-Friendly Matrix, for access to adjacent cells +3.83
Quadtrees: a common intersect method failing to handle a simple case 0.00
C++ efficient and compact map with integer keys +0.09
Is there a data structure like a map but will maintain the transiti... +4.04
List of Linear and Non-Linear Data Structures 0.00
Data structure + algorithm for ipv4 storage - efficient searching i... -3.84
n-D Trees - calculating the coordinates of hypercubes 0.00
What is the intuition behind the relationship between the dimension... 0.00
Retrieve k-nearest spheres within a limited range 0.00
Heuristics to sort array of 2D/3D points according their mutual dis... +4.65
C++ Data Structure for k Nearest Neighbour Search in D dimension us... -3.84
Why I should use QuadTree with Collision Detection 0.00
Data structure choice for ngrams upto length 5, when building count... 0.00
Intersecting rectangles in space 0.00
Combine Nearest Convex Polygons -4.03
Implementing a quadtree using arrays +0.50
Data Structure Project ideas? +0.06
Repacking voxel data for efficient storage +4.10
Data structure for fast random access and sequential access in R^3... -2.10
Is there any locality-preserving way to flatten a binary tree? +4.00
Is there any locality-preserving way to flatten a binary tree? -4.00
Calculate intersections between rtrees 0.00
Star Matching Algorithm with scale and rotation 0.00
In which situation we should not use Hash tables? +0.07
Data Structure for Multilevel Key 0.00
what is the best R tree variant -3.91
Save State of a Program 0.00
Find nearest N points to a give point in N-dimentional space -1.92
What is the best data structure to store distance sensitive spatial... +3.71
Nearest neighbour search for 1 to 2 million moving objects 0.00
Efficient way to find set of objects inside or intersecting boundin... +0.29
Why need to alternate dimension in kd-tree construction 0.00
O(1) access to depth 3 tree with high branching factor +0.26