A linear algorithm to find a rectangular dual of a planar triangulated graph.
Jayaram BhaskerSartaj SahniPublished in: DAC (1986)
Keyphrases
- closed form
- learning algorithm
- tree structure
- detection algorithm
- segmentation algorithm
- linear complexity
- preprocessing
- objective function
- cost function
- np hard
- dynamic programming
- graph based algorithm
- primal dual
- optimal solution
- graph structure
- expectation maximization
- clustering method
- weighted graph
- planar graphs
- delaunay triangulation
- minimum spanning tree
- polynomial time complexity
- graph model
- np complete
- particle swarm optimization
- worst case
- computational cost
- k means
- lower bound
- bayesian networks