Pages that link to "Item:Q685228"
From MaRDI portal
The following pages link to Parallel algorithms for separation of two sets of points and recognition of digital convex polygons (Q685228):
Displaying 9 items.
- Sequential and parallel algorithms for finding a maximum convex polygon (Q676573) (← links)
- Minimum polygonal separation (Q1101685) (← links)
- Parallel algorithms for some functions of two convex polygons (Q1105374) (← links)
- A parallel algorithm for finding congruent regions (Q1262793) (← links)
- An elementary digital plane recognition algorithm (Q2573245) (← links)
- A fast and elementary algorithm for digital plane recognition (Q3438911) (← links)
- Parallel algorithm for corner finding on digital curves (Q3804230) (← links)
- An optimal algorithm for finding the separation of simple polygons (Q5060097) (← links)
- An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search (Q6102330) (← links)