kdtree Questions
2
Solved
What is the main difference between a quadtree and kd-tree? I understand they split points in many dimensions, but I do not understand why we would use one over the other.
I need a structure that a...
Stiffen asked 21/11, 2012 at 6:59
2
I have a set of points for which I want to construct KD Tree. After some time I want to add few more points to this KDTree periodically. Is there any way to do this in scipy implementation
4
I'm trying to figure out which structure would be better for doing several radius search of points, a kd-tree or an octree? It was already mentioned in this question but there was no answer. It see...
Lushy asked 1/8, 2013 at 15:20
2
Solved
I have built a d dimensional KD-Tree. I want to do range search on this tree. Wikipedia mentions range search in KD-Trees, but doesn't talk about implementation/algorithm in any way. Can someone pl...
Multifoil asked 20/12, 2019 at 13:42
11
Solved
I'm looking for a KDTree implementation in Java.
I've done a google search and the results seem pretty haphazard. There are actually lots of results, but they're mostly just little one-off implemen...
Carcassonne asked 31/10, 2008 at 14:44
4
Solved
What is the difference between these two algorithms?
1
Solved
I have a point p, and n line segments in the 2d space. Is there a way I can preprocess the line segments so that I can efficiently (i.e. sublineraly) find the line segment closest (i.e with lowest ...
Toxic asked 4/6, 2022 at 11:58
2
Solved
I have a 2 dimensional array:
MyArray = array([6588252.24, 1933573.3, 212.79, 0, 0],
[6588253.79, 1933602.89, 212.66, 0, 0],
etc...)
The first two elements MyArray[0] and MyArray[1] are the X ...
Arbalest asked 16/10, 2012 at 21:20
1
I've implemented a SAH kd-tree based upon the paper On building fast kd-Trees for Ray Tracing, and on doing that in O(N log N) by Wald and Havran. Note I haven't done their splicing and merging sug...
Lull asked 28/7, 2016 at 13:14
1
Solved
Action
To cluster points based on distance and label using connected components.
Problem
The back and forth switching between NetworkX nodes storage of attributes and Pandas DataFrame
Seems too ...
Belton asked 22/11, 2017 at 15:37
3
I have a set of latitude and longitude for various locations and also know the latitude and longitude of my current location. I have to find out the nearest places from current location.
Which al...
Woodenware asked 18/3, 2017 at 11:4
1
Solved
Problem statement:
I have 150k points in a 3D space with their coordinates stored in a matrix with dimension [150k, 3] in mm.
I want to find all the neighbors of a given point p that are within a r...
Callie asked 25/11, 2020 at 11:34
4
Solved
To a list of N points [(x_1,y_1), (x_2,y_2), ... ] I am trying to find the nearest neighbours to each point based on distance. My dataset is too large to use a brute force approach so a KDtree seem...
Teriann asked 6/1, 2018 at 11:16
3
Solved
This question concerns the implementation of KNN searching of KDTrees. Traversal of a KDTree to find a single best match (nearest neighbor) is straightforward, akin to a modified binary search.
Ho...
Saenz asked 9/1, 2016 at 2:11
3
Solved
Input:
point = (lat, long)
places = [(lat1, long1), (lat2, long2), ..., (latN, longN)]
count = L
Output:
neighbors = subset of places close to the point. (len(neighbors)=L)
Question:
Can I use ...
Illegitimacy asked 19/5, 2016 at 13:14
1
Solved
I have a large set of 2-dimensional points and want to be able to rapidly query the set for the k-Nearest-Neighbours of any point in the 2-d space. Since it's low-dimensional, a KD-Tree seems like ...
Abba asked 25/5, 2015 at 23:40
2
Solved
I've quickly checked the performance of building a tree and querying it versus just calculating all the euclidean distances. If I query this tree for all other points within a radius, shouldn't it ...
Blais asked 19/9, 2019 at 11:44
3
Solved
I'm working with BOW object detection and I'm working on the encoding stage. I have seen some implementations that use kd-Tree in the encoding stage, but most writings suggest that K-means clusteri...
Detect asked 18/6, 2012 at 21:44
1
Solved
The pseudo-code for nearest neighbor (NN) search in Wikipedia is not tractable enough for me. Few more posts available with implementations, but they seem to be language specific. So I'm finding it...
Roar asked 14/8, 2019 at 7:5
2
Solved
Are there any packages in Python that allow one to do kdtree-like operations for longitude/latitudes on the surface of a sphere? (this would need to take into account the spherical distances proper...
Beezer asked 11/5, 2012 at 10:8
3
I am looking at the Wikipedia page for KD trees. As an example, I implemented, in python, the algorithm for building a kd tree listed.
The algorithm for doing KNN search with a KD tree, however, ...
Koodoo asked 11/12, 2010 at 19:14
3
I have used kd-tree algoritham and make tree.
But i found that tree is not balanced so my question is if we used kd-tree algoritham then that tree is always balanced if not then how can we make i...
Theo asked 26/8, 2015 at 8:12
1
Solved
I am looking for a performant algorithm to match a large number of people by location, gender and age according to this data structure:
Longitude (denotes the persons location)
Latitude (denotes ...
Makedamakefast asked 11/7, 2018 at 8:16
2
Solved
I am working in python and I have a x,y mesh grid which are numpy arrays. I need to find for each point (x1,y1) in the grid, the points which are present at a distance r from (x1,y1). Scipy has a f...
1
I was trying to implement KNN for handwritten character recognition where I found out that the execution of code was taking a lot of time. When added parameter leaf_size with value 400, I observed ...
Burford asked 21/4, 2018 at 8:49
1 Next >
© 2022 - 2024 — McMap. All rights reserved.