On the public citation graph
Planar drawings and angular resolution: Algorithms and bounds
0 signed · 76 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-55706-7_23openalex-snapshot
How to draw a series-parallel digraph
inferredcites →https://doi.org/10.1007/3-540-57899-4_70openalex-snapshot
A more compact visibility representation
inferredcites →https://doi.org/10.1007/bf02187705openalex-snapshot
A unified approach to visibility representations of planar graphs
inferredcites →https://doi.org/10.1007/bf02187706openalex-snapshot
Rectilinear planar layouts and bipolar orientations of planar graphs
inferredcites →https://doi.org/10.1007/bf02187850openalex-snapshot
Area requirement and symmetry display of planar upward drawings
inferredcites →https://doi.org/10.1016/0020-0190(80)90034-4openalex-snapshot
On the area of binary tree layouts
inferredcites →https://doi.org/10.1016/0925-7721(92)90021-jopenalex-snapshot
A note on optimal area algorithms for upward drawings of binary trees
inferredcites →https://doi.org/10.1016/0925-7721(94)00014-xopenalex-snapshot
Algorithms for drawing graphs: an annotated bibliography
inferredcites →https://doi.org/10.1016/s0020-0190(97)00048-3openalex-snapshot
Area requirement of visibility representations of trees
inferredcites →https://doi.org/10.1109/fscs.1990.89527openalex-snapshot
Drawing graphs in the plane with high resolution
inferredcites →https://doi.org/10.1109/sfcs.1992.267814openalex-snapshot
Drawing planar graphs using the lmc-ordering
inferredcites →https://doi.org/10.1109/tc.1981.6312176openalex-snapshot
Universality considerations in VLSI circuits
inferredcites →https://doi.org/10.1137/s0895480193242931openalex-snapshot
On the Angular Resolution of Planar Graphs
inferredcites →https://doi.org/10.1142/s0218195994000215openalex-snapshot
HOW TO DRAW A SERIES-PARALLEL DIGRAPH
inferredcites →https://doi.org/10.1145/129712.129764openalex-snapshot
On the angular resolution of planar graphs
inferredcites →https://doi.org/10.1145/160985.161165openalex-snapshot
Area-efficient upward tree drawings
inferredcites →https://doi.org/10.1145/167088.167207openalex-snapshot
Angles of planar triangular graphs
inferredcites →https://doi.org/10.1145/62212.62254openalex-snapshot
Small sets supporting fary embeddings of planar graphs
inferredcites →https://doi.org/10.5555/320176.320191openalex-snapshot
Embedding planar graphs on the grid
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1097-024x(200009)30:11<1235::aid-spe339>3.0.co;2-bopenalex-snapshot
Experimental studies on graph drawing algorithms
inferred← citeshttps://doi.org/10.1006/inco.1997.2635openalex-snapshot
Triangulating Planar Graphs While Minimizing the Maximum Degree
inferred← citeshttps://doi.org/10.1006/jagm.2000.1115openalex-snapshot
A Framework for Drawing Planar Graphs with Curves and Polylines
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_12openalex-snapshot
A Framework for Drawing Planar Graphs with Curves and Polylines
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_13openalex-snapshot
Planar Polyline Drawings with Good Angular Resolution
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_22openalex-snapshot
Higher Order Delaunay Triangulations
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_32openalex-snapshot
Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_12openalex-snapshot
Drawing Planar Graphs with Circular Arcs
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_2openalex-snapshot
Turn-Regularity and Planar Orthogonal Drawings
inferred← citeshttps://doi.org/10.1007/3-540-62495-3_39openalex-snapshot
Drawing directed acyclic graphs: An experimental study
inferred← citeshttps://doi.org/10.1007/978-3-030-39881-1_15openalex-snapshot
The Stub Resolution of 1-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-92931-2_25openalex-snapshot
Limitations on Realistic Hyperbolic Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_15openalex-snapshot
Achieving Good Angular Resolution in 3D Arc Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_36openalex-snapshot
Planar and Plane Slope Number of Partial 2-Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_38openalex-snapshot
Drawing Arrangement Graphs in Small Grids, or How to Play Planarity
inferred← citeshttps://doi.org/10.1007/978-3-540-30577-4_28openalex-snapshot
Planar Straight-Line Drawing in an $\mathcal{O}(n)\times \mathcal{O}(n)$ Grid with Angular Resolution $\it \Omega$ (1/n)
inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_25openalex-snapshot
Drawing Graphs with Large Vertices and Thick Edges
inferred← citeshttps://doi.org/10.1007/978-3-540-77537-9_21openalex-snapshot
Minimizing the Area for Planar Straight-Line Grid Drawings
inferred← citeshttps://doi.org/10.1007/978-3-642-18381-2_6openalex-snapshot
The Straight-Line RAC Drawing Problem Is NP-Hard
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_18openalex-snapshot
Lombardi Drawings of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_19openalex-snapshot
Optimal 3D Angular Resolution for Low-Degree Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_27openalex-snapshot
Drawing Planar Graphs of Bounded Degree with Few Slopes
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_34openalex-snapshot
The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_6openalex-snapshot
Maximizing the Total Resolution of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_30openalex-snapshot
Planar and Poly-arc Lombardi Drawings
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_31openalex-snapshot
Force-Directed Lombardi-Style Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_40openalex-snapshot
On the Usability of Lombardi Graph Drawings
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_8openalex-snapshot
A Coloring Algorithm for Disambiguating Graph and Map Drawings
inferred← citeshttps://doi.org/10.1007/978-3-7091-6783-0_3openalex-snapshot
Improving Angular Resolution in Visualizations of Geographic Networks
inferred← citeshttps://doi.org/10.1007/978-981-15-6533-5_10openalex-snapshot
Angular Resolutions: Around Vertices and Crossings
inferred← citeshttps://doi.org/10.1007/bf02086606openalex-snapshot
Drawing Planar Graphs Using the Canonical Ordering
inferred← citeshttps://doi.org/10.1007/s00453-018-00542-9openalex-snapshot
Universal Slope Sets for 1-Bend Planar Drawings
inferred← citeshttps://doi.org/10.1007/s00453-022-01065-0openalex-snapshot
Drawing Partial 2-Trees with Few Slopes
inferred← citeshttps://doi.org/10.1007/s004540010080openalex-snapshot
Drawing planar graphs with circular arcs
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50022-xopenalex-snapshot
Graph Drawing**Work supported in part by the National Science Foundation under grant CCR-9732327, and by the U.S. Army Research Office under grant DAAH04-96-1-0013.
inferred← citeshttps://doi.org/10.1016/j.jvlc.2005.10.003openalex-snapshot
Clustering graphs for visualization via node similarities
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00272-2openalex-snapshot
Advances in the theory and practice of graph drawing
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00027-xopenalex-snapshot
Higher order Delaunay triangulations
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00016-3openalex-snapshot
New results on drawing angle graphs
inferred← citeshttps://doi.org/10.1109/tvcg.2018.2798631openalex-snapshot
A Coloring Algorithm for Disambiguating Graph and Map Drawings
inferred← citeshttps://doi.org/10.1137/s0895480194264010openalex-snapshot
Angles of Planar Triangular Graphs
inferred← citeshttps://doi.org/10.1142/9789812773289_0001openalex-snapshot
Drawing Planar Graphs with Large Vertices and Thick Edges
inferred← citeshttps://doi.org/10.1145/237218.237401openalex-snapshot
Convex drawings of graphs in two and three dimensions (preliminary version)
inferred← citeshttps://doi.org/10.1145/264216.264222openalex-snapshot
An experimental study of the basis for graph drawing algorithms
inferred← citeshttps://doi.org/10.20382/jocg.v9i1a11openalex-snapshot
Planar and Poly-Arc Lombardi Drawings
inferred← citeshttps://doi.org/10.48550/arxiv.1009.2109openalex-snapshot
Maximizing the Total Resolution of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1009.4641openalex-snapshot
Decomposition of Geometric Set Systems and Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1308.6730openalex-snapshot
Achieving Good Angular Resolution in 3D Arc Diagrams
inferred← citeshttps://doi.org/10.48550/arxiv.1409.0436openalex-snapshot
A Coloring Algorithm for Disambiguating Graph and Map Drawings
inferred← citeshttps://doi.org/10.48550/arxiv.1808.03139openalex-snapshot
Low Ply Drawings of Trees and 2-Trees
inferred← citeshttps://doi.org/10.7155/jgaa.00078openalex-snapshot
Drawing Planar Graphs with Large Vertices and Thick Edges
inferred← citeshttps://doi.org/10.7155/jgaa.00152openalex-snapshot
Effects of Sociogram Drawing Conventions and Edge Crossings in Social Network Visualization
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.