Computational Geometry · Computer Science
Optimal 3D Angular Resolution for Low-Degree Graphs
David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg
2015-07-16
Data Structures and Algorithms · Computer Science
Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis
2022-05-10
Computational Geometry · Computer Science
One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons
Patrizio Angelini, Philipp Kindermann, Andre Löffler, Lena Schlipf +1
2021-08-30
Data Structures and Algorithms · Computer Science
Planar Octilinear Drawings with One Bend Per Edge
Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Robert Krug
2014-08-27
Data Structures and Algorithms · Computer Science
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
Walter Didimo, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani
2019-10-28
Combinatorics · Mathematics
Graphs with the edge metric dimension smaller than the metric dimension
Martin Knor, Snjezana Majstorovic, Aoden Teo Masa Toshi, Riste Skrekovski +1
2020-06-23
Data Structures and Algorithms · Computer Science
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles
Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase +1
2011-07-26
Computational Geometry · Computer Science
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles
Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz
2018-08-28
Computational Geometry · Computer Science
Colored Point-set Embeddings of Acyclic Graphs
Emilio Di Giacomo, Leszek Gasieniec, Giuseppe Liotta, Alfredo Navarra
2017-08-31
Computational Geometry · Computer Science
Optimal Orthogonal Drawings in Linear Time
Walter Didimo, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani
2025-02-06