IDEAS home Printed from https://ideas.repec.org/a/rau/journl/v6y2012i2p428-435.html
   My bibliography  Save this article

Building Non-Overlapping Polygons For Image Document Layout Analysis Results

Author

Listed:
  • Costin-Anton Boiangiu

    (University "Politehnica" of Bucharest)

  • Mihai Zaharescu

    (University "Politehnica" of Bucharest)

  • Ion Bucur

    (University "Politehnica" of Bucharest)

Abstract

Existing Computational Geometry algorithms aren't able to create a tight-fitting contour around document elements. Some of them don't follow the data points close enough, generating overlapping elements, while others, trying to keep close to the contour, break one element into pieces, falling between white spaces. The presented method both follows the contour closely and generates a single shape for a single element. The generation of the shape can be stopped at any time, either when there are no more intersections between layout elements or after a certain time elapsed, the result being valid at any given moment. In association with other algorithms it can offer a fast and clean solution for the problem of finding the non-overlapping areas resulted from the Layout Analysis document processing phase.

Suggested Citation

  • Costin-Anton Boiangiu & Mihai Zaharescu & Ion Bucur, 2012. "Building Non-Overlapping Polygons For Image Document Layout Analysis Results," Romanian Economic Business Review, Romanian-American University, vol. 6(2), pages 428-435, December.
    • Handle: RePEc:rau:journl:v:6:y:2012:i:2:p:428-435
    as

    Download full text from publisher

    File URL: http://www.rebe.rau.ro/RePEc/rau/jisomg/WI12/JISOM-WI12-A19.pdf
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Marian Stan & Ionut Spataru & Ion Bucur, 2016. "Compression Strategies Of 2d Point Clouds," Romanian Economic Business Review, Romanian-American University, vol. 10(2), pages 384-392, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:rau:journl:v:6:y:2012:i:2:p:428-435. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Alex Tabusca (email available below). General contact details of provider: https://edirc.repec.org/data/firauro.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.