11524
EXPLORE
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
Largest Disk in a Convex Polygon
This Demonstration shows how to fit a disk of largest possible radius into a given convex polygon. Drag the vertices to change the polygon.
Contributed by:
Jaime Rangel-Mondragon
THINGS TO TRY
Drag Locators
SNAPSHOTS
DETAILS
Reference
[1] J. Matoušek and B. Gärtner,
Understanding and Using Linear Programming
, New York: Springer, 2007.
PERMANENT CITATION
Jaime Rangel-Mondragon
"
Largest Disk in a Convex Polygon
"
http://demonstrations.wolfram.com/LargestDiskInAConvexPolygon/
Wolfram Demonstrations Project
Published: July 22, 2013
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
Testing a Polygon for Convexity and Self-Intersection
Jaime Rangel-Mondragon
Voronoi Diagrams
Ed Pegg Jr and Jeff Bryant
Fold and Twist Algorithm for Some Regular n-Gons
Izidor Hafner
Catching a Point within a Teragon
Vasil Saroka
Separating Points by a Line or Parabola
Jaime Rangel-Mondragon
Jarvis March to Find the Convex Hull of a Set of Points in 2D
Ferenc Beleznay
Map-Coloring the Interior Regions Defined by the Diagonals of a Regular Polygon
Stewart Dickson
A Polygon from Its Midpoints
Jaime Rangel-Mondragon
Self-Intersections in a Polygon
Jaime Rangel-Mondragon
Rolling Polygons
Jaime Rangel-Mondragon
Related Topics
Algorithms
Analytic Geometry
Linear Programming
Plane Geometry
Polygons
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+