AI Chat AI Image Generator AI Video Text to Speech

Orthogonal dissection into few rectangles

06/21/2022

∙

by David Eppstein, et al.

∙

∙

We describe a polynomial time algorithm that takes as input a polygon with axis-parallel sides but irrational vertex coordinates, and outputs a set of as few rectangles as possible into which it can be dissected by axis-parallel cuts and translations. The number of rectangles is the rank of the Dehn invariant of the polygon.

page 4

page 7

research

∙ 09/12/2020

Empty axis-parallel boxes

We show that, for every set of n points in the d-dimensional unit cube, ...

0 Boris Bukh, et al. ∙

research

∙ 04/04/2022

Partitioning axis-parallel lines in 3D

Let L be a set of n axis-parallel lines in ℝ^3. We are are interested in...

0 Boris Aronov, et al. ∙

research

∙ 07/15/2020

Coloring and Maximum Weight Independent Set of Rectangles

In 1960, Asplund and Grünbaum proved that every intersection graph of ax...

0 Parinya Chalermsook, et al. ∙

research

∙ 10/14/2017

Approximate Hotspots of Orthogonal Trajectories

In this paper we study the problem of finding hotspots of polygonal two-...

0 Ali Gholami Rudi, et al. ∙

research

∙ 06/22/2022

Reflections in an octagonal mirror maze

Suppose we are given an environment consisting of axis-parallel and diag...

0 David Eppstein, et al. ∙

research

∙ 01/25/2021

Poncelet Propellers: Invariant Total Blade Area

Given a triangle, a trio of circumellipses can be defined, each centered...

0 Dominique Laurain, et al. ∙

research

∙ 09/05/2023

Computing Hive Plots: A Combinatorial Framework

Hive plots are a graph visualization style placing vertices on a set of ...

0 Martin Nöllenburg, et al. ∙