provides a linearization (ordering of (x, y) pairs) and reduced index for each (x, y) pair
provides a linearization (ordering of (x, y) pairs) and reduced index for each (x, y) pair
solve Poisson's equation in bounding box of mask
solve Poisson's equation in bounding box of mask
constructs a Laplace matrix, (-Laplace(f) is positive definite) calls addElement for each matrix element
constructs a Laplace matrix, (-Laplace(f) is positive definite) calls addElement for each matrix element
negative of righthand side: actually solves (-Laplace(f)) = -rhs
negative of righthand side: actually solves (-Laplace(f)) = -rhs
find a good linearization order (currently select column major or row major only)
find a good linearization order (currently select column major or row major only)
find 4-neighbourhood
find 4-neighbourhood
solve Poisson's equation using a sparse Cholesky decomposition, solves for each component of A independently performs only a single factorization which can be reused for each component
solve Poisson's equation using a sparse Cholesky decomposition, solves for each component of A independently performs only a single factorization which can be reused for each component
initial and boundary values, fixed values of f
marks domain where solution is required, (true: fill-in trough equation (with f), false: keep fixed (boundary value))
right-hand side of Poisson equation
solve Poisson's equation in bounding box of mask
solve Poisson's equation in bounding box of mask
(Since version ) see corresponding Javadoc for more information.
solve a Poisson equation using a sparse Cholesky decomposition (efficient for small systems, use PCG for larger systems)