On algorithmic complexity of imprecise spanners

DOI10.1016/j.comgeo.2023.102051OpenAlexW4385880669MaRDI QIDQ6071451

Abolfazl Poureidi, Mohammad Farshi

Publication date: 23 November 2023

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2023.102051

zbMATH Keywords

dilationgeometric network\(t\)-spannerimprecise pointsimprecise spanner

Mathematics Subject Classification ID

Numerical approximation and computational geometry (primarily algorithms) (65Dxx) Theory of computing (68Qxx) Computing methodologies and applications (68Uxx)

Cites Work

• Unnamed Item
• Preprocessing imprecise points for Delaunay triangulation: simplified and extended
• Largest and smallest convex hulls for imprecise points
• Triangulating input-constrained planar point sets
• Region-fault tolerant geometric spanners
• On the power of the semi-separated pair decomposition
• Largest bounding box, smallest diameter, and related problems on imprecise points
• [https://portal.mardi4nfdi.de/wiki/Publication:2968106 Unions of Onions: Preprocessing Imprecise Points for Fast Onion Decomposition]
• Geometric Spanner Networks
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields

This page was built for publication: On algorithmic complexity of imprecise spanners