Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, Ignaz Rutter
{"title":"On $k$-Plane Insertion into Plane Drawings","authors":"Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, Ignaz Rutter","doi":"arxiv-2402.14552","DOIUrl":null,"url":null,"abstract":"We introduce the $k$-Plane Insertion into Plane drawing ($k$-PIP) problem:\ngiven a plane drawing of a planar graph $G$ and a set of edges $F$, insert the\nedges in $F$ into the drawing such that the resulting drawing is $k$-plane. In\nthis paper, we focus on the $1$-PIP scenario. We present a linear-time\nalgorithm for the case that $G$ is a triangulation, while proving\nNP-completeness for the case that $G$ is biconnected and $F$ forms a path or a\nmatching.","PeriodicalId":501570,"journal":{"name":"arXiv - CS - Computational Geometry","volume":"12 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Computational Geometry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2402.14552","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We introduce the $k$-Plane Insertion into Plane drawing ($k$-PIP) problem:
given a plane drawing of a planar graph $G$ and a set of edges $F$, insert the
edges in $F$ into the drawing such that the resulting drawing is $k$-plane. In
this paper, we focus on the $1$-PIP scenario. We present a linear-time
algorithm for the case that $G$ is a triangulation, while proving
NP-completeness for the case that $G$ is biconnected and $F$ forms a path or a
matching.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
