DMTCS

2005 International Conference on Analysis of Algorithms

Conrado Martínez (ed.)

DMTCS Conference Volume AD (2005), pp. 39-48


author: Daniel Berend and Vladimir Braverman
title: Convex hull for intersections of random lines
keywords: convex hull, random lines
abstract: The problem of finding the convex hull of the intersection points of random lines was studied in [dt] and [new], and algorithms with expected linear time were found. We improve the previous results of the model in [dt] by giving a universal algorithm for a wider range of distributions.
  If your browser does not display the abstract correctly (because of the different mathematical symbols) you may look it up in the PostScript or PDF files.
reference: Daniel Berend and Vladimir Braverman (2005), Convex hull for intersections of random lines, in 2005 International Conference on Analysis of Algorithms, Conrado Martínez (ed.), Discrete Mathematics and Theoretical Computer Science Proceedings AD, pp. 39-48
bibtex: For a corresponding BibTeX entry, please consider our BibTeX-file.
ps.gz-source: dmAD0105.ps.gz (94 K)
ps-source: dmAD0105.ps (242 K)
pdf-source: dmAD0105.pdf (124 K)

The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.

Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.


Automatically produced on Di Sep 27 10:09:28 CEST 2005 by gustedt