LPCN: Least polar-angle connected node algorithm to find a polygon hull in a connected euclidean graph

Farid Lalem, Ahcène Bounceur, Madani Bezoui, Massinissa Saoudi, Reinhardt Euler, M. Tahar Kechadi, Marc Sevaux. LPCN: Least polar-angle connected node algorithm to find a polygon hull in a connected euclidean graph. J. Network and Computer Applications, 93:38-50, 2017. [doi]

@article{LalemBBSEKS17,
  title = {LPCN: Least polar-angle connected node algorithm to find a polygon hull in a connected euclidean graph},
  author = {Farid Lalem and Ahcène Bounceur and Madani Bezoui and Massinissa Saoudi and Reinhardt Euler and M. Tahar Kechadi and Marc Sevaux},
  year = {2017},
  doi = {10.1016/j.jnca.2017.05.005},
  url = {https://doi.org/10.1016/j.jnca.2017.05.005},
  researchr = {https://researchr.org/publication/LalemBBSEKS17},
  cites = {0},
  citedby = {0},
  journal = {J. Network and Computer Applications},
  volume = {93},
  pages = {38-50},
}