Using the Gestalt Principle of Closure to Alleviate the Edge Crossing Problem in Graph Drawings.
Amalia I. RusuAndrew J. FabianRadu JianuAdrian RusuPublished in: IV (2011)
Keyphrases
- contour closure
- weighted graph
- perceptual grouping
- undirected graph
- edge weights
- edge detection
- disjoint paths
- perceptual organization
- graph theory
- random walk
- vertex set
- graph structure
- graph model
- graph theoretic
- strongly connected components
- graph representation
- human perception
- image processing
- structured data
- bipartite graph
- graph structures
- line drawings
- mutual reinforcement
- connected components
- search algorithm
- contour fragments
- symbol recognition
- densely connected
- graph based algorithm
- strongly connected
- random graphs
- graph partitioning
- visual perception