Dynamic connectivity in disk graphs

DOI10.4230/LIPICS.SOCG.2022.49MaRDI QIDQ6539555zbMATH OpenFDO

Authors Haim Kaplan, Alexander Kauer, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth

Publication date 14 May 2024

zbMATH Keywords

connectivitydisk graphslower envelopes

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Dynamic connectivity in disk graphs
• Kinetic connectivity for unit disks
• Dynamic connectivity: connecting to networks and geometry
• Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
• Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications

Cited in

(2)

• Dynamic connectivity in disk graphs
• Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead

This page was built for publication: Dynamic connectivity in disk graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6539555)