On partitioning polygons
- 1 January 1985
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 288-295
- https://doi.org/10.1145/323233.323270
Abstract
Chaselle has shown how to partition any simple polygon P into two polygons, each of total weight not greater than two thirds of the total weight of P, by drawing a diagonal within P. Under the assumption that a triangulation of P is given, we provide a straightforward proof of Chaselles theorem and derive generalizations of the theorem to include polygons with polygonal holes.This publication has 0 references indexed in Scilit: