Ortho-unit polygons can be guarded with at most ⌊n-4/8⌋ guards

08/26/2022
by   J. M. Díaz-Báñez, et al.
0

An orthogonal polygon is called an ortho-unit polygon if its vertices have integer coordinates, and all of its edges have length one. In this paper we prove that any ortho-unit polygon with n ≥ 12 vertices can be guarded with at most ⌊n-4/8⌋ guards.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/20/2020

Parameterized Study of Steiner Tree on Unit Disk Graphs

We study the Steiner Tree problem on unit disk graphs. Given a n vertex ...
research
11/09/2020

Linear Codes from Incidence Matrices of Unit Graphs

In this paper, we examine the binary linear codes with respect to Hammin...
research
03/15/2021

Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs

A unit disk intersection representation (UDR) of a graph G represents ea...
research
07/01/2019

Computing a Smaller Unit-Distance Graph with Chromatic Number 5 via Proof Trimming

We present a method to gradually compute a smaller and smaller unsatisfi...
research
05/26/2023

Contouring by Unit Vector Field Regression

This work introduces a simple deep-learning based method to delineate co...
research
08/25/2019

Optimal Curve Straightening is ∃R-Complete

We prove that the following problem has the same computational complexit...
research
06/04/2022

Evaluation of Xilinx Deep Learning Processing Unit under Neutron Irradiation

This paper studies the dependability of the Xilinx Deep-Learning Process...

Please sign up or login with your details

Forgot password? Click here to reset