Our great sponsors
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
// require https://github.com/JustinSDK/dotSCAD use use use n = 5; radius = 10; thickness = 1; geom = geom_icosahedron(radius); points = geom[0]; faces = geom[1]; for(f = faces) { triangle = [for(i = f) points[i]]; // subdivide the triangle triangles = tri_subdivide(triangle, n); points1 = [ for(t = triangles, p = t) let(unit_vector = p / norm(p)) unit_vector * radius ]; points2 = [ for(t = triangles, p = t) let(unit_vector = p / norm(p)) unit_vector * (radius - thickness) ]; ff = [for(i = [0:3:len(points1) - 3]) [i, i + 1, i + 2]]; color(rands(0, 1, 3)) sf_solidifyT(points1, points2, ff); }
Nice code. But what you want normally is to color the faces of a planar graph with as few colors as possible. The famous four color theorem states that the vertices of a planar graph can always be colored with 4 colors only, with vertices on different sides of each edge being different for all edges. Since dual graph of a planar graph is a planar graph as well (vertices become faces, faces become vertices, edges are kept) the faces of a planar graph can be 4 colored with no neighboring faces having same color. I know of no algorithm to 4-color a planar graph. There is a linear time algorithmto 5-color a plannar graph. I implemented a simple 6-coloring algorithm for planar graphs: https://github.com/Hermann-SW/planar_graph_playground/blob/main/node.convex_face_straight_line_drawing.6coloring.js