Journal article icon

Journal article

Some fast algorithms for curves in surfaces

Abstract:

We present some algorithms that provide useful topological information about curves in surfaces. One of the main algorithms computes the geometric intersection number of two properly embedded 1-manifolds C1 and C2 in a compact orientable surface S. The surface S is presented via a triangulation or a handle structure, and the 1-manifolds are given in normal form via their normal coordinates. The running time is bounded above by a polynomial function of the number of triangles in the triangulation (or the number of handles in the handle structure), and the logarithm of the weight of C1 and C2. This algorithm represents an improvement over previous work, since its running time depends polynomially on the size of the triangulation of S and it can deal with closed surfaces, unlike many earlier algorithms. Another algorithm, with similar bounds on its running time, can determine whether C1 and C2 are isotopic. We also present a closely related algorithm that can be used to place a standard 1-manifold into normal form.

Publication status:
Published
Peer review status:
Peer reviewed

Actions

Access Document

Files:
Publisher copy:
10.1007/s00454-026-00845-7

Authors

More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Mathematical Institute
Oxford college:
St Catherine's College
Role:
Author
ORCID:
0000-0001-8264-8086


More from this funder
Funder identifier:
https://ror.org/0439y7842
Grant:
EP/Y004256/1


Publisher:
Springer
Journal:
Discrete and Computational Geometry More from this journal
Publication date:
2026-04-21
Acceptance date:
2026-03-19
DOI:
EISSN:
1432-0444
ISSN:
0179-5376


Language:
English
Pubs id:
2392141
Local pid:
pubs:2392141
Deposit date:
2026-03-19
ARK identifier:

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP