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

DOI10.1145/336154.336215MaRDI QIDQ5361540zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(5)

• Computing farthest neighbors on a convex polytope.
• Bipartite diameter and other measures under translation
• Bipartite diameter and other measures under translation
• An efficient algorithm for the three-dimensional diameter problem
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361540)