EXPLORE
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
Subscribe to RSS feed
Computational Geometry
«
PREVIOUS

1

2

3

4

5

6

NEXT
»
Demonstrations 61  80 of 120
A Minimal Circumcircle Measure of District Compactness
Heilbronn Volumes
Nearest Neighbor Graph Connections
Voronoi Image
An Efficient Test for a Point to Be in a Convex Polygon
2byn DiskPacking Paradox
Waterman Polyhedra
Point in Triangle
Problems on Circles II: Halving a Set of Points
The Bomb Problem
Maurer Rose Chords
Lattice Points on a Circle
Circular Coverings
Voronoi Diagrams
Taxicab Voronoi Diagram by a Cellular Automaton
Cylinders through Five Points
Random Chord Paradox
FourColor Maps
De Bruijn Graph Arcs
Iterative Polygon Simplification
«
PREVIOUS

1

2

3

4

5

6

NEXT
»
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+