Lalem, FaridBounceur, AhcèneBezoui, MadaniSaoudi, MassinissaEuler, ReinhardtKechadi, TaharSevaux, Marc2017-06-142017-06-1420171084-8045https://dspace.univ-boumerdes.dz/handle/123456789/3803enConnected Euclidean graphPlanar graphBoundary nodesPolygon hullComputational geometryShape reconstructionLPCN : least polar-angle connected node algorithm to find a polygon hull in a connected euclidean graphArticle