Fair partitions of polygons: an elementary introduction
From MaRDI portal
(Redirected from Publication:692544)
Abstract: We address the question: Given a positive integer , can any 2D convex polygonal region be partitioned into convex pieces such that all pieces have the same area and same perimeter? The answer to this question is easily `yes' for =2. We prove the answer to be `yes' for =4 and also discuss higher powers of 2.
Recommendations
Cites work
Cited in
(23)- Rational maps from Euclidean configuration spaces to spheres
- Convex equipartitions via equivariant obstruction theory
- A combinatorial algorithm to establish a fair border
- Equipartitioning by a convex 3-fan
- Equivariant topology of configuration spaces
- Cutting polygons into small pieces with chords: Laser-based localization
- Fair Partitioning by Straight Lines
- Pizza again? On the division of polygons into sections with a common origin
- Nonuniqueness of sixpartite points
- Keep your distance: land division with separation
- Algorithms for fair partitioning of convex polygons
- Incongruent equipartitions of the plane into quadrangles of equal perimeters
- Tilings with noncongruent triangles
- Convex equipartitions: the spicy chicken theorem
- Algorithms for fair partitioning of convex polygons
- Tilings of the plane with unit area triangles of bounded diameter
- scientific article; zbMATH DE number 2153479 (Why is no real title available?)
- Methods of equivariant topology in two Nice discrete geometry problems
- Functions, measures, and equipartitioning convex \(k\)-fans
- Voronoi-based splinegon decomposition and shortest-path tree computation
- Incongruent equipartitions of the plane
- Bisecting envelopes of convex polygons
- The mystery of duplication
This page was built for publication: Fair partitions of polygons: an elementary introduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q692544)