On Point Set Embeddings for k-Planar Graphs with Few Bends per Edge.

Michael Kaufmann

Published in: SOFSEM (2019)

Keyphrases

point sets
planar graphs
boundary points
weighted graph
point correspondences
undirected graph
edge information
convex hull
edge detection
minimum weight
distance function
dimensionality reduction
data sets
pairwise
distance measure
low dimensional
edge detector
knn
three dimensional