@misc{
 title = {O(N) implementation of the fast marching algorithm},
 type = {misc},
 year = {2006},
 source = {Journal of Computational Physics},
 identifiers = {[object Object]},
 keywords = {Bucket sort,Distance functions,Fast marching,Hamilton-Jacobi and Eikonal equations,Untidy priority queue},
 pages = {393-399},
 volume = {212},
 issue = {2},
 websites = {http://www.sciencedirect.com/science/article/pii/S0021999105003736},
 id = {bc5f74d3-a304-339b-bca0-72a01ec519eb},
 created = {2015-05-07T14:40:12.000Z},
 file_attached = {false},
 profile_id = {5477662f-c7a8-37b0-902d-765da20fee71},
 last_modified = {2018-01-19T17:11:42.772Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 citation_key = {Yatziv2006},
 folder_uuids = {644af951-328a-4794-8436-dbab34dfd4ee},
 private_publication = {false},
 abstract = {In this note we present an implementation of the fast marching algorithm for solving Eikonal equations that in practice reduces the original run-time from O(N log N) to linear. This lower run-time cost is obtained while keeping an error bound of the same order of magnitude as the original algorithm. This improvement is achieved introducing the straight forward untidy priority queue, obtained via a quantization of the priorities in the marching computation. We present the underlying framework, estimations on the error, and examples showing the usefulness of the proposed approach.},
 bibtype = {misc},
 author = {Yatziv, Liron and Bartesaghi, Alberto and Sapiro, Guillermo}
}

{"_id":"qnMgo8uapBwaSw2uk","bibbaseid":"yatziv-bartesaghi-sapiro-onimplementationofthefastmarchingalgorithm-2006","downloads":0,"creationDate":"2018-01-19T05:22:09.225Z","title":"O(N) implementation of the fast marching algorithm","author_short":["Yatziv, L.","Bartesaghi, A.","Sapiro, G."],"year":2006,"bibtype":"misc","biburl":null,"bibdata":{"title":"O(N) implementation of the fast marching algorithm","type":"misc","year":"2006","source":"Journal of Computational Physics","identifiers":"[object Object]","keywords":"Bucket sort,Distance functions,Fast marching,Hamilton-Jacobi and Eikonal equations,Untidy priority queue","pages":"393-399","volume":"212","issue":"2","websites":"http://www.sciencedirect.com/science/article/pii/S0021999105003736","id":"bc5f74d3-a304-339b-bca0-72a01ec519eb","created":"2015-05-07T14:40:12.000Z","file_attached":false,"profile_id":"5477662f-c7a8-37b0-902d-765da20fee71","last_modified":"2018-01-19T17:11:42.772Z","read":false,"starred":false,"authored":"true","confirmed":"true","hidden":false,"citation_key":"Yatziv2006","folder_uuids":"644af951-328a-4794-8436-dbab34dfd4ee","private_publication":false,"abstract":"In this note we present an implementation of the fast marching algorithm for solving Eikonal equations that in practice reduces the original run-time from O(N log N) to linear. This lower run-time cost is obtained while keeping an error bound of the same order of magnitude as the original algorithm. This improvement is achieved introducing the straight forward untidy priority queue, obtained via a quantization of the priorities in the marching computation. We present the underlying framework, estimations on the error, and examples showing the usefulness of the proposed approach.","bibtype":"misc","author":"Yatziv, Liron and Bartesaghi, Alberto and Sapiro, Guillermo","bibtex":"@misc{\n title = {O(N) implementation of the fast marching algorithm},\n type = {misc},\n year = {2006},\n source = {Journal of Computational Physics},\n identifiers = {[object Object]},\n keywords = {Bucket sort,Distance functions,Fast marching,Hamilton-Jacobi and Eikonal equations,Untidy priority queue},\n pages = {393-399},\n volume = {212},\n issue = {2},\n websites = {http://www.sciencedirect.com/science/article/pii/S0021999105003736},\n id = {bc5f74d3-a304-339b-bca0-72a01ec519eb},\n created = {2015-05-07T14:40:12.000Z},\n file_attached = {false},\n profile_id = {5477662f-c7a8-37b0-902d-765da20fee71},\n last_modified = {2018-01-19T17:11:42.772Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {Yatziv2006},\n folder_uuids = {644af951-328a-4794-8436-dbab34dfd4ee},\n private_publication = {false},\n abstract = {In this note we present an implementation of the fast marching algorithm for solving Eikonal equations that in practice reduces the original run-time from O(N log N) to linear. This lower run-time cost is obtained while keeping an error bound of the same order of magnitude as the original algorithm. This improvement is achieved introducing the straight forward untidy priority queue, obtained via a quantization of the priorities in the marching computation. We present the underlying framework, estimations on the error, and examples showing the usefulness of the proposed approach.},\n bibtype = {misc},\n author = {Yatziv, Liron and Bartesaghi, Alberto and Sapiro, Guillermo}\n}","author_short":["Yatziv, L.","Bartesaghi, A.","Sapiro, G."],"urls":{"Website":"http://www.sciencedirect.com/science/article/pii/S0021999105003736"},"bibbaseid":"yatziv-bartesaghi-sapiro-onimplementationofthefastmarchingalgorithm-2006","role":"author","keyword":["Bucket sort","Distance functions","Fast marching","Hamilton-Jacobi and Eikonal equations","Untidy priority queue"],"downloads":0},"search_terms":["implementation","fast","marching","algorithm","yatziv","bartesaghi","sapiro"],"keywords":["bucket sort","distance functions","fast marching","hamilton-jacobi and eikonal equations","untidy priority queue","dblp"],"authorIDs":["5a6180812a52158259000015"]}