Line segment covering of cells in arrangements

DOI10.1007/978-3-319-26626-8_12MaRDI QIDQ6828514zbMATH OpenFDO

Authors Matias Korman, Sheung-Hung Poon, Marcel Roeloffzen

Publication date 5 February 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-26626-8_12

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)

This page was built for publication: Line segment covering of cells in arrangements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6828514)