Mysteries of life and coding...

Seriously speaking, I wrote the poisson solver that Georg uses to calculate the image after compression in the gradient domain. I known that it has some issues with the boundary conditions. Ideally, it had to met Von Neumman's conditions (zero gradient, or mirroed image and the boundaries), but there are still some artifacts left unless we "physically" impose a zero padding. Most of the artifacts arised if a strong gradient was found in the boundary, like a bright star half cutten. In some cases, the solution of the solver might go so wrong, that a flat image was generated.
So, since I suspected that the solver should be the most probable candidate, the easiest way to try to improve things was to impose different boundaries.

BTW, I wrote a gradient domain hdr compression tool (is in my repository, for linux only) that is more complex than Georg's, and it also uses a more robust algorithm to overcome boundary problems. I hope that Juan will dedicate me some time to pulish it this year, for inclusion in the 1.8 standard set.