Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems-Reference-Cited by-同舟云学术

Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems

Published:2013 Issue: Volume: Page:61-72
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Asano Tetsuo,Kirkpatrick David

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-40104-6_6

Reference8 articles.

1. Lecture Notes in Computer Science;T. Asano,2009

2. Asano, T., Buchin, K., Buchin, M., Korman, M., Mulzer, W., Rota, G., Schultz, A.: Memory-constrained algorithms for simple polygons. In: 28th European Workshop on Computational Geometry (EuroCG), Booklet of Abstracts, pp. 49–52 (2012)

3. Asano, T., Mulzer, W., Rote, G., Wang, Y.: Constant-work-space algorithms for geometric problems. Journal of Computational Geometry 2(1), 46–68 (2011)

4. Barba, L., Korman, M., Langerman, S., Sadakane, K., Silveira, R.I.: Space-time trade-offs for stack-based algorithms. Proc. STACS, pp. 281–292 (2013)

5. Bose, P., Morin, P.: An improved algorithm for subdivision traversal without extra storage. International Journal of Computational Geometry & Applications 12(4), 297–308 (2002)

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-Off Algorithms;Algorithmica;2019-03-11

2. Time–space trade-offs for triangulations and Voronoi diagrams;Computational Geometry;2018-08

3. Computational Geometry Column 67;ACM SIGACT News;2018-06-13

4. A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon;International Journal of Foundations of Computer Science;2018-04

5. Encoding nearest larger values;Theoretical Computer Science;2018-02