Abstract
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.
Work by the first author was done while he was visiting the Freie Universität Berlin, and was partly supported by a Marie Curie scholarship. Research by the second author was supported by the Deutsche Forschungsgemeinschaft within the European graduate program “Combinatorics, Geometry, and Computation” (No. GRK 588/2).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Grigoriev, A., Bodlaender, H.L.: Algorithms for graphs embeddable with few crossings per edge. In: Liśkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, pp. 378–387. Springer, Heidelberg (2005)
Pach, J., Radoicic, R., Tardos, G., Tóth, G.: Improving the crossing lemma by finding more crossings in sparse graphs. In: Proc. 20th ACM Symp. on Computational Geometry (SoCG), Brooklyn, NY, pp. 68–75 (2004)
Pach, J., Tóth, G.: Graphs drawn with few crossings per edge. Combinatorica 17(3), 427–439 (1997)
Dietz, P., Sleator, D.: Two algorithms for maintaining order in a list. In: Proc. 19th Ann. ACM Symp. on Theory of Computing (STOC), NYC, NY, pp. 365–372 (1987)
Schaefer, T.J.: The complexity of satisfiability problems. In: Proc. 10th Ann. ACM Symp. on Theory of Computing (STOC), San Diego, CA, pp. 216–226 (1978)
Tamassia, R., Tollis, I.G.: Algorithms for visibility representations of planar graphs. In: Monien, B., Vidal-Naquet, G. (eds.) STACS 1986. LNCS, vol. 210, pp. 130–141. Springer, Heidelberg (1985)
Even, S.: Graph Algorithms. Computer Science Press (1979)
Even, S., Tarjan, R.E.: Computing an st-numbering. Theoretical Computer Science 2(3), 339–344 (1976)
Habert, L., Pocchiola, M.: A homotopy theorem for arrangements of double pseudolines. In: Proc. 20th European Workshop on Comput. Geom. (EWCG), Delphi, Greece, pp. 211–214 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ackerman, E., Buchin, K., Knauer, C., Rote, G. (2006). Acyclic Orientation of Drawings. In: Arge, L., Freivalds, R. (eds) Algorithm Theory – SWAT 2006. SWAT 2006. Lecture Notes in Computer Science, vol 4059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11785293_26
Download citation
DOI: https://doi.org/10.1007/11785293_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35753-7
Online ISBN: 978-3-540-35755-1
eBook Packages: Computer ScienceComputer Science (R0)