A linear algorithm for bisecting a polygon

DOI10.1016/0020-0190(92)90042-TzbMath0742.68084OpenAlexW1970935285MaRDI QIDQ1186591

Thomas C. Shermer

Publication date: 28 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90042-t

zbMATH Keywords

polygonsbisectionham-sandwich

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

A survey of mass partitions ⋮ GOOD NEWS: PARTITIONING A SIMPLE POLYGON BY COMPASS DIRECTIONS

Cites Work

• Unnamed Item
• Bisections and ham-sandwich cuts of convex polygons and polyhedra
• Time bounds for selection
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems

This page was built for publication: A linear algorithm for bisecting a polygon