Acyclic orientation of drawings

Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote

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


Given a set of curves in the plane or a topological graph, we ask for an orientation of the curves or edges which induces an acyclic orientation on the corresponding planar map. Depending on the maximum number of crossings on a curve or an edge, we provide algorithms and hardness proofs for this problem.

Original languageEnglish
Title of host publicationBiomedical Simulation - Third International Symposium, ISBMS 2006, Proceedings
PublisherSpringer Verlag
Number of pages12
ISBN (Print)354035753X, 9783540357537
StatePublished - 2006
Externally publishedYes
Event10th Scandinavian Workshop on Algorithm Theory, SWAT 2006 - Riga, Latvia
Duration: 6 Jul 20068 Jul 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4059 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference10th Scandinavian Workshop on Algorithm Theory, SWAT 2006

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Acyclic orientation of drawings'. Together they form a unique fingerprint.

Cite this