9846

Map-Coloring the Interior Regions Defined by the Diagonals of a Regular Polygon

Graph-coloring the interior regions determined by the diagonals of a regular polygon is a simply stated but deceptively complex problem. Given a polygon with sides, the number of diagonals increases at a rate between and . The number of intersections between diagonals and the number of interior regions increase at a super-cubic rate . The interior regions formed by the diagonals constitute a planar graph, but it is not the polygonization given by a Delaunay triangulation. This Demonstration presents the methods of exploiting and refining the Delaunay plane-sweep algorithm, obtaining and coloring the dual graph of a polygon mesh.

SNAPSHOTS

  • [Snapshot]
  • [Snapshot]
  • [Snapshot]

DETAILS

For more information on the interior regions obtained by diagonalizing regular polygons, see [1].
A symbolic computation method generates the intersections between diagonals, and the intersections are sorted along the parameter space of the line. The code we used for this was translated from the C language [2]. We include many means for reducing the redundancy of the results we obtain at each step.
We generated a counterclockwise triangulation of the intersection points between the diagonals using ComputationalGeometry`DelaunayTriangulation. Delaunay triangulation produces unwanted triangulations of regions that should be polygons with more than three sides. We identified correct triangles and triangles to be combined into larger polygons using the originally obtained list of intersected diagonal edge segments. Triangles to be combined are a tree traversal of polygons sharing edges that are not subdivided diagonals.
Partitioning into triangles is an NP-complete problem in the theory of computation as is coloring the dual of a graph.
We apply a graph-coloring algorithm to the dual graph of the polygon mesh; exploiting the fact that the dual graph is a bipartite graph, we then apply that coloring back to the mesh.
An unexpected discovery in this Demonstration was the pattern visible in the adjacency matrix of the diagonal-diagonal intersections.
References
[1] E. S. Rowland. "Regular Polygons Project." (Feb 6, 2013) www.math.rutgers.edu/~erowland/polygons-project.html.
[2] D. Coventry. "Line-Line Intersection Algorithm." (July 11, 2008) paulbourke.net/geometry/pointlineplane/pointline.r.
    • 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 »

Files require Wolfram CDF Player or Mathematica.









 
RELATED RESOURCES
Mathematica »
The #1 tool for creating Demonstrations
and anything technical.
Wolfram|Alpha »
Explore anything with the first
computational knowledge engine.
MathWorld »
The web's most extensive
mathematics resource.
Course Assistant Apps »
An app for every course—
right in the palm of your hand.
Wolfram Blog »
Read our views on math,
science, and technology.
Computable Document Format »
The format that makes Demonstrations
(and any information) easy to share and
interact with.
STEM Initiative »
Programs & resources for
educators, schools & students.
Computerbasedmath.org »
Join the initiative for modernizing
math education.
Step-by-step Solutions »
Walk through homework problems one step at a time, with hints to help along the way.
Wolfram Problem Generator »
Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet.
Wolfram Language »
Knowledge-based programming for everyone.
Powered by Wolfram Mathematica © 2014 Wolfram Demonstrations Project & Contributors  |  Terms of Use  |  Privacy Policy  |  RSS Give us your feedback
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+