Pages that link to "Item:Q1175650"
From MaRDI portal
The following pages link to Computational geometry algorithms for the systolic screen (Q1175650):
Displaying 10 items.
- VLSI systems for some problems of computational geometry (Q1057047) (← links)
- Systolic algorithms for rectilinear polygons (Q1108798) (← links)
- Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region (Q1111022) (← links)
- Systolic algorithms for computational geometry problems - a survey (Q1121668) (← links)
- Optimal geometric algorithms for digitized images on fixed-size linear arrays and scan-line arrays (Q1176071) (← links)
- Parallel computational geometry of rectangles (Q1187198) (← links)
- Constant time BSR solutions to \(L_ 1\) metric and digital geometry problems (Q1898084) (← links)
- A nearest neighbor sweep circle algorithm for computing discrete Voronoi tessellations (Q2381920) (← links)
- Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles (Q3608310) (← links)
- Géométrie systolique et technique de régularisation (Q5365471) (← links)
