Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 367-384 |
| Number of pages | 18 |
| Journal | Journal of Graph Algorithms and Applications |
| Volume | 14 |
| Issue number | 2 |
| DOIs | |
| State | Published - 2010 |
Bibliographical note
Publisher Copyright:© 2010, Brown University. All rights reserved.
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science
- Computer Science Applications
- Geometry and Topology
- Computational Theory and Mathematics