Pages that link to "Item:Q3735085"
From MaRDI portal
The following pages link to Some methods of computational geometry applied to computer graphics (Q3735085):
Displaying 12 items.
- Parallel algorithms for the segment dragging problem (Q918740) (← links)
- Fast dynamic intersection searching in a set of isothetic line segments (Q1065550) (← links)
- Computer graphics and the geometry of \(S^ 3\) (Q1085840) (← links)
- Zooming by repeated range detection (Q1098306) (← links)
- \(L_ 1\) shortest paths among polygonal obstacles in the plane (Q1188116) (← links)
- Finding pairwise intersections inside a query range (Q1755743) (← links)
- (Q2779381) (← links)
- Finding Pairwise Intersections Inside a Query Range (Q3449820) (← links)
- (Q3975781) (← links)
- (Q3976451) (← links)
- (Q4413921) (← links)
- Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric (Q5056105) (← links)