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

Main Authors:	Silveira, Rodrigo Ignacio, Speckmann, Bettina, Verbeek, Kevin
Format:	Publication
Language:	English
Published:	Chapman & Hall/CRC 01.01.2019
Subjects:	65 Numerical analysis 65D Numerical approximation and computational geometry Anàlisi numèrica Classificació AMS constrained graph drawing Matemàtiques i estadística Mètodes numèrics non-crossing connectors problem Numerical analysis Àrees temàtiques de la UPC
ISSN:	1462-7264
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!