On Intersection Graphs of Convex Polygons

DOI10.1007/978-3-319-07148-0_4zbMath1487.68242OpenAlexW182651542MaRDI QIDQ5246050

Matthew Szczepankiewicz, Valentin E. Brimkov, Sean Kafer, Joshua Terhaar

Publication date: 17 April 2015

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-07148-0_4

zbMATH Keywords

convex polygonintersection graphmaximal cliquehomothetic polygons

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Homothetic polygons and beyond: maximal cliques in intersection graphs

This page was built for publication: On Intersection Graphs of Convex Polygons