On Bounded Leg Shortest Paths Problems
- 14 May 2009
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 59 (4), 583-600
- https://doi.org/10.1007/s00453-009-9322-3
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queriesPublished by Association for Computing Machinery (ACM) ,2006
- Approximating geometric bottleneck shortest pathsComputational Geometry, 2004
- Fly Cheaply: On the Minimum Fuel Consumption ProblemJournal of Algorithms, 2001
- Dynamic planar convex hull operations in near-logarithmic amortized timeJournal of the ACM, 2001
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its ApplicationsSIAM Journal on Computing, 2000
- Geometric range searching and its relativesPublished by American Mathematical Society (AMS) ,1999
- Solving query-retrieval problems by compacting Voronoi diagramsPublished by Association for Computing Machinery (ACM) ,1990
- Halfspace range search: An algorithmic application ofk-setsDiscrete & Computational Geometry, 1986
- On the convex layers of a planar setIEEE Transactions on Information Theory, 1985
- Decomposable searching problems I. Static-to-dynamic transformationJournal of Algorithms, 1980