A note on isosceles planar graph drawing

Authors:
Fabrizio Frati
Affiliations:
Dipartimento di Informatica e Automazione -- Roma Tre University, Italy
Venue:
Information Processing Letters
Year:
2010

Citing 4
Cited 0

Fixed edge-length graph drawing is NP-hard

Discrete Applied Mathematics
On the Angular Resolution of Planar Graphs

SIAM Journal on Discrete Mathematics
Embedding planar graphs on the grid

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Graph drawings with few slopes

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.89

Visualization

Abstract

We show that there exist triangulations that do not admit any planar straight-line drawing in which every face is an isosceles triangle, thus solving a question posed in [Demaine, Mitchell, O'Rourke - The Open Problems Project].