Establishing order in planar subdivisions
From MaRDI portal
Publication:1115185
DOI10.1007/BF02187912zbMath0663.68053MaRDI QIDQ1115185
Publication date: 1988
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131050
planar graph; complexity analysis; planar subdivision; normal digraphs; vertex elimination; endpoint embedding; face contraction; planar realizability
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C10: Planar graphs; geometric and topological aspects of graph theory
05C20: Directed graphs (digraphs), tournaments
Related Items
Checking the convexity of polytopes and the planarity of subdivisions, Determining bar-representability for ordered weighted graphs, On the recognition of fan-planar and maximal outer-fan-planar graphs
Cites Work
- Finding the intersection of two convex polyhedra
- On the complexity of computations under varying sets of primitives
- Lower Bounds for Sorting with Realistic Instruction Sets
- Optimal Point Location in a Monotone Subdivision
- Optimal Search in Planar Subdivisions
- Efficient Planarity Testing
- Location of a Point in a Planar Subdivision and Its Applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item