Non-crossing paths with geographic constraints

A geographic network is a graph whose vertices are restricted to lie in a prescribed region in the plane. In this paper we begin to study the following fundamental problem for geographic networks: can a given geographic network be drawn without crossings? We focus on the seemingly simple setting whe...

Full description

Bibliographic Details

Published in:	Discrete mathematics and theoretical computer science Vol. 21 no. 3; no. Discrete Algorithms
Main Authors:	Silveira, Rodrigo I., Speckmann, Bettina, Verbeek, Kevin
Format:	Journal Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 23.05.2019
Subjects:	computer science - computational geometry
ISSN:	1365-8050, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!