This is a Flash implementation of Graham's Scan algorithm for finding convex hulls. A convex hull is the polygon with the smallest area that contains all the specified points in an array. The Hull looks like an elastic band which has been stretched around a number of pegs in the ground. The Convex Hull algorithm is useful for robots, so that they can navigate around "star" shaped objects in the shortest possible way.
cool attempt. the movement of the cursor temporarily fixates the lattice and provides a hinging point and directional force to move it (lattice)...
kamil malek..when the cursor stops, the lattice takes on this trajectory and almost has a randomness in its direction again
kamil malekreferring to the comment previous to this one: what the hell are you talking about "kamil"??
YahyaSick nesss! :D
OliverHey cool!
jon harvey Cyb04Al, to be honest it's a bit boring isn't it?
MasterJYeah the last guest was right, boring. Boring and yet interesting and inspiring. You are way ahead of your time man. Keep it up
-nice! thanks for sharing!
fishHa no mames wey!!!! Que chingon trabajo muy bueno felicidades!!! :D desde ahora tienes un admirador mas en este mundo :P
Abraxaswonderful!!!!!
vivianGood work!! All of them. Thanks! =)
SarahThese things take a lot more work than you would imagine. This example was probably very hard. nice job!!
lewaIt is healthy, I shall come on your site more often, thank.
GeorgeI think it would be better if you change ur web skins! This is only a comment.
SALIKComment
JOrge gonzales