Given a set of pseudosegments in the plane or a topological graph, we ask for an orientation of the pseudosegments or edges which induces an acyclic orientation on the corresponding planar map. Depending on the maximum number of crossings on a pseudosegment or an edge, we provide algorithms and hardness proofs for this problem.
Bibliographical noteFunding Information:
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). A preliminary version of this paper appeared in . E-mail addresses: firstname.lastname@example.org (Eyal Ackerman) email@example.com (Kevin Buchin) firstname.lastname@example.org (Christian Knauer) email@example.com (Günter Rote)
© 2010, Brown University. All rights reserved.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)
- Computer Science Applications
- Geometry and Topology
- Computational Theory and Mathematics