Kinetic Euclidean minimum spanning tree in the plane

DOI10.1007/978-3-642-25011-8_21MaRDI QIDQ3111656zbMATH OpenOpenAlexFDO

Authors Zahed Rahmati, Alireza Zarei

Publication date 13 January 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-25011-8_21

zbMATH Keywords

computational geometryEuclidean minimum spanning treekinetic data structures

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Kinetic Euclidean minimum spanning tree in the plane
• Dynamic Euclidean minimum spanning trees and extrema of binary functions
• The Minimum Moving Spanning Tree Problem
• A simple, faster method for kinetic proximity problems
• Kinetic pie Delaunay graph and its applications

Cited in

(11)

• scientific article; zbMATH DE number 1947377 (Why is no real title available?)
• A segment-tree based kinetic BSP
• Kinetic spanners in \(\mathbb R^{d}\)
• The Minimum Moving Spanning Tree Problem
• Kinetic pie Delaunay graph and its applications
• A simple, faster method for kinetic proximity problems
• A framework for algorithm stability and its application to kinetic Euclidean MSTs
• Kinetic Euclidean minimum spanning tree in the plane
• Kinetic maintenance of mobile \(k\)-centres on trees
• Soft kinetic data structures
• On minimum and maximum spanning trees of linearly moving points

This page was built for publication: Kinetic Euclidean minimum spanning tree in the plane

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