Polygon Simplification by Minimizing Convex Corners

by   Yeganeh Bahoo, et al.

Let P be a polygon with r>0 reflex vertices and possibly with holes and islands. A subsuming polygon of P is a polygon P' such that P ⊆ P', each connected component R of P is a subset of a distinct connected component R' of P', and the reflex corners of R coincide with those of R'. A subsuming chain of P' is a minimal path on the boundary of P' whose two end edges coincide with two edges of P. Aichholzer et al. proved that every polygon P has a subsuming polygon with O(r) vertices, and posed an open problem to determine the computational complexity of computing subsuming polygons with the minimum number of convex vertices. We prove that the problem of computing an optimal subsuming polygon is NP-complete, but the complexity remains open for simple polygons (i.e., polygons without holes). Our NP-hardness result holds even when the subsuming chains are restricted to have constant length and lie on the arrangement of lines determined by the edges of the input polygon. We show that this restriction makes the problem polynomial-time solvable for simple polygons.


page 1

page 2

page 3

page 4


Subexponential-time Algorithms for Maximum Independent Set in P_t-free and Broom-free Graphs

In algorithmic graph theory, a classic open question is to determine the...

On subgraph complementation to H-free graphs

For a class 𝒢 of graphs, the problem SUBGRAPH COMPLEMENT TO 𝒢 asks wheth...

On the Complexity Landscape of Connected f -Factor Problems

Let G be an undirected simple graph having n vertices and let f be a fun...

Improved Kernels for Tracking Path Problems

Given a graph G, terminal vertices s and t, and an integer k, the Tracki...

Quantum computing algorithms for inverse problems on graphs and an NP-complete inverse problem

We consider an inverse problem for a finite graph (X,E) where we are giv...

On the Stretch Factor of Polygonal Chains

Let P=(p_1, p_2, ..., p_n) be a polygonal chain. The stretch factor of P...

The Parameterized Complexity of Guarding Almost Convex Polygons

Art Gallery is a fundamental visibility problem in Computational Geometr...

Please sign up or login with your details

Forgot password? Click here to reset