Deterministic algorithms for 3-D diameter and some 2-D lower envelopes
From MaRDI portal
Publication:5361540
DOI10.1145/336154.336215zbMath1375.68165MaRDI QIDQ5361540
Publication date: 29 September 2017
Published in: Proceedings of the sixteenth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/336154.336215
68Q25: Analysis of algorithms and problem complexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
An efficient algorithm for the three-dimensional diameter problem, Optimal deterministic algorithms for 2-d and 3-d shallow cuttings, Computing farthest neighbors on a convex polytope.