Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
cs-312:project-4 [2015/02/24 21:53]
ryancha
cs-312:project-4 [2015/02/24 21:59] (current)
ryancha
Line 32: Line 32:
 The Simple Scissors algorithm does not use Dijkstra’s algorithm. Instead, at each vertex (pixel, point, node) along the path, this algorithm simply chooses the edge to the neighboring pixel in a greedy fashion until the goal is reached or the path cannot continue. ​ The next pixel is chosen by selecting the immediate neighbor with the smallest weight that has not been previously visited. ​ When two or more directions have equal weight, ties should be broken as follows: ​ Prefer pixels in clockwise order, starting with the pixel to the north (upwards in the image; lower y-coordinate). ​ If there is no unvisited neighbor (i.e., all four neighbors have been previously visited), then the path necessarily ends in a dead end.  For example, the Simple Scissors algorithm in Figure 1 has become stuck in a dead end on the cheek-bone. ​ When the path ends in this manner, the algorithm should draw up to the dead end, reset its state, and continue searching at the next segmentation point. ​ Simple Scissors is a very greedy algorithm, and it's not very intelligent! ​ As you can see, Simple Scissors will not always work properly due to its unintelligent "​greedy"​ nature. The Simple Scissors algorithm does not use Dijkstra’s algorithm. Instead, at each vertex (pixel, point, node) along the path, this algorithm simply chooses the edge to the neighboring pixel in a greedy fashion until the goal is reached or the path cannot continue. ​ The next pixel is chosen by selecting the immediate neighbor with the smallest weight that has not been previously visited. ​ When two or more directions have equal weight, ties should be broken as follows: ​ Prefer pixels in clockwise order, starting with the pixel to the north (upwards in the image; lower y-coordinate). ​ If there is no unvisited neighbor (i.e., all four neighbors have been previously visited), then the path necessarily ends in a dead end.  For example, the Simple Scissors algorithm in Figure 1 has become stuck in a dead end on the cheek-bone. ​ When the path ends in this manner, the algorithm should draw up to the dead end, reset its state, and continue searching at the next segmentation point. ​ Simple Scissors is a very greedy algorithm, and it's not very intelligent! ​ As you can see, Simple Scissors will not always work properly due to its unintelligent "​greedy"​ nature.
  
-<​html><​center></​html>​[[media: ​ cs-312: project-4: 400px-intelligentscissors1.png]]<​html></​center></​html>​+[[media: ​ cs-312: project-4: 400px-intelligentscissors1.png]]
 ==  “Intelligent Scissors” Using On-the-Fly, Single-Goal Dijkstra’s Algorithm == ==  “Intelligent Scissors” Using On-the-Fly, Single-Goal Dijkstra’s Algorithm ==
  
cs-312/project-4.txt · Last modified: 2015/02/24 21:59 by ryancha
Back to top
CC Attribution-Share Alike 4.0 International
chimeric.de = chi`s home Valid CSS Driven by DokuWiki do yourself a favour and use a real browser - get firefox!! Recent changes RSS feed Valid XHTML 1.0