Introduction to graph theory
Data Structures and Algorithm Analysis in C++
Data Structures and Algorithm Analysis in C++
Computer and Robot Vision
Image Retrieval Via Isotropic and Anisotropic Mappings
PRIS '01 Proceedings of the 1st International Workshop on Pattern Recognition in Information Systems: In conjunction with ICEIS 2001
Polyhedral Object Detection and Pose Estimation for Augmented Reality Applications
CA '02 Proceedings of the Computer Animation
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
ACM SIGGRAPH 2004 Papers
8/7-approximation algorithm for (1,2)-TSP
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Comparison of edge detection algorithms using a structure frommotion task
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
| Hi-index | 0.00 |
In this paper we present an algorithm for facet detection in graphs. We define the facets as simple cycles in the graph minimizing the length. Our algorithm detects the local structure of simple cycles intersecting in a particular vertex of the graph. For this purpose, we reduce the problem to an instance of the Traveling Salesman in an induced co-cyclic graph and use a method inspired from the minimum spanning tree to construct a circuit solution. Our algorithm found a correct solution for most of the cases we tested it on.