Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"LPCN: Least polar-angle connected node algorithm to find a polygon hull in ..."

Farid Lalem et al. (2017)

> Home

Details and statistics

DOI: 10.1016/J.JNCA.2017.05.005

access: closed

type: Journal Article

metadata version: 2020-06-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jnca/LalemBBSEKS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jnca/LalemBBSEKS17
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. Netw. Comput. Appl. 93: 38-50 (2017)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.