Rectangle Transformation Problem

10/30/2017
by   Shaojiang Wang, et al.
0

In this paper, we propose the rectangle transformation problem (RTP) and its variants. RTP asks for a transformation by a rectangle partition between two rectangles of the same area. We are interested in the minimum RTP which requires to minimize the partition size. We mainly focus on the strict rectangle transformation problem (SRTP) in which rotation is not allowed in transforming. We show that SRTP has no finite solution if the ratio of the two parallel side lengths of input rectangles is irrational. So we turn to its complement denoted by SIRTP, in which case all side lengths can be assumed integral. We give a polynomial time algorithm ALGSIRTP which gives a solution at most q/p+O(√(p)) to SIRTP(p,q) (q≥ p), where p and q are two integer side lengths of input rectangles p× q and q× p, and so ALGSIRTP is a O(√(p))-approximation algorithm for minimum SIRTP(p,q). On the other hand, we show that there is not constant solution to SIRTP(p,q) for all integers p and q (q>p) even though the ratio q/p is within any constant range. We also raise a series of open questions for the research along this line.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/10/2019

Constant factor approximation of MAX CLIQUE

MAX CLIQUE problem (MCP) is an NPO problem, which asks to find the large...
research
12/21/2018

A local search 4/3-approximation algorithm for the minimum 3-path partition problem

Given a graph G = (V, E), the 3-path partition problem is to find a mini...
research
11/03/2021

Rectangular Partitions of a Rectilinear Polygon

We investigate the problem of partitioning a rectilinear polygon P with ...
research
07/31/2020

On the Two-Dimensional Knapsack Problem for Convex Polygons

We study the two-dimensional geometric knapsack problem for convex polyg...
research
05/21/2019

Silent MST approximation for tiny memory

In network distributed computing, minimum spanning tree (MST) is one of ...
research
04/17/2023

Zero sum subsequences and hidden subgroups

We propose a method for solving the hidden subgroup problem in nilpotent...

Please sign up or login with your details

Forgot password? Click here to reset