This paper presents a fast algorithm for generating triangle strips from triangulated meshes, providing a compact representation suitable for transmission and rendering of the models. A data structure that allows efficient triangle strip generation is also described. The method is based on simple heuristics, significantly reducing the number of vertices used to describe the triangulated models....

The independence number α ( G ) $\alpha (G)$ and the dissociation diss $\text{diss}(G)$ of a graph $G$ are largest orders induced subgraphs maximum degree at most 0 1, respectively. We consider possible improvements obvious inequality 2 ≥ $2\alpha (G)\ge \text{diss}(G)$ . For connected cubic graphs distinct from K 4 ${K}_{4}$ , we show 5 3 $5\alpha 3\,\text{diss}(G)$ describe rich interesting s...

Semiorders may form the simplest class of ordered sets with a not necessarily transitive indifference relation. Their generalization has given birth to many other classes of ordered sets, each of them characterized by an interval representation, by the properties of its relations or by forbidden configurations. In this paper, we are interested in preference structures having an interval represe...

DStrips is a simple and efficient method to dynamically manage and generate triangle strips for real-time viewdependent multiresolution meshing and rendering. Progressive view-dependent triangle mesh simplification and rendering is an important concept for interactive visualization environments. To minimize the rendering cost, triangle meshes are simplified to the maximal tolerated perceptual e...

this paper is concerned with the following elliptic system:$$ left{ begin{array}{ll} -triangle u + b(x)nabla u + v(x)u=g(x, v), -triangle v - b(x)nabla v + v(x)v=f(x, u), end{array} right. $$ for $x in {r}^{n}$, where $v $, $b$ and $w$ are 1-periodic in $x$, and $f(x,t)$, $g(x,t)$ are super-quadratic. in this paper, we give a new technique to show the boundedness of cerami sequences and establi...