JOURNAL ARTICLE

Parametric Algorithm to Find the Largest Empty Rectangle from a Set of Line Segments.

  • Published In: International Journal of Foundations of Computer Science, 2025, v. 36, n. 4. P. 537 1 of 3

  • Database: Academic Search Ultimate 2 of 3

  • Authored By: Paul, Raina; Sarkar, Apurba; Biswas, Arindam 3 of 3

Abstract

A combinatorial algorithm to locate the Maximum Empty Rectangle (M E R) inside a given set L of non-intersecting horizontal and vertical line segments is presented in this paper. The M E R is the maximum area rectangle such that no line segment lies in part or in full within the rectangle. The proposed algorithm uses the projection lists and line sweep technique (k n log n) , where n is the cardinality of the set L , and k is the maximum number of candidate rectangles for a line segment. Projection list is the projection of the line segments on X and Y axes. [ABSTRACT FROM AUTHOR]

Additional Information

  • Source:International Journal of Foundations of Computer Science. 2025/06, Vol. 36, Issue 4, p537
  • Document Type:Article
  • Subject Area:Earth and Atmospheric Sciences
  • Publication Date:2025
  • ISSN:0129-0541
  • DOI:10.1142/S0129054124500175
  • Accession Number:185964997
  • Copyright Statement:Copyright of International Journal of Foundations of Computer Science is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Looking to go deeper into this topic? Look for more articles on EBSCOhost.