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 Δ
How to store multiple values for a key in a TRIE structure? 0.00
multi-dimensional sparse array in kotlin (jvm, js)? 0.00
How to quickly find k nearest points to a plane in 3 or more dimens... +2.16
Find the closest pair of points in a given set of points +0.50
A database or something similar to store high dimension data and qu... +0.02
how to find farthest neighbors in Euclidean space? 0.00
Two-dimensional index data structure 0.00
Better performant quad-tree for moving and colliding objects +2.00
Better performant quad-tree for moving and colliding objects -2.00
Can we reduce complexity in comparing each user in array with every... +0.11
What's the most optimal query in PgSql to find the nearest neig... -3.86
knn implementation in 3d space for n closest neighbours +0.13
Using a spatial index to find points within range of each other +5.26
range search algorithm for querying shapes in 2D plane that are in... +0.03
At what dimensionality does knn (k-nearest neighbors) start to perf... 0.00
Efficient algorithm for nearest point search in a grid 0.00
Furthest points of a point in kNN -4.05
Cutting Dimension in KD-Tree 0.00
How to optimize the algorithm used to calculate K-nearest neighbor... +0.13
best algorithm for spacial partitioning/collision detection on obje... 0.00
R-Tree construction algorithm using polygon MBR 0.00
A three-dimensional data structure that holds items in a positional... +0.43
What is KDtree alike datastructure for queries in a dynamic world? +0.12
Matching millions of people: k-d tree or locality-sensitive hashing? 0.00
Finding nearest neighbours in 3d point cloud, GPU 0.00
efficiently decide whether a point in a data set has no close neigh... +4.53
How to manage 2D data in a procedural game world +4.26
Two-dimensional acceleration structure +0.11
Comparison search time between K-D tree and Brute-force 0.00
Design Choice - 2D house plan +0.35
Finding a number of maximally different binary vectors from a set +4.99
What Data Structrure is faster for big amount of data? -0.38
Quadtree Performance: Square vs. Rectangular? 0.00
Most efficient way to check graph edge or node overlap with circle... 0.00
Conditions for binary search to succeed in finding nearest neighbor... 0.00
Understanding the time complexities of the R-Tree? 0.00
parallel quadtree construction from morton ordered points 0.00
why the concurrency performance of R-tree is bad -3.92
Hit-testing / finding intersection in a distorted rectangular mesh -3.54
Find nearest Vector2(x,y) in collection -4.10
Geospatial to count NN within Radius - in Big Data 0.00
Algorithm for 2D nearest-neighbour queries with dynamic points -3.19
Nearest neighbor searches in non-metric spaces +0.71
A data structure to handle moving points contact and containment wi... 0.00
Efficient KNN implementation which allows inserts 0.00
Nearest Neighbor Algorithm in R-Tree -4.09
Bulk loading in a B-Tree 0.00
How are the data structures which are created for making searches f... 0.00
Data structure to get all points inside a rectangle -1.10
How to efficiently return the Roads within a radius -2.73