On the Optimal Bisection of a Polygon

DOI10.1287/IJOC.4.4.435zbMATH Open0758.68058OpenAlexW2072697104MaRDI QIDQ4024315FDOQ4024315

Authors: Elias Koutsoupias, Christos Papadimitriou, Martha Sideri 

Publication date: 25 February 1993

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/dcdf8f62ad3f9b7861c288ce0a12d4f9307cee27

Recommendations

• A linear algorithm for bisecting a polygon
• Optimal line bipartitions of point sets
• scientific article; zbMATH DE number 177549
• scientific article; zbMATH DE number 1629819
• On the area bisectors of a polygon

zbMATH Keywords

geometric optimizationbisection\(NP\)-completesmallest possible total perimeter

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (12)

• Between shapes, using the Hausdorff distance
• Title not available (Why is that?)
• Isoperimetric enclosures
• On the relative strength of split, triangle and quadrilateral cuts
• Title not available (Why is that?)
• A linear algorithm for bisecting a polygon
• Dissection with the fewest pieces is hard, even to approximate
• Polygon Area Decomposition for Multiple-Robot Workspace Division
• Bisecting envelopes of convex polygons
• The bisection width of grid graphs
• Optimizing a Strip Separating Two Polygons
• Title not available (Why is that?)

This page was built for publication: On the Optimal Bisection of a Polygon

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4024315)