Skip to content
Commits on Source (6)
SNAPHU
Statistical-Cost, Netowrk-Flow Algorithm for Phase Unwrapping
Author: Curtis W. Chen
Version 2.0.0, March 2019
Version 2.0.2, October 2019
Contents
......
Notable changes in v2.0.2 since v2.0.1:
---------------------------------------
* Fixed indexing error that would sometimes cause segmentation fault when
discharging boundary of masked region.
Notable changes in v2.0.1 since v2.0.0:
---------------------------------------
* Bug fixes affecting externally generated costs read from a file and
handling of zero-cost primary and secondary arcs.
Notable changes in v2.0 since v1.4.2:
-------------------------------------
......
snaphu (2.0.1-2) UNRELEASED; urgency=medium
snaphu (2.0.2-1) unstable; urgency=medium
* New upstream release.
* Bump Standards-Version to 4.4.1, no changes.
* debian/patches:
- refresh all patches
* debian/control:
- Explicitly specify Rules-Requires-Root: no
-- Antonio Valentino <antonio.valentino@tiscali.it> Mon, 30 Sep 2019 20:02:33 +0200
-- Antonio Valentino <antonio.valentino@tiscali.it> Wed, 30 Oct 2019 04:52:36 +0000
snaphu (2.0.1-1) unstable; urgency=medium
......
......@@ -3,6 +3,7 @@ Maintainer: Debian GIS Project <pkg-grass-devel@lists.alioth.debian.org>
Uploaders: Antonio Valentino <antonio.valentino@tiscali.it>
Section: non-free/science
XS-Autobuild: no
Rules-Requires-Root: no
Priority: optional
Build-Depends: debhelper-compat (= 12)
Standards-Version: 4.4.1
......
......@@ -21,7 +21,7 @@ index 161cc25..a4ed3c9 100644
preceding one, although round-off errors in flow-to-phase conversions
may cause minor differences
diff --git a/src/snaphu.h b/src/snaphu.h
index 5d43cb5..82e6d2b 100644
index b4cdc3e..7c33fc0 100644
--- a/src/snaphu.h
+++ b/src/snaphu.h
@@ -407,7 +407,7 @@
......
......@@ -14,7 +14,7 @@
/**********************/
#define PROGRAMNAME "snaphu"
#define VERSION "2.0.1"
#define VERSION "2.0.2"
#define BUGREPORTEMAIL "snaphu@gmail.com"
#ifdef PI
#undef PI
......
......@@ -1751,10 +1751,10 @@ int DischargeBoundary(nodeT **nodes, nodeT *ground,
if(row<nrow-1){
if(iscandidate[row][col]){
if(col>0){
nodes[row][col].outcost=0;
nodes[row][col-1].outcost=0;
}
if(col<ncol-1){
nodes[row][col+1].outcost=0;
nodes[row][col].outcost=0;
}
}
iscandidate[row][col]=FALSE;
......@@ -1762,10 +1762,10 @@ int DischargeBoundary(nodeT **nodes, nodeT *ground,
if(col<ncol-1){
if(iscandidate[row+nrow-1][col]){
if(row>0){
nodes[row][col].outcost=0;
nodes[row-1][col].outcost=0;
}
if(row<nrow-1){
nodes[row+1][col].outcost=0;
nodes[row][col].outcost=0;
}
}
iscandidate[row+nrow-1][col]=FALSE;
......