A poor man's realization of Demoucron-Malgrange-Pertuiset algorithm

An implementation of the Demoucron-Malgrange-Pertuiset ($DMP$) algorithm is proposed, based on specifying the notion of a segment (fragment, bridge) and developing an algorithm for calculating and updating the segments after each iteration using a depth-first search strategy (DFS). The algorithm als...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computer science journal of Moldova Ročník 33; číslo 2(98); s. 219 - 242
Hlavní autor: Ciubotaru, Constantin
Médium: Journal Article
Jazyk:angličtina
Vydáno: Vladimir Andrunachievici Institute of Mathematics and Computer Science 01.09.2025
Témata:
biconnected graph
dmp$ algorithm
face
segment
segments/faces update
segments/graphs embedding
ISSN:1561-4042, 1561-4042, 2587-4330
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:An implementation of the Demoucron-Malgrange-Pertuiset ($DMP$) algorithm is proposed, based on specifying the notion of a segment (fragment, bridge) and developing an algorithm for calculating and updating the segments after each iteration using a depth-first search strategy (DFS). The algorithm also works for nonplanar undirected graphs by finally constructing a planar subgraph and displaying the list of segments that cannot be embedded, so as they generate edge intersections when drawin
ISSN:1561-4042
1561-4042
2587-4330
DOI:10.56415/csjm.v33.11