Polygon Detection from a Set of Lines
dc.contributor.author | Jr., Alfredo Ferreira | en_US |
dc.contributor.author | Fonseca, Manuel | en_US |
dc.contributor.author | Jorge, Joaquim | en_US |
dc.contributor.editor | Marcos, Adérito and Mendonça, Ana and Leitão, Miguel and Costa, António and Jorge, Joaquim | en_US |
dc.date.accessioned | 2021-10-14T11:18:33Z | |
dc.date.available | 2021-10-14T11:18:33Z | |
dc.date.issued | 2021 | |
dc.description.abstract | Detecting polygons defined by a set of line segments in a plane is an important step in the analysis of vectorial drawings. This paper presents an approach that combines several algorithms to detect basic polygons from a set of arbitrary line segments. The resulting algorithm runs in polynomial time and space, with complexities of O((N + M)4) and O((N + M)2) respectively, where N is the number of line segments and M is the number of intersections between line segments. Our choice of algorithms was made to strike a good compromise between efficiency and ease of implementation. The result is a simple and efficient solution to detect polygons from lines. | en_US |
dc.description.sectionheaders | Comunicações Curtas | |
dc.description.seriesinformation | 12º Encontro Português de Computação Gráfica | |
dc.identifier.doi | 10.2312/pt.20031439 | |
dc.identifier.isbn | 978-3-03868-163-2 | |
dc.identifier.pages | 159-162 | |
dc.identifier.uri | https://doi.org/10.2312/pt.20031439 | |
dc.identifier.uri | https://diglib.eg.org:443/handle/10.2312/pt20031439 | |
dc.publisher | The Eurographics Association | en_US |
dc.subject | Polygon Detection | |
dc.subject | Segment Intersection | |
dc.subject | Minimum Cycle Basis | |
dc.title | Polygon Detection from a Set of Lines | en_US |
Files
Original bundle
1 - 1 of 1