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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Farid Lalem' in GoogleThis author has not been identified. Look up 'Ahcène Bounceur' in GoogleThis author has not been identified. Look up 'Madani Bezoui' in GoogleThis author has not been identified. Look up 'Massinissa Saoudi' in GoogleThis author has not been identified. Look up 'Reinhardt Euler' in GoogleThis author has not been identified. Look up 'M. Tahar Kechadi' in GoogleThis author has not been identified. Look up 'Marc Sevaux' in Google

runs on WebDSL