Showing cs.CGShow all
2 papers · 1 filter
cs.CG2024
Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs
Ivor van der Hoog, André Nusser, Eva Rotenberg +1
A classical problem in computational geometry and graph algorithms is: given a dynamic set S of geometric shapes in the plane, efficiently maintain the connectivity of the intersec…
cs.CG2015
Mixed Map Labeling
Maarten Löffler, Martin Nöllenburg, Frank Staals
Point feature map labeling is a geometric problem, in which a set of input points must be labeled with a set of disjoint rectangles (the bounding boxes of the label texts). Typical…