文献
J-GLOBAL ID:201702213338123652
整理番号:17A1387758
LPCN連結ユークリッドグラフにおける多角形包発見のための最小極角連結節アルゴリズム【Powered by NICT】
LPCN: Least polar-angle connected node algorithm to find a polygon hull in a connected euclidean graph
著者 (10件):
Lalem Farid
(Universite de Bretagne Occidentale, Lab-STICC UMR CNRS 6285, France)
,
Bounceur Ahcene
(Universite de Bretagne Occidentale, Lab-STICC UMR CNRS 6285, France)
,
Bezoui Madani
(University of Boumerdes, Department of Mathematics, Algeria)
,
Saoudi Massinissa
(Universite de Bretagne Occidentale, Lab-STICC UMR CNRS 6285, France)
,
Saoudi Massinissa
(UCD, University College Dublin, Ireland)
,
Euler Reinhardt
(Universite de Bretagne Occidentale, Lab-STICC UMR CNRS 6285, France)
,
Kechadi Tahar
(Universite de Bretagne Occidentale, Lab-STICC UMR CNRS 6285, France)
,
Kechadi Tahar
(UCD, University College Dublin, Ireland)
,
Sevaux Marc
(Universite de Bretagne Occidentale, Lab-STICC UMR CNRS 6285, France)
,
Sevaux Marc
(Universite de Bretagne Sud, Lab-STICC UMR CNRS 6285, France)
資料名:
Journal of Network and Computer Applications
(Journal of Network and Computer Applications)
巻:
93
ページ:
38-50
発行年:
2017年
JST資料番号:
H0842A
ISSN:
1084-8045
資料種別:
逐次刊行物 (A)
記事区分:
原著論文
発行国:
イギリス (GBR)
言語:
英語 (EN)