On algorithmic complexity of imprecise spanners

DOI10.1016/J.COMGEO.2023.102051MaRDI QIDQ6071451zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• The complexity of geodesic spanners
• The complexity of geodesic spanners
• On Spanners of Geometric Graphs
• A geometric spanner of segments
• Geometric Spanner of Segments

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• Geometric Spanner Networks
• Largest and smallest convex hulls for imprecise points
• Largest bounding box, smallest diameter, and related problems on imprecise points
• On the power of the semi-separated pair decomposition
• Preprocessing imprecise points for Delaunay triangulation: simplified and extended
• Region-fault tolerant geometric spanners
• Triangulating input-constrained planar point sets
• Unions of onions: preprocessing imprecise points for fast onion decomposition

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

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