Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Index Terms-Connected Euclidean graph"'
Autor:
Massinissa Saoudi, Madani Bezoui, Reinhardt Euler, Marc Sevaux, Farid Lalem, M. Tahar Kechadi, Ahcène Bounceur
Publikováno v:
Journal of Network and Computer Applications (JNCA)
Journal of Network and Computer Applications (JNCA), Elsevier, 2017, ⟨10.1016/j.jnca.2017.05.005⟩
JNCA, Journal of Network and Computer Applications
JNCA, Journal of Network and Computer Applications, 2017, ⟨10.1016/j.jnca.2017.05.005⟩
Journal of Network and Computer Applications (JNCA), Elsevier, 2017, ⟨10.1016/j.jnca.2017.05.005⟩
JNCA, Journal of Network and Computer Applications
JNCA, Journal of Network and Computer Applications, 2017, ⟨10.1016/j.jnca.2017.05.005⟩
Finding the polygon hull in a connected Euclidean graph can be considered as the problem of finding the convex hull with the exception that at any iteration a vertex can be chosen only if it is connected to the vertex chosen at the previous iteration
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::16148ae843de4362103f9e514a5ac496
https://hal.univ-brest.fr/hal-01519491/file/lpcn_algorithm-1.pdf
https://hal.univ-brest.fr/hal-01519491/file/lpcn_algorithm-1.pdf
