%0 Journal Article %1 journals/jnca/LalemBBSEKS17 %A Lalem, Farid %A Bounceur, Ahcène %A Bezoui, Madani %A Saoudi, Massinissa %A Euler, Reinhardt %A Kechadi, M. Tahar %A Sevaux, Marc %D 2017 %J J. Netw. Comput. Appl. %K %P 38-50 %T LPCN: Least polar-angle connected node algorithm to find a polygon hull in a connected euclidean graph. %U http://dblp.uni-trier.de/db/journals/jnca/jnca93.html#LalemBBSEKS17 %V 93

@article{journals/jnca/LalemBBSEKS17, added-at = {2023-12-13T04:21:53.000+0100}, author = {Lalem, Farid and Bounceur, Ahcène and Bezoui, Madani and Saoudi, Massinissa and Euler, Reinhardt and Kechadi, M. Tahar and Sevaux, Marc}, biburl = {https://www.bibsonomy.org/bibtex/27b7d9e419ea5ebbc5b9b8f0041c2143f/admin}, ee = {https://doi.org/10.1016/j.jnca.2017.05.005}, interhash = {94d8cc62c8e74a21797fc40848ae2dd0}, intrahash = {7b7d9e419ea5ebbc5b9b8f0041c2143f}, journal = {J. Netw. Comput. Appl.}, keywords = {}, pages = {38-50}, timestamp = {2023-12-13T04:21:53.000+0100}, title = {LPCN: Least polar-angle connected node algorithm to find a polygon hull in a connected euclidean graph.}, url = {http://dblp.uni-trier.de/db/journals/jnca/jnca93.html#LalemBBSEKS17}, volume = 93, year = 2017 }