Cite
HARVARD Citation
Lalem, F. et al. (2017). LPCN: Least polar-angle connected node algorithm to find a polygon hull in a connected euclidean graph. Journal of network and computer applications. pp. 38-50. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Lalem, F. et al. (2017). LPCN: Least polar-angle connected node algorithm to find a polygon hull in a connected euclidean graph. Journal of network and computer applications. pp. 38-50. [Online].