Kinetic Pie Delaunay Graph and Its Applications

DOI10.1007/978-3-642-31155-0_5zbMath1357.68258OpenAlexW1880033997MaRDI QIDQ2904542

Mohammad Ali Abam, Zahed Rahmati, Alireza Zarei

Publication date: 14 August 2012

Published in: Algorithm Theory – SWAT 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31155-0_5

zbMATH Keywords

kinetic data structuresEuclidean minimum spanning treeYao graphpie Delaunay triangulation

Mathematics Subject Classification ID

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

Related Items (4)

The Minimum Moving Spanning Tree Problem ⋮ The minimum moving spanning tree problem ⋮ Approximate $k$-Nearest Neighbor Graph on Moving Points ⋮ A simple, faster method for kinetic proximity problems

This page was built for publication: Kinetic Pie Delaunay Graph and Its Applications