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 41  60 of 114
Five Points Determine a Conic Section
Worley's Cellular Textures
Chains of Regular Polygons and Polyhedra
Voronoi Diagram on a Sphere
The Pigeonhole Principle  Disk Coverings
FermatWeber Point of a Polygonal Chain
The Intersection of Two Triangles
Minimal Enclosing Sphere
Minimal Enclosing Circle
Country Interior: Two Solutions to the Nonconvex Polygon Interior Problem
kNearest Neighbor (kNN) Classifier
Is a Point Inside or Outside a Regular Polygon?
Generalized Coons Surface
Combination of Triangular Patches
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
«
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+