Polygon simplification by minimizing convex corners

DOI10.1016/j.tcs.2019.05.016zbMath1430.68357arXiv1812.05656OpenAlexW2946472266WikidataQ127826238 ScholiaQ127826238MaRDI QIDQ2272403

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

Publication date: 10 September 2019

Published in: Theoretical Computer Science, Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.05656

zbMATH Keywords

NP-hardnessouterstring graphsmonotone polygonspolygon simplification

Mathematics Subject Classification ID

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

Related Items (2)

Shortcut hulls: vertex-restricted outer simplifications of polygons ⋮ Polygon simplification by minimizing convex corners

Cites Work

• Unnamed Item
• An algorithm for the maximum weight independent set problem on outerstring graphs
• The complexity of drawing a graph in a polygonal region
• Polygon simplification by minimizing convex corners
• Simplifying Massive Contour Maps
• APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
• GEODESIC-PRESERVING POLYGON SIMPLIFICATION
• OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE

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