Some methods of computational geometry applied to computer graphics
From MaRDI portal
Recommendations
Cited in
(12)- scientific article; zbMATH DE number 18392 (Why is no real title available?)
- scientific article; zbMATH DE number 19025 (Why is no real title available?)
- scientific article; zbMATH DE number 1728317 (Why is no real title available?)
- \(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
- scientific article; zbMATH DE number 1952042 (Why is no real title available?)
- Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric
- Finding pairwise intersections inside a query range
- Parallel algorithms for the segment dragging problem
- Zooming by repeated range detection
- Computer graphics and the geometry of \(S^ 3\)
This page was built for publication: Some methods of computational geometry applied to computer graphics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3735085)