A Linear Algorithm to Find a Rectangular Dual of a Planar Triangulated Graph.
Jayaram BhaskerSartaj SahniPublished in: Algorithmica (1988)
Keyphrases
- detection algorithm
- learning algorithm
- computational complexity
- optimal solution
- graph based algorithm
- cost function
- maximum flow
- dynamic programming
- search algorithm
- preprocessing
- probabilistic model
- linear complexity
- graph construction
- linear systems
- polynomial time complexity
- delaunay triangulation
- random graphs
- packing problem
- graph partitioning
- graph structure
- directed graph
- matching algorithm
- neural network
- linear programming
- worst case
- np hard
- k means
- lower bound