Computational geometry: an introduction
Computational geometry: an introduction
Fundamentals of planar ordered sets
Discrete Mathematics
Algorithms for plane representations of acyclic digraphs
Theoretical Computer Science
Triangulating a simple polygon in linear time
Discrete & Computational Geometry
Algorithms for drawing graphs: an annotated bibliography
Computational Geometry: Theory and Applications
Checking geometric programs or verification of geometric structures
Proceedings of the twelfth annual symposium on Computational geometry
Robust proximity queries: an illustration of degree-driven algorithm design
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
SIAM Journal on Computing
Triangulation and shape-complexity
ACM Transactions on Graphics (TOG)
Checking the Convexity of Polytopes and the Planarity of Subdivisions (Extended Abstract)
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Fast Triangulation of Simple Polygons
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Fractal Merkle tree representation and traversal
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Computing upward planar drawings using switch-regularity heuristics
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Fixed-Parameter tractable algorithms for testing upward planarity
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Indexing information for data forensics
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Switch-Regular upward planar embeddings of trees
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
| Hi-index | 0.00 |
In this paper we look at upward planarity from a new perspective. Namely, we study the problem of checking whether a given drawing is upward planar. Our checker exploits the relationships between topology and geometry of upward planar drawings to verify the upward planarity of a significant family of drawings. The checker is simple and optimal both in terms of efficiency and in terms of degree.