Pages that link to "Item:Q6102330"
From MaRDI portal
The following pages link to An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search (Q6102330):
Displaying 5 items.
- An optimal parallel algorithm for digital curve segmentation (Q1391535) (← links)
- A fast, memory-efficient and parallelizable arc/circle segmentation algorithm (Q2518493) (← links)
- Parallel algorithm for corner finding on digital curves (Q3804230) (← links)
- Line segmentation of digital curves in parallel (Q4596651) (← links)
- Searching for a monotone function by independent threshold queries (Q6487974) (← links)