Bottleneck detour tree of points on a path

DOI10.1016/J.COMGEO.2019.01.005zbMATH Open1468.68259OpenAlexW2911226769WikidataQ128588007 ScholiaQ128588007MaRDI QIDQ670710FDOQ670710

Authors: Greg Aloupis, Paz Carmi, Lilach Chaitman-Yerushalmi, Matthew J. Katz, Stefan Langerman 

Publication date: 20 March 2019

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

Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/283610/5/DetourBN.pdf

Recommendations

• Approximating geometric bottleneck shortest paths
• Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
• scientific article
• scientific article; zbMATH DE number 1962800
• A fast algorithm for approximating the detour of a polygonal chain.

zbMATH Keywords

randomized algorithmdetourbottleneck spanning treepolygonal path

Mathematics Subject Classification ID

Randomized algorithms (68W20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Concrete and abstract Voronoi diagrams
• FURTHEST SITE ABSTRACT VORONOI DIAGRAMS
• The upper envelope of Voronoi surfaces and its applications
• Optimal Search in Planar Subdivisions
• New Results on Dynamic Planar Point Location
• Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D

Cited In (2)

• Approximating geometric bottleneck shortest paths
• The tree longest detour problem in a biconnected graph.

This page was built for publication: Bottleneck detour tree of points on a path

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