Monotone Pieces of Chains

DOI10.1287/IJOC.4.4.439zbMATH Open0759.68031OpenAlexW2019721918MaRDI QIDQ4024316FDOQ4024316

Authors:

Publication date: 25 February 1993

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

Full work available at URL: https://doi.org/10.1287/ijoc.4.4.439

Recommendations

• On decomposing polygons into uniformly monotone parts
• Moldable and castable polygons
• scientific article; zbMATH DE number 842885
• A new linear algorithm for triangulating monotone polygons
• scientific article; zbMATH DE number 4062595

zbMATH Keywords

decompositiongeometric optimizationpolygonal chaingeometric computations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30) Decomposition methods (49M27) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30) Mathematical programming (90C99)

Cited In (4)

• Linear-time algorithms for weakly-monotone polygons
• Monotone clutters
• On decomposing polygons into uniformly monotone parts
• Moldable and castable polygons

This page was built for publication: Monotone Pieces of Chains

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