scientific article
From MaRDI portal
Publication:3796750
zbMath0651.68058MaRDI QIDQ3796750
Micha Sharir, Mark H. Overmars, Leonidas J. Guibas
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational geometryrange searchinggeometric partitioningray shootingpartition treesarrangements of line segments
Analysis of algorithms and problem complexity (68Q25) Other problems of combinatorial convexity (52A37)
Related Items (9)
Computing the intersection-depth to polyhedra ⋮ Properties of a level set algorithm for the visibility problems ⋮ Storing line segments in partition trees ⋮ On counting pairs of intersecting segments and off-line triangle range searching ⋮ New upper bounds for generalized intersection searching problems ⋮ Information-seeking control under visibility-based uncertainty ⋮ Implicitly representing arrangements of lines or segments ⋮ Algorithms for bichromatic line-segment problems and polyhedral terrains ⋮ An improved technique for output-sensitive hidden surface removal
This page was built for publication:
