APPROXIMATING 3D POINTS WITH CYLINDRICAL SEGMENTS

DOI10.1142/S0218195904001421zbMath1061.68173OpenAlexW2099545437MaRDI QIDQ4652928

Binhai Zhu

Publication date: 28 February 2005

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195904001421

zbMATH Keywords

NP-hardnessbiological modelingneural maps

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Approximating the diameter of a set of points in the Euclidean space
• A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center
• On the complexity of locating linear facilities in the plane
• A subexponential bound for linear programming
• Computing Envelopes in Four Dimensions with Applications

This page was built for publication: APPROXIMATING 3D POINTS WITH CYLINDRICAL SEGMENTS