Covering a set of line segments with a few squares

01/25/2021
by   Joachim Gudmundsson, et al.
0

We study three covering problems in the plane. Our original motivation for these problems come from trajectory analysis. The first is to decide whether a given set of line segments can be covered by up to four unit-sized, axis-parallel squares. The second is to build a data structure on a trajectory to efficiently answer whether any query subtrajectory is coverable by up to three unit-sized axis-parallel squares. The third problem is to compute a longest subtrajectory of a given trajectory that can be covered by up to two unit-sized axis-parallel squares.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

09/14/2017

A linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares

This paper discusses the problem of covering and hitting a set of line s...
09/06/2021

Disjoint axis-parallel segments without a circumscribing polygon

We construct a family of 17 disjoint axis-parallel line segments in the ...
09/05/2021

Linking disjoint axis-parallel segments into a simple polygon is hard too

Deciding whether a family of disjoint axis-parallel line segments in the...
06/01/2021

A (2+ε)-Approximation Algorithm for Maximum Independent Set of Rectangles

We study the Maximum Independent Set of Rectangles (MISR) problem, where...
09/08/2017

Balanced Line Separators of Unit Disk Graphs

We prove a geometric version of the graph separator theorem for the unit...
10/10/2020

LSMAT Least Squares Medial Axis Transform

The medial axis transform has applications in numerous fields including ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.