Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection

DOI10.1145/1542362.1542376zbMath1388.68284OpenAlexW2076089605MaRDI QIDQ5370702

Eric Y. Chen, Timothy M. Chan

Publication date: 20 October 2017

Published in: Proceedings of the twenty-fifth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1542362.1542376

zbMATH Keywords

Voronoi diagramsconvex hullscache-oblivious algorithmsin-place algorithmssegment intersection

Mathematics Subject Classification ID

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

Related Items (2)

Space-time tradeoffs in negative cycle detection - an empirical analysis of the stressing algorithm ⋮ Partial sums on the ultra-wide word RAM

This page was built for publication: Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection