Loading...
Please wait, while we are loading the content...
Similar Documents
Shortest circular paths on planar graphs (2006)
| Content Provider | CiteSeerX |
|---|---|
| Author | Farin, Dirk Peter H., N. |
| Description | In 27 th Symposium on Information Theory In the Benelux The shortest circular-path problem is similar to the ordinary shortest path problem, but instead of specifying a distinguished starting and end node, the path has to form a closed loop. This problem has several applications in optimization problems as they occur in image segmentation or shape matching. We propose a new algorithm to compute shortest circular paths on planar graphs that has a typical computation time of O( V log V ) and a worst case complexity of O( V log 2 V ). The fastest previously known algorithm for this problem has an average computation time of O( V log 2 V ) and a worst case performance of O( V 2 log V ). 1 |
| File Format | |
| Language | English |
| Publisher Date | 2006-01-01 |
| Access Restriction | Open |
| Subject Keyword | Several Application Planar Graph Image Segmentation Optimization Problem Shape Matching End Node New Algorithm Path Problem Typical Computation Time Closed Loop Average Computation Time Worst Case Complexity Worst Case Performance Shortest Circular Path Circular Path Circular-path Problem |
| Content Type | Text |
| Resource Type | Article |
