Deformable spanners and applications

DOI10.1145/997817.997848zbMATH Open1377.68276OpenAlexW2107046847MaRDI QIDQ5361671FDOQ5361671

Authors:

Publication date: 29 September 2017

Published in: Proceedings of the twentieth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/997817.997848

Recommendations

• Deformable spanners and applications
• Kinetic spanners in \(\mathbb{R}^d\)
• Kinetic spanners in \(\mathbb R^{d}\)
• A simple and efficient kinetic spanner
• A simple and efficient kinetic spanner

zbMATH Keywords

collision detectionkinetic data structureswell-separated pair decompositionapproximate nearest neighborgeometric \(k\)-centerproximity maintenancespanner graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (16)

• There are plane spanners of degree 4 and moderate stretch factor
• Covering Metric Spaces by Few Trees
• A simple and efficient kinetic spanner
• On approximate geodesic-distance queries amid deforming point clouds
• A simple and efficient kinetic spanner
• Glance: A lightweight querying service for wireless sensor networks
• Title not available (Why is that?)
• Kinetic spanners in \(\mathbb{R}^d\)
• Sparse fault-tolerant spanners for doubling metrics with bounded hop-diameter or degree
• Truly Optimal Euclidean Spanners
• New Doubling Spanners: Better and Simpler
• Covering metric spaces by few trees
• An Optimal Dynamic Spanner for Doubling Metric Spaces
• The greedy spanner is existentially optimal
• Deformable spanners and applications
• The Orthant Neighborhood Graph: A Decentralized Spatial Data Structure for Dynamic Point Sets

This page was built for publication: Deformable spanners and applications

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