Kinetic Euclidean Minimum Spanning Tree in the Plane

DOI10.1007/978-3-642-25011-8_21zbMath1344.68263OpenAlexW2062734536MaRDI QIDQ3111656

Alireza Zarei, Zahed Rahmati

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 geometrykinetic data structuresEuclidean minimum spanning tree

Mathematics Subject Classification ID

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

This page was built for publication: Kinetic Euclidean Minimum Spanning Tree in the Plane