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

Simple item page
dc.contributor.authorLalem, Farid
dc.contributor.authorBounceur, Ahcène
dc.contributor.authorBezoui, Madani
dc.contributor.authorSaoudi, Massinissa
dc.contributor.authorEuler, Reinhardt
dc.contributor.authorKechadi, Tahar
dc.contributor.authorSevaux, Marc
dc.date.accessioned2017-06-14T10:32:49Z
dc.date.available2017-06-14T10:32:49Z
dc.date.issued2017
dc.identifier.issn1084-8045
dc.identifier.urihttps://dspace.univ-boumerdes.dz/handle/123456789/3803
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofseriesJournal of Network and Computer Applications/ Vol.93 (2017);pp. 38-50
dc.subjectConnected Euclidean graphen_US
dc.subjectPlanar graphen_US
dc.subjectBoundary nodesen_US
dc.subjectPolygon hullen_US
dc.subjectComputational geometryen_US
dc.subjectShape reconstructionen_US
dc.titleLPCN : least polar-angle connected node algorithm to find a polygon hull in a connected euclidean graphen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Farid Lalem, Résumé.pdf
Size:
26.17 KB
Format:
Adobe Portable Document Format
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Publications Internationales