Pages that link to "Item:Q672744"

The following pages link to Two linear time Union--Find strategies for image processing (Q672744):

Displaying 8 items.

• Efficient Union-Find for planar graphs and other sparse graph classes (Q1274324) (← links)
• Efficient region segmentation on compressed gray images using quadtree and shading representation (Q1764075) (← links)
• Fast connected-component labeling (Q2270831) (← links)
• Comparative study and proof of single-pass connected components algorithms (Q2331087) (← links)
• Semi-supervised statistical region refinement for color image segmentation (Q2485064) (← links)
• The longest common substring problem (Q2971067) (← links)
• Memory management for Union-Find algorithms (Q5047160) (← links)
• A hole-filling based approach to controlling structural complexity in topology optimization (Q6084540) (← links)