DeepAI AI Chat
Log In Sign Up

On Guarding Orthogonal Polygons with Bounded Treewidth

by   Therese Biedl, et al.
University of Waterloo

There exist many variants of guarding an orthogonal polygon in an orthogonal fashion: sometimes a guard can see an entire rectangle, or along a staircase, or along an orthogonal path with at most k bends. In this paper, we study all these guarding models in the special case of orthogonal polygons that have bounded treewidth in some sense. Exploiting algorithms for graphs of bounded treewidth, we show that the problem of finding the minimum number of guards in these models becomes linear-time solvable in orthogonal polygons of bounded treewidth.


page 1

page 2

page 3

page 4


Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs

Given a planar graph G and an integer b, OrthogonalPlanarity is the prob...

Default Logic and Bounded Treewidth

In this paper, we study Reiter's propositional default logic when the tr...

Regular resolution for CNF of bounded incidence treewidth with few long clauses

We demonstrate that Regular Resolution is FPT for two restricted familie...

First Order Logic on Pathwidth Revisited Again

Courcelle's celebrated theorem states that all MSO-expressible propertie...

A Short Note on Parameterized Computation of Network Reliability with respect to Treewidth

We consider the classic problem of network reliability. A network is giv...

Efficient Approximation for Triangulation of Minimum Treewidth

We present four novel approximation algorithms for finding triangulation...

ETH-tight algorithms for finding surfaces in simplicial complexes of bounded treewidth

Given a simplicial complex with n simplices, we consider the Connected S...