Kinetic spanners in R^d

DOI10.1007/S00454-011-9343-YzbMATH Open1216.68312OpenAlexW4238697024MaRDI QIDQ540440FDOQ540440

Authors Mohammad A. Abam, Mark de Berg 

Publication date 3 June 2011

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00454-011-9343-y

zbMATH Keywords

geometric spannerskinetic data structures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Combinatorial complexity of geometric structures (52C45)

Recommendations

• Kinetic spanners in \(\mathbb{R}^d\)
• Static and kinetic geometric spanners with applications
• Kinematic Relations for Hausdorff Moment Measures in Spherical Spaces
• Kinetic Euclidean minimum spanning tree in the plane
• Kinetic Euclidean minimum spanning tree in the plane
• A new class of kinematic spaces
• Kinematic spaces with dilatations
• An Optimal Dynamic Spanner for Doubling Metric Spaces
• scientific article; zbMATH DE number 3445960
• Kinetic Poincaré inequalities

Cites Work

• scientific article; zbMATH DE number 434498 (Why is no real title available?)
• scientific article; zbMATH DE number 3887061 (Why is no real title available?)
• scientific article; zbMATH DE number 5764857 (Why is no real title available?)
• scientific article; zbMATH DE number 4070353 (Why is no real title available?)
• scientific article; zbMATH DE number 732977 (Why is no real title available?)
• scientific article; zbMATH DE number 1501063 (Why is no real title available?)
• scientific article; zbMATH DE number 1424297 (Why is no real title available?)
• A segment-tree based kinetic BSP
• A simple and efficient kinetic spanner
• Adding range restriction capability to dynamic data structures
• An Optimal Dynamic Spanner for Doubling Metric Spaces
• Computational geometry. Algorithms and applications.
• Data Structures for Mobile Data
• Deformable spanners and applications
• Fully dynamic geometric spanners
• Geometric Spanner Networks
• Kinetic KD-trees and longest-side KD-trees
• Ordered theta graphs

Cited In (15)

• Geodesic spanners for points on a polyhedral terrain
• Vertex fault-tolerant spanners for weighted points in polygonal domains
• Geometric spanner games
• Geodesic spanners for points in \(\mathbb{R}^3\) amid axis-parallel boxes
• A simple and efficient kinetic spanner
• Kinetic \(k\)-semi-Yao graph and its applications
• Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions
• Vertex Fault-Tolerant Geometric Spanners for Weighted Points
• Kinetic reverse \(k\)-nearest neighbor problem
• A simple and efficient kinetic spanner
• Kinetic spanners in \(\mathbb{R}^d\)
• Fully dynamic geometric spanners
• Static and kinetic geometric spanners with applications
• Approximate $k$-Nearest Neighbor Graph on Moving Points
• Deformable spanners and applications

This page was built for publication: Kinetic spanners in \(\mathbb R^{d}\)

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