Space filling polygons
Space filling polygons is an umbrella term which includes various mathematical strategies to partition a surface into regions based on a set of points which exist in that surface. This problem has been tackled throughout history by Kepler, Descartes, Snow, Dirichlet or Voronoy. The latter set the foundations for the ubiquitously used Voronoi diagram: “the partitioning of a plane with n points into convex polygons such that each polygon contains exactly one generating point and every point in a given polygon is closer to its generating point than to any other” (Weisstein, 2019c). This definition sometimes causes eccentric polygons unsuitable for construction applications, and so possible solutions based on this theme have been studied, like Centroidal Voronoi Tesselations, Hodge-optimized triangulations or Circle packing dual mesh.
Works featuring this facet:
Facets:
Posted
by


