Skip to Main content Skip to Navigation
Journal articles

Every Collinear Set in a Planar Graph is Free

Vida Dujmović 1 Fabrizio Frati 2 Daniel Gonçalves 3 Pat Morin 4 Günter Rote 5 
1 SCS - School of computer science [Ottawa]
2 IT - School of Information Technologies [Sydney]
3 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
4 Computational Geometry Lab
5 Institut für Informatik [Berlin]
Keywords : Graph drawing Planar graphs Collinear sets Untangling
Document type :
Journal articles
Complete list of metadata
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03003445
Contributor : Daniel Gonçalves Connect in order to contact the contributor
Submitted on : Friday, November 13, 2020 - 11:25:18 AM
Last modification on : Friday, August 5, 2022 - 3:02:53 PM

Links full text

arxiv

Identifiers

Collections

CNRS | ALGCO | LIRMM | TDS-MACS | MIPS | UNIV-MONTPELLIER

Citation

Vida Dujmović, Fabrizio Frati, Daniel Gonçalves, Pat Morin, Günter Rote. Every Collinear Set in a Planar Graph is Free. Discrete and Computational Geometry, Springer Verlag, 2021, 65 (4), pp.999-1027. ⟨10.1007/s00454-019-00167-x⟩. ⟨lirmm-03003445⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

49