Pages that link to "Item:Q2518493"
From MaRDI portal
The following pages link to A fast, memory-efficient and parallelizable arc/circle segmentation algorithm (Q2518493):
Displaying 4 items.
- An optimal parallel algorithm for digital curve segmentation (Q1391535) (← links)
- An elementary algorithm for digital arc segmentation (Q1827813) (← links)
- Parallel edge-region-based segmentation algorithm targeted at reconfigurable MultiRing network (Q1870277) (← links)
- Fast circular arc segmentation based on approximate circularity and cuboid graph (Q2251258) (← links)