Skip to Main content Skip to Navigation
Conference papers

Testing Balanced Splitting Cycles in Complete Triangulations

Vincent Despré 1, * Michaël Rao 2 Stéphan Thomassé 2
* Corresponding author
1 GAMBLE - Geometric Algorithms and Models Beyond the Linear and Euclidean realm
LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry, Inria Nancy - Grand Est
2 MC2 - Modèles de calcul, Complexité, Combinatoire
LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : Let T be a triangulation of an orientable surface Σ of genus g. A cycle C of T is splitting if it cuts Σ into two noncontractible parts Σ 1 and Σ 2 , with respective genus 0 < g 1 ≤ g 2. The splitting cycle C is called balanced if g 1 ≥ g 2 − 1. The complexity of computing a balanced splitting cycle in a given triangulation is open, but seems difficult even for complete triangulations. Our main result in this paper is to show that one can rule out in polynomial time the existence of a balanced splitting cycle when the triangulation is ε-far to have one. Implementing this algorithm, we show that large Ringel and Youngs triangulations (for instance on 22.363 vertices) have no balanced splitting cycle, the only limitation being the size of the input rather than the computation time.
Document type :
Conference papers
Complete list of metadata
Contributor : Michaël Rao Connect in order to contact the contributor
Submitted on : Sunday, December 13, 2020 - 10:57:15 AM
Last modification on : Friday, January 21, 2022 - 3:11:21 AM
Long-term archiving on: : Sunday, March 14, 2021 - 6:39:53 PM


Files produced by the author(s)



Vincent Despré, Michaël Rao, Stéphan Thomassé. Testing Balanced Splitting Cycles in Complete Triangulations. Canadian Conference on Computational Geometry (CCCG 2020), Aug 2020, Saskatchewan/Online, Canada. ⟨10.4230/LIPIcs⟩. ⟨hal-03059811⟩



Les métriques sont temporairement indisponibles