License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-5548
URL: http://drops.dagstuhl.de/opus/volltexte/2006/554/
Chazelle, Bernard ; Liu, Ding ; Magen, Avner

Sublinear Geometric Algorithms

pdf-format:
Dokument 1.pdf (271 KB)

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:DSP:2006:554,
  author =	{Bernard Chazelle and Ding Liu and Avner Magen},
  title =	{Sublinear Geometric Algorithms},
  booktitle =	{Sublinear Algorithms},
  year =	{2006},
  editor =	{Artur Czumaj and S. Muthu Muthukrishnan and Ronitt Rubinfeld and Christian Sohler},
  number =	{05291},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2006/554},
  annote =	{Keywords: Sublinear algorithms, computational geometry}
}

Keywords: Sublinear algorithms, computational geometry
Seminar: 05291 - Sublinear Algorithms
Issue date: 2006
Date of publication: 28.08.2006

DROPS-Home | Fulltext Search | Imprint Published by LZI