Essays about: "Vertices"
Showing result 1 - 5 of 83 essays containing the word Vertices.
-
1. A geometric approach to calculating the limit set of eigenvalues for banded Toeplitz matrices
University essay from Lunds universitet/Matematik LTHAbstract : This thesis is about the limiting eigenvalue distribution of n × n Toeplitz matrices as n → ∞. The two classical questions we want to answer are: what is the limit set of the eigenvalues, and what is the limiting distribution of the eigenvalues. Our main result is a new approach to calculate the limit set Λ(b) for a Laurent polynomial b, i.e. READ MORE
-
2. Particle-Oriented Bounding Box Skeletal Animation in real-time applications
University essay from Blekinge Tekniska HögskolaAbstract : Background. Skeletal animation is a technique used for displaying animated movement that uses bones in a hierarchy to get a structure; these bones are transformed based on their parent bones. Vertices in a mesh are connected to one or more bones with a weight, and the vertices will move based on the bone transformation, creating an animation. READ MORE
-
3. Distance Consistent Labellings and the Local List Number
University essay from Linköpings universitet/Algebra, geometri och diskret matematik; Linköpings universitet/Tekniska fakultetenAbstract : We study the local list number of graphs introduced by Lennerstad and Eriksson. A labelling of a graph on n vertices is a bijection from vertex set to the set {1,…, n}. Given such a labelling c a vertex u is distance consistent if for all vertices v and w |c(u)-c(v)|=|c(u)-c(w)|+1 implies d(u,w)≤ d(u,v). READ MORE
-
4. Cache behaviour analysis for graph algorithms
University essay from Uppsala universitet/Institutionen för informationsteknologiAbstract : Graph processing is an ever-increasing significant area of research in the wake of the demand for efficient tools that process data such as graphs, which can describe sets of objects (vertices) and their relations to each other (edges). Graph algorithms traverse these graphs by visiting their vertices or additionally calculating some properties about them such as how significant a specific vertex is in the context of the greater graph. READ MORE
-
5. Random Edge is not faster than Random Facet on Linear Programs
University essay from KTH/Matematik (Avd.)Abstract : A Linear Program is a problem where the goal is to maximize a linear function subject to a set of linear inequalities. Geometrically, this can be rephrased as finding the highest point on a polyhedron. The Simplex method is a commonly used algorithm to solve Linear Programs. READ MORE
