11,000+
Interactive Demonstrations Powered by Notebook Technology »
TOPICS
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
Testing a Polygon for Convexity and Self-Intersection
Drag the black vertices to change the polygon. The Demonstration tests for its convexity or self-intersection. Self-intersection always implies non-convexity, but not the other way around.
Contributed by:
Jaime Rangel-Mondragon
THINGS TO TRY
Drag Locators
SNAPSHOTS
RELATED LINKS
A Test for the Convexity of a Quadrilateral
(
Wolfram Demonstrations Project
)
An Efficient Test for a Point to Be in a Convex Polygon
(
Wolfram Demonstrations Project
)
Convex Polygon
(
Wolfram
MathWorld
)
Segment Intersection
(
Wolfram Demonstrations Project
)
PERMANENT CITATION
Jaime Rangel-Mondragon
"
Testing a Polygon for Convexity and Self-Intersection
"
http://demonstrations.wolfram.com/TestingAPolygonForConvexityAndSelfIntersection/
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
Voronoi Diagrams
Ed Pegg Jr and Jeff Bryant
Largest Disk in a Convex Polygon
Jaime Rangel-Mondragon
An Efficient Test for a Point to Be in a Convex Polygon
Robert Nowak
Self-Intersecting Polygons
Stephen Wolfram
Ray Tracing for Points in a Polygon
Raja Kountanya
Fermat-Weber Point of a Polygonal Chain
Bhaswar B. Bhattacharya
The Intersection of Two Triangles
Jaime Rangel-Mondragon
Visible Points in a Polygon
Jaime Rangel-Mondragon
The Facilities Location Problem
Tim Neuman and Stan Wagon
Voronoi Diagrams in Two-Dimensional Regions
Erik Mahieu
Related Topics
Algorithms
Computational Geometry
Plane Geometry
Polygons
Browse all topics