DagSemProc.05291.4.pdf
- Filesize: 271 kB
- 18 pages
Document
Sublinear Geometric Algorithms
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 5291
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2006-08-28
Cite AsGet BibTex
Bernard Chazelle, Ding Liu, and Avner Magen. Sublinear Geometric Algorithms. In Sublinear Algorithms. Dagstuhl Seminar Proceedings, Volume 5291, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
https://doi.org/10.4230/DagSemProc.05291.4
https://doi.org/10.4230/DagSemProc.05291.4
Abstract
We present sublinear algorithms to such problems as Detecting of Polytope intersection, Shortest Path on 3D convex Polytopes and volume approximation.
Keywords
- Sublinear algorithms
- computational geometry
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads