Integer representations of convex polygon intersection graphs

DOI10.1145/1998196.1998248MaRDI QIDQ5404443zbMATH OpenOpenAlexFDO

Authors Tobias Müller, Erik Jan van Leeuwen, J. Van Leeuwen

Publication date 24 March 2014

Published in Proceedings of the twenty-seventh annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://dspace.library.uu.nl/handle/1874/290268

zbMATH Keywords

convex polygonsgeometric intersection graphsinteger representationupper and lower bounds

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Integer representations of convex polygon intersection graphs
• Convex Polygon Intersection Graphs
• Graph Drawing
• Integer realizations of disk and segment graphs
• Intersection graphs of segments

Cited in

(3)

• Convex Polygon Intersection Graphs
• Optimal grid representations
• Integer representations of convex polygon intersection graphs

This page was built for publication: Integer representations of convex polygon intersection graphs

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