Covering simple orthogonal polygons with r-stars

04/26/2023
by   Tamás Róbert Mezei, et al.
0

We solve the r-star covering problem in simple orthogonal polygons, also known as the point guard problem in simple orthogonal polygons with rectangular vision, in quadratic time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/12/2022

Curvilinearity and Orthogonality

We introduce sequences of functions orthogonal on a finite interval: pro...
research
06/25/2019

Orthogonal polynomials in and on a quadratic surface of revolution

We present explicit constructions of orthogonal polynomials inside quadr...
research
06/01/2023

Complexity of Simple Folding of Mixed Orthogonal Crease Patterns

Continuing results from JCDCGGG 2016 and 2017, we solve several new case...
research
09/05/2017

Guarding Path Polygons with Orthogonal Visibility

We are interested in the problem of guarding simple orthogonal polygons ...
research
08/19/2017

Minimum Hidden Guarding of Histogram Polygons

A hidden guard set G is a set of point guards in polygon P that all ...
research
08/19/2023

Securing Pathways with Orthogonal Robots

The protection of pathways holds immense significance across various dom...
research
06/30/2021

Optimal Construction for Time-Convex Hull with Two Orthogonal Highways in the L1-metric

We consider the time-convex hull problem in the presence of two orthogon...

Please sign up or login with your details

Forgot password? Click here to reset