python (65.1k questions)
javascript (44.2k questions)
reactjs (22.7k questions)
java (20.8k questions)
c# (17.4k questions)
html (16.3k questions)
r (13.7k questions)
android (12.9k questions)
divide rectangle in random sized smaller rectangles
Im doing an art project where i really need to be able to divide a rectangle in a random way.
Ive have been searching alot for this but have not found anything i really can implement in proccesing. Th...
Soma Juice
Votes: 0
Answers: 1
PCL GPU Octree implementation is slow
I want to use pcl::gpu::Octree for storing the obstacle map and retrieving the closest distance to a given point. I've modified an official test example as follows:
int main(int argc, char** argv){...
GPrathap
Votes: 0
Answers: 0
Range search with KNN on two different dimensions
I've a few million records (which are updated often) with 2 properties:
Timestamp
Popularity score
I'm looking for a data structure (maybe some metric tree?) that can do fast range search on 1 dimen...
jeffreyveon
Votes: 0
Answers: 1
Given a kd tree-like grid, how to find two nearest intersecting lines
Say I have a grid structure like the image here:
Give point D, I want to find the nearest points whose line intersects with the line created by D.
I need a way to find C and E, but not A or B.
A is n...
Knoland
Votes: 0
Answers: 1