Geometric Embedding of Path and Cycle Graphs in Pseudo-convex Polygons.
Hamid HoorfarAlireza BagheriPublished in: CoRR (2017)
Keyphrases
- digital convexity
- convex hull
- minkowski sum
- cell complexes
- graph embedding
- digital geometry
- graph theoretical
- spectral embedding
- convex optimization
- finding the shortest path
- spanning tree
- nonlinear dimensionality reduction
- vector space
- convex polyhedra
- minimum length
- graph representation
- graph matching
- graph theory
- graph mining
- graph model
- convex sets
- shortest path
- geometric objects
- geometric information
- digital plane
- graph databases
- geometric constraints
- weighted graph
- piecewise linear
- bipartite graph
- globally optimal
- nodes of a graph