2026-07-27T08:53:49Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:25030 2026-02-09T07:53:52Z ddc:004 open_access

Recovering Graphs from Their Witness Unit Square Representation (Poster Abstract) Löffler, Maarten Staals, Frank Terziadis, Soeren proximity graphs geometric intersection graphs witness representation unit square intersection graph output sensitive algorithm range searching A wUSR of a graph G is a set of unit squares in the plane, one per vertex, if two vertices have an edge in G if their squares overlap and the overlap contains no witness. We present an output sensitive algorithm to compute a graph G based on its given witness unit square representation. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Maarten Löffler and Frank Staals and Soeren Terziadis 2025 Is Part Of LIPIcs, Volume 357, 33rd International Symposium on Graph Drawing and Network Visualization (GD 2025) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.GD.2025.44 urn:nbn:de:0030-drops-250306 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2025.44 eng https://creativecommons.org/licenses/by/4.0/legalcode