Creative Commons Attribution 4.0 license (CC BY 4.0)when quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.05291.4
URN: urn:nbn:de:0030-drops-5548
URL: https://drops.dagstuhl.de/opus/volltexte/2006/554/
Chazelle, Bernard ; Liu, Ding ; Magen, Avner
Sublinear Geometric Algorithms
| pdf-format: |
|
Abstract
We present sublinear algorithms to such problems as Detecting of Polytope intersection, Shortest Path on 3D convex Polytopes and volume approximation.
BibTeX - Entry
@InProceedings{chazelle_et_al:DagSemProc.05291.4,
author = {Chazelle, Bernard and Liu, Ding and Magen, Avner},
title = {{Sublinear Geometric Algorithms}},
booktitle = {Sublinear Algorithms},
pages = {1--18},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {5291},
editor = {Artur Czumaj and S. Muthu Muthukrishnan and Ronitt Rubinfeld and Christian Sohler},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2006/554},
URN = {urn:nbn:de:0030-drops-5548},
doi = {10.4230/DagSemProc.05291.4},
annote = {Keywords: Sublinear algorithms, computational geometry}
}
| Keywords: | Sublinear algorithms, computational geometry | |
| Seminar: | 05291 - Sublinear Algorithms | |
| Issue date: | 2006 | |
| Date of publication: | 28.08.2006 |
