Dynamic C-oriented polygonal intersection searching
From MaRDI portal
Publication:3719843
DOI10.1016/S0019-9958(84)80011-XzbMath0591.68061OpenAlexW1971252796MaRDI QIDQ3719843
Publication date: 1984
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(84)80011-x
Related Items
PLANAR STRONG VISIBILITY ⋮ Fundamentals of restricted-orientation convexity ⋮ The intersection searching problem for c-oriented polygons ⋮ Optimization on directionally convex sets ⋮ Optimal computation of finitely oriented convex hulls ⋮ A dynamic fixed windowing problem ⋮ On some union and intersection problems for polygons with fixed orientations