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]

Abstract

Abstract is missing.