Deterministic algorithms for 3-D diameter and some 2-D lower envelopes

DOI10.1145/336154.336215zbMath1375.68165OpenAlexW1966689742MaRDI QIDQ5361540

Edgar A. Ramos

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

Bipartite diameter and other measures under translation ⋮ Computing farthest neighbors on a convex polytope. ⋮ An efficient algorithm for the three-dimensional diameter problem ⋮ Unnamed Item ⋮ Optimal deterministic algorithms for 2-d and 3-d shallow cuttings

This page was built for publication: Deterministic algorithms for 3-D diameter and some 2-D lower envelopes