Every Collinear Set in a Planar Graph is Free

Vida Dujmović; Fabrizio Frati; Daniel Gonçalves; Pat Morin; Günter Rote

doi:10.1007/s00454-019-00167-x

Journal Articles Discrete and Computational Geometry Year : 2021

Every Collinear Set in a Planar Graph is Free

(1) , (2) , (3) , (4) , (5)

1
2
3
4
5

Vida Dujmović

Function : Author

School of computer science [Ottawa]

Fabrizio Frati

Function : Author

School of Information Technologies [Sydney]

Daniel Gonçalves

Function : Author
PersonId : 7100
IdHAL : daniel-goncalves
ORCID : 0000-0003-3228-9622
IdRef : 117629413

Algorithmes, Graphes et Combinatoire

CV

Pat Morin

Function : Author

Computational Geometry Lab

Günter Rote

Function : Author
PersonId : 774648
ORCID : 0000-0002-0351-5945

Institut für Informatik [Berlin]

Keywords

Graph drawing Planar graphs Collinear sets Untangling

Domains

Computational Geometry [cs.CG] Discrete Mathematics [cs.DM]

Daniel Goncalves : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-03003445

Submitted on : Friday, November 13, 2020-11:25:18 AM

Last modification on : Wednesday, July 12, 2023-1:43:14 PM

Dates and versions

lirmm-03003445 , version 1 (13-11-2020)

Identifiers

HAL Id : lirmm-03003445 , version 1
ARXIV : 1811.03432
DOI : 10.1007/s00454-019-00167-x

Cite

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, 2021, 65 (4), pp.999-1027. ⟨10.1007/s00454-019-00167-x⟩. ⟨lirmm-03003445⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

CNRS ALGCO LIRMM TDS-MACS MIPS UNIV-MONTPELLIER ANR

56 View

0 Download

Every Collinear Set in a Planar Graph is Free

Keywords

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share