Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time

Details Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time

2005-12-15

arxiv.org/abs/cs/0512064v1

Computer Science

Computational Geometry

13 pages, 7 figures

Scientific paper

We present an algorithm that computes a shortest non-contractible and a shortest non-separating cycle on an orientable combinatorial surface of bounded genus in O(n \log n) time, where n denotes the complexity of the surface. This solves a central open problem in computational topology, improving upon the current-best O(n^{3/2})-time algorithm by Cabello and Mohar (ESA 2005). Our algorithm uses universal-cover constructions to find short cycles and makes extensive use of existing tools from the field.

Affiliated with

Also associated with

No associations

Rating

Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-168300