Lines in space: Combinatorics and algorithms

DOI10.1007/BF01955043zbMATH Open0846.68098MaRDI QIDQ1913699FDOQ1913699

Leonidas Guibas, Herbert Edelsbrunner, Jorge Stolfi, Bernard Chazelle, Micha Sharir

Publication date: 27 May 1996

Published in: Algorithmica (Search for Journal in Brave)

Recommendations

• On lines missing polyhedral sets in 3-space
• scientific article
• scientific article

zbMATH Keywords

computational geometry

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• \(\epsilon\)-nets and simplex range queries
• New applications of random sampling in computational geometry
• Applications of random sampling in computational geometry. II
• On the Betti Numbers of Real Varieties
• A deterministic view of random sampling and its use in geometry
• The complexity of many cells in arrangements of planes and related problems
• Combinatorial complexity bounds for arrangements of curves and spheres
• The complexity and construction of many faces in arrangements of lines and of segments
• Title not available (Why is that?)
• Title not available (Why is that?)
• Counting and cutting cycles of lines and rods in space
• On joints in arrangements of lines in space and related problems
• On \(k\)-sets in arrangements of curves and surfaces
• Title not available (Why is that?)
• Construction of \(\epsilon\)-nets
• Cutting hyperplane arrangements
• Weaving patterns of lines and line segments in space
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (28)

• Algorithms for bichromatic line-segment problems and polyhedral terrains
• The power of parallel projection
• Configuration spaces of spatial linkages: Taking Collisions Into Account
• Ray shooting and stone throwing with near-linear storage
• On the complexity of sets of free lines and line segments among balls in three dimensions
• Bisecting three classes of lines
• Title not available (Why is that?)
• Improved Bounds for Incidences Between Points and Circles
• REGION INTERVISIBILITY IN TERRAINS
• Applications of a new space-partitioning technique
• Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
• The union of moving polygonal pseudodiscs -- combinatorial bounds and applications
• On range searching with semialgebraic sets
• On lines missing polyhedral sets in 3-space
• Line problems in nonlinear computational geometry
• Generalized hidden surface removal
• Point location in zones of \(k\)-flats in arrangements
• Clamshell casting
• Crossing patterns of semi-algebraic sets
• Title not available (Why is that?)
• On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space
• Finding stabbing lines in 3-space
• Almost tight upper bounds for lower envelopes in higher dimensions
• Counting and cutting cycles of lines and rods in space
• Partitioning arrangements of lines. II: Applications
• On Ray Shooting for Triangles in 3-Space and Related Problems
• On joints in arrangements of lines in space and related problems
• Title not available (Why is that?)

This page was built for publication: Lines in space: Combinatorics and algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1913699)