9827
EXPLORE
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
Nearest in a Crowd
You are walking among a crowd of faces, and the nearest ones turn to look at you. Choose the number of nearest faces and the total number of faces. Then drag the locator to stroll among the randomly generated set of faces.
Contributed by:
Jaime Rangel-Mondragon
THINGS TO TRY
Drag Locators
Slider Zoom
Gamepad Controls
Automatic Animation
SNAPSHOTS
RELATED LINKS
The Traveling Salesman Problem 3: Nearest Neighbor Heuristic
(
Wolfram Demonstrations Project
)
Nearest Neighbor Problem
(
Wolfram
MathWorld
)
PERMANENT CITATION
Jaime Rangel-Mondragon
"
Nearest in a Crowd
"
http://demonstrations.wolfram.com/NearestInACrowd/
Wolfram Demonstrations Project
Published: July 18, 2014
Share:
Embed Interactive Demonstration
New!
Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site.
More details »
Download Demonstration as CDF »
Download Author Code »
(preview »)
Files require
Wolfram
CDF Player
or
Mathematica
.
Related Demonstrations
More by Author
The Traveling Salesman Problem 3: Nearest Neighbor Heuristic
Jaime Rangel-Mondragon
Visible Points in a Polygon
Jaime Rangel-Mondragon
The Traveling Salesman Problem 2: 2-opt Removal of Intersections
Jaime Rangel-Mondragon
The Traveling Salesman Problem 1: Optimal Paths
Jaime Rangel-Mondragon
The Traveling Salesman Problem 5: Traveling Salesman Path Problem
Jaime Rangel-Mondragon
The Traveling Salesman Problem 4: Spanning Tree Heuristic
Jaime Rangel-Mondragon
Constructing a Steiner Tree for Five Points
Ferenc Beleznay
Ant Colony Optimization (ACO)
Rasmus Kamper
Maximum Sum Descent
Heikki Ruskeepää
Picking Up Coins in a Grid
Heikki Ruskeepää
Related Topics
Algorithms
Combinatorics
Browse all topics
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to
Mathematica Player 7EX
I already have
Mathematica Player
or
Mathematica 7+