Partitions of planar sets into small triangles by
نویسندگان
چکیده
Given 3n points in the unit square, n ≥ 2, they determine n triangles whose vertices exhaust the given 3n points in many ways. Choose the n triangles so that the sum of their areas is minimal, and let a *(n) be the maximum value of this minimum over all configurations of 3n points. Then n − 1/2 << a *(n) << n − 1/9 is deduced using results on the Heilbronn triangle problem. If the triangles are required to be area disjoint it is not even clear that the sum of their areas tends to zero; this open question is examined in a slightly more general setting. 1980 Mathematics Subject Classification: Primary 52A37, 52A40. Secondary 52A45.
منابع مشابه
On Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their c...
متن کاملDecompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their c...
متن کاملOn pseudo-convex decompositions, partitions, and coverings
We introduce pseudo-convex decompositions, partitions, and coverings for planar point sets. They are natural extensions of their convex counterparts and use both convex polygons and pseudo-triangles. We discuss some of their basic combinatorial properties and establish upper and lower bounds on their complexity.
متن کاملOn Alliance Partitions and Bisection Width for Planar Graphs
An alliance in a graph is a set of vertices (allies) such that each vertex in the alliance has at least as many allies (counting the vertex itself) as non-allies in its neighborhood of the graph. We show how to construct infinitely many non-trivial examples of graphs that can not be partitioned into alliances and we show that any planar graph with minimum degree at least 4 can be split into two...
متن کاملValidation andAutomatic Repair of Planar Partitions Using a Constrained Triangulation
Planar partitions are frequently used tomodel, among others, land cover, cadastral parcels and administrative boundaries. In practice, they are often stored as a set of individual polygons to which attributes are attached (e.g. with the Simple Features paradigm), causing different errors and inconsistencies (e.g. gaps, overlaps anddisconnectedpolygons), which are introducedduring their creation...
متن کامل