Planar Disjoint-Paths Completion.

Isolde Adler Stavros G. Kolliopoulos Dimitrios M. Thilikos

Published in: Algorithmica (2016)

Keyphrases

disjoint paths
approximation algorithms
directed graph
undirected graph
planar surfaces
computational complexity
ground plane
np hard
data sets
nearest neighbor
method assumes
curved surfaces
level set
special case
lower bound
three dimensional
information systems
computer vision
genetic algorithm
neural network