A note on a theorem of Perles concerning non-crossing paths in convex geometric graphs.
Ana Paulina FigueroaPublished in: Comput. Geom. (2009)
Keyphrases
- graph theoretical
- digital convexity
- graph matching
- graph theory
- shortest path
- topological information
- graph clustering
- convex optimization
- graph mining
- spanning tree
- reeb graph
- convex hull
- graph theoretic
- pairwise
- geometric structure
- graph structure
- geometric information
- small world
- path length
- optimal path
- series parallel
- graph representation
- globally optimal
- complex structures