On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space

DOI10.1137/S0097539792229404MaRDI QIDQ4286233zbMATH OpenFDO

Authors Marco Pellegrini

Publication date 27 March 1994

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539792229404

zbMATH Keywords

arrangementsdata structuresproximitypoint locationparametric searchthree-dimensional spacepolyhedral obstaclescollision-free placementshalf-space range searchingnearest- neighbor problemsPlücker coordinates of lines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On Point Location and Motion Planning among Simplices
• scientific article; zbMATH DE number 1303549
• On point location and motion planning among simplices
• Lines in space: Combinatorics and algorithms
• scientific article; zbMATH DE number 177535

Cited in

(4)

• On counting pairs of intersecting segments and off-line triangle range searching
• Efficient randomized algorithms for some geometric optimization problems
• On lines missing polyhedral sets in 3-space
• On point location and motion planning among simplices

This page was built for publication: On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space

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