Computing the Shortest Essential Cycle

An essential cycle on a surface is a simple cycle that cannot be continuously deformed to a point or a single boundary. We describe algorithms to compute the shortest essential cycle in an orientable combinatorial surface in O(n2 log n) time, or in O(nlog n) time when both the genus and number of boundaries are fixed. Our results correct an error in a paper of Erickson and Har-Peled [DCG 2004].

• Type: Journal
• Year: 2010
• Where: DCG
• Authors: Jeff Erickson, Pratik Worah
• Keywords: DCG 2010, Essential Cycle, Orientable Combinatorial Surface, Shortest Essential Cycle