Node Painter on Vimeo

See all Show me

6. The City

by Baoquoc Doan

5 months ago

5. Quasar Simulation

by Baoquoc Doan

6 months ago

4. Bezier SpiralGrapher

by Baoquoc Doan

6 months ago

3. Collage Generator

by Baoquoc Doan

6 months ago

2. Taco Truck Visualization

by Baoquoc Doan

6 months ago

1. Node Painter

by Baoquoc Doan

6 months ago

This was my first Processing Sketch. It came about as I was trying to find a way to graphically represent the Nearest Neighbor Problem. I just ended up using brute force instead of employing a more efficient function. I once came across a Library for the nearest neighbor problem and the traveling salesman problem. If you happen to know of one, shoot me a link. Source code can be found here, openprocessing.org/visuals/?visualID=307

Credits

Tags

2 Likes

meushi 6 months ago

hi, isn't it "just" a backtracking problem ? optimizable with a branch and bound implementation ?
Baoquoc Doan 6 months ago

I've read about various solutions for it, I just didn't know how to express the solutions in terms of processing code. I suppose if i took the time I could figure it out. But thanks for the tip. The reason I'd like to find an improved Nearest neighbor solution is for some of my other sketches that require the recognition of other elements nearby, and when your managing many elements, things can quickly get bogged down. Meushi, you've got cool stuff by the way
meushi 6 months ago

thanks. btw if you feel like decoding the code (at the very end of the page), there's a java implementation of the nearest neighbour there: cgm.cs.mcgill.ca/~soss/cs644/projects/perrier/Nearest.html
Ryan Bateman 6 months ago

I found some great classes for the travelling salesmen and generally Applied Maths issues on Heaton Research: heatonresearch.com/
Baoquoc Doan 6 months ago

awesome, thanks a lot Ryan...that was really helpful
Ryan Bateman 6 months ago

No worries. :)