Optimal time-convex hull under the L _p metrics

DOI10.1007/978-3-642-40104-6_24MaRDI QIDQ2842163zbMATH OpenOpenAlexFDO

Authors Bang-Sin Dai, Mong-Jen Kao, Der-Tsai Lee

Publication date 12 August 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40104-6_24

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)

Recommendations

• Optimal time-convex hull for a straight-line highway in L_p-metrics
• Highway hull revisited
• CONSTRUCTING OPTIMAL HIGHWAYS
• Farthest Voronoi diagrams under travel time metrics (extended abstract)
• The 1-\textsc{Center} and 1-\textsc{Highway} problem revisited

Cited in

(3)

• Highway hull revisited
• Optimal time-convex hull for a straight-line highway in L_p-metrics
• Algorithms for subpath convex hull queries and ray-shooting among segments

This page was built for publication: Optimal time-convex hull under the \(L _{p }\) metrics

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