Minimising line segments in linear diagrams is NP-hard

Autor:	Peter Chapman, Kevin Sim, Huang Hao Chen
Jazyk:	angličtina
Rok vydání:	2022
Předmět:	Human-Computer Interaction Computer Networks and Communications Linear diagrams Complexity Set-based visualisation Software
ISSN:	2590-1184
Popis:	Linear diagrams have been shown to be an effective method of representing set-based data. Moreover, a number of guidelines have been proven to improve the efficacy of linear diagrams. One of these guidelines is to minimise the number of line segments appearing in a diagram. We show this problem to be NP-hard.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::04d9fc55438e25de936cd9df960db926 Zobrazit plný text záznamu Full Text from ScienceDirect