On lines missing polyhedral sets in 3-space
type: Item
instance of: scholarly article
title: On lines missing polyhedral sets in 3-space
zbMATH Open document ID: 0822.68111
DOI: 10.1007/BF02574376
published in: Discrete \& Computational Geometry
publication date: 1994-09-26T00:00:00Z
full work available at URL: https://eudml.org/doc/131327
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 644707
zbMATH Keywords: computational geometry
author: Marco Pellegrini
MaRDI profile type: Publication
cites work: Q3231796
cites work: On the sum of squares of cell complexities in hyperplane arrangements
cites work: Algorithms for bichromatic line-segment problems and polyhedral terrains
cites work: A deterministic view of random sampling and its use in geometry
cites work: New applications of random sampling in computational geometry
cites work: Q3772828
cites work: The complexity and construction of many faces in arrangements of lines and of segments
cites work: New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
cites work: Construction of \(\epsilon\)-nets
cites work: Reporting points in halfspaces
cites work: Linear Programming in Linear Time When the Dimension Is Fixed
cites work: Separating a polyhedron by one translation from a set of obstacles
cites work: Ray shooting on triangles in 3-space
cites work: On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space
cites work: Finding stabbing lines in 3-space
cites work: Q3992847
cites work: Q3716330
description: scientific article; zbMATH DE number 644707