A framework for algorithm stability and its application to kinetic Euclidean MSTs

DOI10.1007/978-3-319-77404-6_58MaRDI QIDQ2294738zbMATH OpenOpenAlexWikidataFDO

Authors Wouter Meulemans, Bettina Speckmann, Kevin Verbeek, Jules Wulms

Publication date 12 February 2020

Full work available at URL https://research.tue.nl/nl/publications/bde45eae-314a-42b4-8dca-9a0a420f38e1

Mathematics Subject Classification ID

Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)

Recommendations

• Stable Delaunay graphs
• Topological stability of kinetic \(k\)-centers
• Topological stability of kinetic \(k\)-centers
• Kinetic stable Delaunay graphs
• Kinetic Euclidean minimum spanning tree in the plane

Cited in

(8)

• Euclidean minimum spanning trees with independent and dependent geometric uncertainties
• Topological stability of kinetic \(k\)-centers
• Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties
• The Minimum Moving Spanning Tree Problem
• Average Sensitivity of Graph Algorithms
• Stability analysis of kinetic orientation-based shape descriptors
• Capturing the shape of a point set with a line segment
• The minimum moving spanning tree problem

This page was built for publication: A framework for algorithm stability and its application to kinetic Euclidean MSTs

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