An Optimal Parallel Algorithm for Finding All Hinge Vertices of a Circular-Arc Graph.
Hirotoshi HonmaShigeru MasuyamaPublished in: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2008)
Keyphrases
- parallel algorithm
- binary search trees
- circular arcs
- parallel computation
- weighted graph
- shared memory
- cluster of workstations
- undirected graph
- line segments
- graph structure
- optimal solution
- image sequences
- medial axis transform
- straight line
- binary images
- graph cuts
- spanning tree
- level set
- search algorithm
- parallel version
- parallel implementations
- image processing