Showing cs.CGShow all
2 papers · 1 filter
cs.CG2024
Competitive Searching over Terrains
Sarita de Berg, Nathan van Beusekom, Max van Mulken +2
We study a variant of the searching problem where the environment consists of a known terrain and the goal is to obtain visibility of an unknown target point on the surface of the…
cs.CG2021
Crossing Numbers of Beyond-Planar Graphs Revisited
Nathan van Beusekom, Irene Parada, Bettina Speckmann
Graph drawing beyond planarity focuses on drawings of high visual quality for non-planar graphs which are characterized by certain forbidden edge configurations. A natural criterio…