On partitioning polygons

Authors:
Andrzej Lingas
Affiliations:
The Department of Computer and Information Science, Linköping University, 681 83 Linköping, Sweden
Venue:
SCG '85 Proceedings of the first annual symposium on Computational geometry
Year:
1985

Citing 4
Cited 0

Fast Triangulation of Simple Polygons

Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Computational Aspects of VLSI

Computational Aspects of VLSI
Applications of a planar separator theorem

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
A theorem on polygon cutting with applications

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.