A very fast mesh simplification algorithm based on halfedge collapse is proposed in this work with a focus on progressive graphic transmission applications. We generalize the Quadric Error Metric (QEM) method to accommodate new topological operations. A flatness criterion is combined with the defined metric to preserve the visual quality of simplified meshes. We further adopt the vertex-based p...

This paper applies a matrix-analytic approach to analyze both the long-term and the short-term loss behaviors of a queue with space priority scheme. Five related performance measures are derived from conditional statistics, including the long-term highpriority and low-priority packet loss probabilities, and the three short-term measures — the average length of a critical period, the average len...

A priority queue transforms an input permutation p1 of a totally ordered set of size n into an output permutation p2. Atkinson and Thiyagarajah showed that the number of such pairs (p1; p2) is (n+1)n 1, which is well known to be the number of labeled trees on n + 1 vertices. We give a new proof of this result by finding a bijection from such pairs of permutations to labeled trees.

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at . http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive...

When a set of permutations comprising a pattern class C is submitted as input to a priority queue the resulting output is again a pattern class C′. The basis of C′ is determined for pattern classes C whose basis elements have length 3, and is finite in these cases. An example is given of a class C with basis {2431} for which C′ is not finitely based. Mathematics Subject Classification: 05A05, 6...