Skip to main navigation Skip to search Skip to main content

Computation of Toroidal Schnyder Woods Made Simple and Fast: From Theory to Practice

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We consider the problem of computing Schnyder woods for graphs embedded on the torus. We design simple linear-time algorithms based on canonical orderings that compute toroidal Schnyder woods for simple toroidal triangulations. The Schnyder woods computed by one of our algorithm are crossing and satisfy an additional structural property: at least two of the mono-chromatic components of the Schnyder wood are connected. We also exhibit experimental results empirically confirming three conjectures involving the structure of toroidal and higher genus Schnyder woods.

Original languageEnglish
Title of host publication41st International Symposium on Computational Geometry, SoCG 2025
EditorsOswin Aichholzer, Haitao Wang
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959773706
DOIs
Publication statusPublished - 20 Jun 2025
Event41st International Symposium on Computational Geometry, SoCG 2025 - Kanazawa, Japan
Duration: 23 Jun 202527 Jun 2025

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume332
ISSN (Print)1868-8969

Conference

Conference41st International Symposium on Computational Geometry, SoCG 2025
Country/TerritoryJapan
CityKanazawa
Period23/06/2527/06/25

Keywords

  • Schnyder woods
  • canonical ordering
  • toroidal triangulations

Fingerprint

Dive into the research topics of 'Computation of Toroidal Schnyder Woods Made Simple and Fast: From Theory to Practice'. Together they form a unique fingerprint.

Cite this