| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6875504 | Theoretical Computer Science | 2018 | 16 Pages |
Abstract
We propose different techniques to solve the above problems in cases where squares are axis-parallel or of arbitrary orientation, disjoint or overlapping. All the algorithms we use run in time that is a low-order polynomial in n, and improve upon the previous algorithms, if any.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Sergey Bereg, Binay Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, Zhao Song,