On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space
From MaRDI portal
Publication:4286233
DOI10.1137/S0097539792229404zbMath0802.68153MaRDI QIDQ4286233
Publication date: 27 March 1994
Published in: SIAM Journal on Computing (Search for Journal in Brave)
arrangementsdata structuresproximityparametric searchthree-dimensional spacepoint locationpolyhedral obstaclescollision-free placementshalf-space range searchingnearest- neighbor problemsPlücker coordinates of lines
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (3)
On lines missing polyhedral sets in 3-space ⋮ On counting pairs of intersecting segments and off-line triangle range searching ⋮ Efficient randomized algorithms for some geometric optimization problems
This page was built for publication: On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space
