Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs.
Nadia M. BenbernouErik D. DemaineMartin L. DemaineMichael HoffmannMashhood IshaqueDiane L. SouvaineCsaba D. TóthPublished in: CCCG (2007)
Keyphrases
- weighted graph
- vertex set
- undirected graph
- edge detection
- edge information
- clustering algorithm
- neighborhood graph
- convex optimization
- connected graphs
- edge weights
- graph partitioning
- minimum spanning trees
- connected components
- pairwise
- graph theoretic
- adjacency graph
- graph mining
- piecewise linear
- flat zones
- graph model
- graph theory
- edge detector
- graph representation
- edge map
- graph construction
- strongly connected
- graph structure
- dual formulation
- dual variables
- graph matching
- multiscale