A Merging Heuristic for the Rectangle Decomposition of Binary Matrices

  • Julien Subercaze
  • Christophe Gravier
  • Pierre-Olivier Rocher
Conference paper

DOI: 10.1007/978-3-319-38851-9_21

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9685)
Cite this paper as:
Subercaze J., Gravier C., Rocher PO. (2016) A Merging Heuristic for the Rectangle Decomposition of Binary Matrices. In: Goldberg A., Kulikov A. (eds) Experimental Algorithms. SEA 2016. Lecture Notes in Computer Science, vol 9685. Springer, Cham

Abstract

In this paper we present a linear-time and linear-space algorithm for the decomposition of binary images into rectangles. Our contribution is a two-stage algorithm. In the first stage we compute a \({\textstyle \frac{1}{min(h,w)}}\)-approximation for the largest rectangle starting at each point of the matrix. In the second stage the algorithm walks through the matrix, alternatively stacking, merging or removing encountered rectangles. Through an experimental evaluation, we show that our algorithm outperforms state-of-the-art linear-time algorithms for small to medium-sized rectilinear polygons.

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Julien Subercaze
    • 1
  • Christophe Gravier
    • 1
  • Pierre-Olivier Rocher
    • 1
  1. 1.Université de Lyon, UJM-Saint-Etienne CNRS, UMR5516, Laboratoire Hubert CurienSaint-EtienneFrance

Personalised recommendations