Lines through segments in 3D space

Efi Fogel*, Michael Hemmer, Asaf Porat, Dan Halperin

*Corresponding author for this work

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

1 Scopus citations

Abstract

Given a set of n line segments in three-dimensional space, finding all the lines that simultaneously intersect at least four line segments in is a fundamental problem that arises in a variety of domains. We refer to this problem as the lines-through-segments problem, or LTS for short. We present an efficient output-sensitive algorithm and its implementation to solve the LTS problem. The implementation is exact and properly handles all degenerate cases. To the best of our knowledge, this is the first implementation for the LTS problem that is (i) output sensitive and (ii) handles all degenerate cases. The algorithm runs in O((n 3 + I)logn) time, where I is the output size, and requires O(nlogn + J) working space, where J is the maximum number of output elements that intersect two fixed line segments; I and J are bounded by O(n 4) and O(n 2), respectively. We use Cgal arrangements and in particular its support for two-dimensional arrangements in the plane and on the sphere in our implementation. The efficiency of our implementation stems in part from careful crafting of the algebraic tools needed in the computation. We also report on the performance of our algorithm and its implementation compared to others. The source code of the LTS program as well as the input examples for the experiments can be obtained from http://acg.cs.tau.ac.il/ projects/lts.

Original languageEnglish
Title of host publicationAlgorithms, ESA 2012 - 20th Annual European Symposium, Proceedings
Pages455-466
Number of pages12
DOIs
StatePublished - 2012
Event20th Annual European Symposium on Algorithms, ESA 2012 - Ljubljana, Slovenia
Duration: 10 Sep 201212 Sep 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7501 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference20th Annual European Symposium on Algorithms, ESA 2012
Country/TerritorySlovenia
CityLjubljana
Period10/09/1212/09/12

Funding

FundersFunder number
Seventh Framework Programme255827

    Fingerprint

    Dive into the research topics of 'Lines through segments in 3D space'. Together they form a unique fingerprint.

    Cite this