Polygon Detection from a Set of Lines

Simple item page
dc.contributor.authorJr., Alfredo Ferreiraen_US
dc.contributor.authorFonseca, Manuelen_US
dc.contributor.authorJorge, Joaquimen_US
dc.contributor.editorMarcos, Adérito and Mendonça, Ana and Leitão, Miguel and Costa, António and Jorge, Joaquimen_US
dc.date.accessioned2021-10-14T11:18:33Z
dc.date.available2021-10-14T11:18:33Z
dc.date.issued2021
dc.description.abstractDetecting 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.sectionheadersComunicações Curtas
dc.description.seriesinformation12º Encontro Português de Computação Gráfica
dc.identifier.doi10.2312/pt.20031439
dc.identifier.isbn978-3-03868-163-2
dc.identifier.pages159-162
dc.identifier.urihttps://doi.org/10.2312/pt.20031439
dc.identifier.urihttps://diglib.eg.org:443/handle/10.2312/pt20031439
dc.publisherThe Eurographics Associationen_US
dc.subjectPolygon Detection
dc.subjectSegment Intersection
dc.subjectMinimum Cycle Basis
dc.titlePolygon Detection from a Set of Linesen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
159-162.pdf
Size:
82.03 KB
Format:
Adobe Portable Document Format
Download
Collections
Portuguese Meeting on Computer Graphics 2003