![](/common/images/spacer.gif)
![Wolfram Library Archive](/images/database/subheader.gif)
![](/common/images/spacer.gif) |
![](/common/images/spacer.gif) |
![](/common/images/spacer.gif) |
![](/common/images/spacer.gif) |
![](/common/images/spacer.gif) |
![](/common/images/spacer.gif) |
![Downloads](/images/database/downloads-top.gif) |
![](/images/database/grey-line.gif) |
![](/common/images/spacer.gif) |
![](/common/images/spacer.gif) Ordered Heaps and the Fast Marching Method
![](/common/images/spacer.gif) |
![](/common/images/spacer.gif) |
![](/common/images/spacer.gif) |
![](/images/database/grey-line.gif) |
![](/images/database/grey-line.gif) |
![](/common/images/spacer.gif) |
![](/common/images/spacer.gif)
Organization: | Wolfram Research, Inc. |
![](/common/images/spacer.gif) |
![](/common/images/spacer.gif) |
![](/common/images/spacer.gif) |
![](/images/database/grey-line.gif) |
![](/images/database/grey-line.gif) |
![](/common/images/spacer.gif) |
![](/common/images/spacer.gif) This talk will explore in some detail a particular structure that seems to receive scant attention within the Mathematica community.
Ordered heaps are data structures one uses when rapid access is needed to a "first" element, and one must also be able to add new elements. A classical application is to sorting a set according to some ordering on a the domain in which the elements live. Another application is to solving a type of numerical PDE via Sethian's "fast marching method". A simple example, shape offsetting, is to find equidistant curves to a given planar curve. We illustrate these two applications in this talk.
![](/common/images/spacer.gif) |
![](/common/images/spacer.gif) |
![](/common/images/spacer.gif) |
![](/images/database/grey-line.gif) |
![](/images/database/grey-line.gif) |
![](/common/images/spacer.gif) |
![](/common/images/spacer.gif)
![](/common/images/spacer.gif) |
![](/common/images/spacer.gif) |
![](/common/images/spacer.gif) |
![](/images/database/grey-line.gif) |
![](/images/database/grey-line.gif) |
![](/common/images/spacer.gif) |
![](/common/images/spacer.gif) Binary Tree, Data Structures, Heap Sort, Ordered Heap, Sethian's "fast marching method"
![](/common/images/spacer.gif) |
![](/common/images/spacer.gif) |
![](/common/images/spacer.gif) |
![](/images/database/download-cdf-player.gif) |
![](/images/database/grey-line.gif) |
![](/common/images/spacer.gif) |
![](/common/images/spacer.gif)
| HeapAndFastMarchingTalk.nb (962.3 KB) - Mathematica Notebook |
![](/common/images/spacer.gif) |
![](/common/images/spacer.gif) |
|
![](/common/images/spacer.gif) |
![](/common/images/spacer.gif) |
![](/common/images/spacer.gif) |
![](/common/images/spacer.gif) |
| | | | ![](/common/images/spacer.gif) | |
|