ABSTRACT
We present QuickBound, an algorithm for quickly determining whether a uniformly tessellated grid derived from a bilinear patch satisfies a maximum edge length threshold. Our approach generalizes the well-known technique of bounding the length of all horizontal and vertical edges in the uniformly tessellated grid by checking only a small, constant number of edges. We generalize this technique to apply to all diagonal edges. Our approach, called Quick-Bound, reduces the time complexity of determining whether an (m face x n face) grid satisfies the edge length threshold from O(mxn) to O(1). We provide a proof of correctness for QuickBound and also measure its effectiveness in a real-time bilinear patch visualizer.
Recommendations
Bounding prefix transposition distance for strings and permutations
A transposition is an operation that exchanges two adjacent substrings. Transpositions over permutations, the sequences with no repeated symbols, are related to genome rearrangements. If one of the substrings is restricted to a prefix then it is called ...
Generalized Huffman coding for binary trees with choosable edge lengths
In this paper we study binary trees with choosable edge lengths, in particular rooted binary trees with the property that the two edges leading from every non-leaf to its two children are assigned integral lengths l 1 and l 2 with l 1 + l 2 = k for a ...
Comments