Polygon simplification by minimizing convex corners

DOI10.1016/J.TCS.2019.05.016MaRDI QIDQ6828205zbMATH OpenFDO

Authors Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Debajyoti Mondal, Saeed Mehrabi, Sahar Mehrpour

Publication date 10 September 2019

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2019.05.016

zbMATH Keywords

monotone polygonsNP-hardnessouterstring graphspolygon simplification

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

This page was built for publication: Polygon simplification by minimizing convex corners

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