LPCN: Least polar-angle connected node algorithm to find a polygon hull in a connected euclidean graph.
Farid LalemAhcène BounceurMadani BezouiMassinissa SaoudiReinhardt EulerM. Tahar KechadiMarc SevauxPublished in: J. Netw. Comput. Appl. (2017)
Keyphrases
- graph structure
- tree structure
- dominating set
- maximum flow
- computational complexity
- preprocessing
- k means
- cost function
- detection algorithm
- directed graph
- connected components
- similarity measure
- convex hull
- clustering method
- simulated annealing
- learning algorithm
- dynamic programming
- segmentation algorithm
- undirected graph
- finding the shortest path
- random walker
- graph based algorithm
- objective function
- graph search
- graph clustering
- minimum spanning tree
- association rules
- np hard
- worst case
- matching algorithm
- expectation maximization
- random walk