Time-Space Trade-offs for Triangulations and Voronoi Diagrams
From MaRDI portal
Publication:3449845
DOI10.1007/978-3-319-21840-3_40zbMath1417.68240arXiv1507.03403OpenAlexW2963400884MaRDI QIDQ3449845
Paul Seiferth, André van Renssen, Yannik Stein, Wolfgang Mulzer, Marcel Roeloffzen, Matias Korman
Publication date: 30 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.03403
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing a visibility polygon using few variables
- Selection from read-only memory and sorting with minimum data movement
- A deterministic view of random sampling and its use in geometry
- Multi-pass geometric algorithms
- Selection and sorting with limited storage
- Applications of random sampling in computational geometry. II
- Memory-constrained algorithms for simple polygons
- On the identification of the convex hull of a finite set of points in the plane
- Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems
- Optimal Time-Space Tradeoff for the 2D Convex-Hull Problem
- Space-Time Trade-offs for Stack-Based Algorithms
- Triangulating Simple Polygons and Equivalent Problems
- A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
- Optimal Search in Planar Subdivisions
- Priority Queues and Sorting for Read-Only Data
- Towards in-place geometric algorithms and data structures
- Shortest Path in a Polygon using Sublinear Space.
This page was built for publication: Time-Space Trade-offs for Triangulations and Voronoi Diagrams
