A max distance transform algorithm mirroring Felzenszwalb-Huttenlocher is proposed, but its intersection formula is sign-flipped and its average-case runtime proof relies on an unjustified uniform-state assumption.
Under review
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Proof of Correctness and Time Complexity Analysis of a Maximum Distance Transform Algorithm
A max distance transform algorithm mirroring Felzenszwalb-Huttenlocher is proposed, but its intersection formula is sign-flipped and its average-case runtime proof relies on an unjustified uniform-state assumption.