Login / Signup

Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions.

Martin NöllenburgRoman PrutkinIgnaz Rutter
Published in: ISAAC (2015)
Keyphrases
  • graph matching
  • vertex set
  • image features
  • graph partitioning
  • pairwise
  • moving objects
  • design process
  • structured data
  • convex hull
  • directed graph
  • bipartite graph
  • graph theory
  • directed acyclic graph