Abstract
We present an improved 2D rectangle packing heuristic that preserves the initial ordering of the rectangles while maintaining a left-to-right reading direction. We also present an algorithm configuration to fall back to a simpler algorithm that works more reliably for simple packing problems and an option to optimize the result in non-interactive scenarios. This is achieved by checking for stackability, approximating the required width, and using a strip packing algorithm to pack the rectangles with the option to improve the approximated width iteratively. We present still existing Obviously Non-Optimal packings and general problems of packings that preserve the reading direction, and discuss the problem of rectangle packing in hierarchical graphs. Moreover, the algorithm without the width approximation step can solve strip packing problems such that a reading direction is maintained.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Augustine, J., Banerjee, S., Irani, S.: Strip packing with precedence constraints and strip packing with release times. In: Proceedings of the Eighteenth Annual Acm Symposium on Parallelism in Algorithms and Architectures (SPAA’06), pp. 180–189. ACM, New York, NY, USA (2006)
Bruls, M., Huizing, K., Van Wijk, J.J.: Squarified treemaps. In: de Leeuw, W.C., van Liere, R. (eds.) Data visualization 2000, pp. 33–42. Springer, Vienna (2000). https://doi.org/10.1007/978-3-7091-6783-0_4
Da Silveira, J.L., Miyazawa, F.K., Xavier, E.C.: Heuristics for the strip packing problem with unloading constraints. Comput. Oper. Res. 40(4), 991–1003 (2013)
Da Silveira, J.L., Xavier, E.C., Miyazawa, F.K.: Two-dimensional strip packing with unloading constraints. Discrete Appl. Math. 164, 512–521 (2014)
Domrös, S., Lucas, D., von Hanxleden, R., Jansen, K.: On order-preserving, gap-avoiding rectangle packing. In: Proceedings of the 13th International Conference on Information Visualization Theory and Applications (IVAPP’21), part of the 16th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP’21), pp. 38–49. INSTICC, SciTePress (2021). https://doi.org/10.5220/0010186400380049
Dowsland, K.A., Dowsland, W.B.: Packing problems. Eur. J. Oper. Res. 56(1), 2–14 (1992). https://doi.org/10.1016/0377-2217(92)90288-K
Choppy, C., Sokolsky, O. (eds.): Monterey Workshop 2008. LNCS, vol. 6028. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-12566-9
von Hanxleden, R., et al.: SCCharts: sequentially constructive Statecharts for safety-critical applications. In: Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2014), pp. 372–383. ACM, Edinburgh, UK, June 2014
von Hanxleden, R., Fuhrmann, H., Spönemann, M.: KIELER–The KIEL integrated environment for layout eclipse rich client. In: Proceedings of the Design, Automation and Test in Europe University Booth (DATE 2011), Grenoble, France, March 2011
Kenyon, C., Rémila, E.: A near-optimal solution to a two-dimensional cutting stock problem. Math. Oper. Res. 25(4), 645–656 (2000)
Kieffer, S., Dwyer, T., Marriott, K., Wybrow, M.: HOLA: human-like orthogonal network layout. IEEE Trans. Vis. Comput. Graph. 22(1), 349–358 (2016). https://doi.org/10.1109/TVCG.2015.2467451
Lucas, D.: Order- and drawing area-aware packing of rectangles. Bachelor thesis, Christian-Albrechts-Universität zu Kiel, Faculty of Engineering, September 2018
Purchase, H.C.: Metrics for graph drawing aesthetics. J. Vis. Lang. Comput. 13(5), 501–516 (2002)
Kaufmann, M., Wagner, D. (eds.): GD 2006. LNCS, vol. 4372. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-70904-6
Rieß, M.: A graph editor for algorithm engineering. Bachelor thesis, Kiel University, Department of Computer Science, September 2010
Rüegg, U., von Hanxleden, R.: Wrapping layered graphs. In: Chapman, P., Stapleton, G., Moktefi, A., Perez-Kriz, S., Bellucci, F. (eds.) Diagrams 2018. LNCS (LNAI), vol. 10871, pp. 743–747. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-91376-6_72
Schulz-Rosengarten, A., von Hanxleden, R., Mallet, F., de Simone, R., Deantoni, J.: Time in SCCharts. In: Proceedings of Forum on Specification and Design Languages (FDL 2018), Munich, Germany, September 2018
Schulz-Rosengarten, A., Smyth, S., Mendler, M.: Towards object-oriented modeling in SCCharts. In: Proceedings of Forum on Specification and Design Languages (FDL 2019), Southampton, UK, September 2019
Smyth, S., et al.: SCCharts: the mindstorms report. Technical Report 1904, Christian-Albrechts-Universität zu Kiel, Department of Computer Science, December 2019. ISSN 2192–6247
Wang, Y., et al.: Edwordle: consistency-preserving word cloud editing. IEEE Trans. Vis. Comput. Graph. 24(1), 647–656 (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 Springer Nature Switzerland AG
About this paper
Cite this paper
Domrös, S., Lucas, D., von Hanxleden, R., Jansen, K. (2023). Revisiting Order-Preserving, Gap-Avoiding Rectangle Packing. In: de Sousa, A.A., et al. Computer Vision, Imaging and Computer Graphics Theory and Applications. VISIGRAPP 2021. Communications in Computer and Information Science, vol 1691. Springer, Cham. https://doi.org/10.1007/978-3-031-25477-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-031-25477-2_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-25476-5
Online ISBN: 978-3-031-25477-2
eBook Packages: Computer ScienceComputer Science (R0)