Lines in space - combinatorics, algorithms and applications

Bernard Chazelle*, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We study combinatorial and algorithmic problems involving arrangements of n lines in 3-dimensional space, and then present applications of our results to a variety of problems on polyhedral terrains. The tools used to obtain the results include Pluecker coordinates for lines in space, random sampling in geometric problems, and a new variant of segment trees.

Original languageEnglish
Title of host publicationProc Twenty First Annu ACM Symp Theory Comput
PublisherAssociation for Computing Machinery (ACM)
Pages382-393
Number of pages12
ISBN (Print)0897913078
StatePublished - 1989
Externally publishedYes
EventProceedings of the Twenty First Annual ACM Symposium on Theory of Computing - Seattle, WA, USA
Duration: 15 May 198917 May 1989

Publication series

NameProc Twenty First Annu ACM Symp Theory Comput

Conference

ConferenceProceedings of the Twenty First Annual ACM Symposium on Theory of Computing
CitySeattle, WA, USA
Period15/05/8917/05/89

Fingerprint

Dive into the research topics of 'Lines in space - combinatorics, algorithms and applications'. Together they form a unique fingerprint.

Cite this