Some methods of computational geometry applied to computer graphics
From MaRDI portal
Publication:3735085
DOI10.1016/0734-189X(84)90142-7zbMath0599.68048OpenAlexW1997308325MaRDI QIDQ3735085
Raimund Seidel, Mark H. Overmars, Herbert Edelsbrunner
Publication date: 1984
Published in: Computer Vision, Graphics, and Image Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0734-189x(84)90142-7
Related Items
Finding Pairwise Intersections Inside a Query Range, Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric, Zooming by repeated range detection, Parallel algorithms for the segment dragging problem, \(L_ 1\) shortest paths among polygonal obstacles in the plane, Finding pairwise intersections inside a query range, Fast dynamic intersection searching in a set of isothetic line segments