Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
We describe a new data structure for dynamic nearest neighbor queries in the plane with
respect to a general family of distance functions. These include L_p L p-norms and …
respect to a general family of distance functions. These include L_p L p-norms and …
Disk Intersection Graphs: Models, Data Structures, and Algorithms
P Seiferth - 2016 - refubium.fu-berlin.de
Sei P eine Menge von n Punkten in der Ebene. Der Unit Disk Graph von P, UD (P), hat P als
Knotenmenge. Zwei Knoten p, q bilden eine Kante in UD (P) genau dann, wenn p und q …
Knotenmenge. Zwei Knoten p, q bilden eine Kante in UD (P) genau dann, wenn p und q …
[PDF][PDF] Deletion only dynamic connectivity for disk graphs
H Kaplan, K Klost, K Knorr, W Mulzer… - Proceedings of the 37th … - page.mi.fu-berlin.de
Abstract Let S⊂ R 2 be a set of n sites where s∈ S has an associated radius rs defining a
disk Ds. Then the disk graph D (S) has a vertex for every site and two sites s, t are connected …
disk Ds. Then the disk graph D (S) has a vertex for every site and two sites s, t are connected …