Results 1  10
of
482
Edgebreaker: Connectivity compression for triangle meshes
 IEEE Transactions on Visualization and Computer Graphics
, 1999
"... Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called connectivity or topology) of threedimensional triangle meshes. Edgebreaker improves upon the worst case storage required by previously reported schemes, most of which require O(nlogn) bits to store ..."
Abstract

Cited by 298 (24 self)
 Add to MetaCart
triangle to an adjacent one. At each stage, compression produces an opcode describing the topological relation between the current triangle and the boundary of the remaining part of the mesh. Decompression uses these opcodes to reconstruct the entire incidence graph. Because Edgebreaker’s compression
Generating textures on arbitrary surfaces using reactiondiffusion
 Computer Graphics
, 1991
"... This paper describes a biologically motivated method of texture synthesis called reactiondiffusion and demonstrates how these textures can be generated in a manner that directly matches the geometry of a given surface. Reactiondiffusion is a process in which two or more chemicals diffuse at unequa ..."
Abstract

Cited by 283 (5 self)
 Add to MetaCart
of assigning texture coordinates to a complex surface. A mesh is generated by evenly distributing points over the model using relaxation and then determining which points are adjacent by constructing their Voronoi regions. Textures are rendered directly from the mesh by using a weighted sum of mesh values
Efficient Traversal of Mesh Edges using Adjacency Primitives
"... Figure 1: (a) Our goal is to enable efficient processing of edges in a triangle mesh using adjacency primitives. (b) We select a minimal subset of triangles (blue) that covers all mesh edges. (c) Each remaining triangle (white) is assigned to a cover triangle (indicated by red segments). (d) We enco ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
Figure 1: (a) Our goal is to enable efficient processing of edges in a triangle mesh using adjacency primitives. (b) We select a minimal subset of triangles (blue) that covers all mesh edges. (c) Each remaining triangle (white) is assigned to a cover triangle (indicated by red segments). (d) We
On the adjacencies triangular meshes based on skeletonregular partitions
, 2002
"... Abstract For any 2D triangulation , the 1skeleton mesh of is the wireframe mesh deÿned by the edges of , while that for any 3D triangulation , the 1skeleton and the 2skeleton meshes, respectively, correspond to the wireframe mesh formed by the edges of and the "surface" mesh deÿned by ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
by the triangular faces of . A skeletonregular partition of a triangle or a tetrahedra, is a partition that globally applied over each element of a conforming mesh (where the intersection of adjacent elements is a vertex or a common face, or a common edge) produce both a reÿned conforming mesh and reÿned
Hierarchical mesh segmentation based on fitting primitives
 THE VISUAL COMPUTER
, 2006
"... In this paper we describe a hierarchical face clustering algorithm for triangle meshes based on fitting primitives belonging to an arbitrary set. The method proposed is completely automatic, and generates a binary tree of clusters, each of which fitted by one of the primitives employed. Initially, e ..."
Abstract

Cited by 113 (12 self)
 Add to MetaCart
In this paper we describe a hierarchical face clustering algorithm for triangle meshes based on fitting primitives belonging to an arbitrary set. The method proposed is completely automatic, and generates a binary tree of clusters, each of which fitted by one of the primitives employed. Initially
Optimal Point Placement for Mesh Smoothing
, 1997
"... We study the problem of moving a vertex in a finite element mesh to optimize the shapes of adjacent triangles. We show that many such problems can be solved in linear time using generalized linear programming. We also give efficient algorithms for some mesh smoothing problems that do not fit into th ..."
Abstract

Cited by 89 (5 self)
 Add to MetaCart
We study the problem of moving a vertex in a finite element mesh to optimize the shapes of adjacent triangles. We show that many such problems can be solved in linear time using generalized linear programming. We also give efficient algorithms for some mesh smoothing problems that do not fit
THE ELECTRICAL RESISTANCE OF A GRAPH CAPTURES ITS COMMUTE AND COVER TIMES
"... View an nvertex, medge undirected graph as an electrical network with unit resistors as edges. We extend known relations between random walks and electrical networks by showing that resistance in this network is intimately connected with the lengths of random walks on the graph. For example, the c ..."
Abstract

Cited by 196 (5 self)
 Add to MetaCart
) is characterized by the maximum resistance R in the graph to within a factor of log n: mR cover time O(mR log n). For many graphs, the bounds on cover time obtained in this manner are better than those obtained from previous techniques such as the eigenvalues of the adjacency matrix. In particular, we improve
Mesh Mutation in . . .
 GRAPHICS HARDWARE, M. DOGGETT , W. HEIDRICH , W. MARK , A. SCHILLING (EDITORS)
, 2003
"... We show how a future graphics processor unit (GPU), enhanced with random read and write to video memory, can represent, refine and adjust complex meshes arising in modeling, simulation and animation. To leverage SIMD parallelism, a general model based on the mesh atlas is developed and a particula ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
particular implementation without adjacency pointers is proposed in which primal, binary refinement of, possibly mixed, quadrilateral and triangular meshes of arbitrary topological genus, as well as their traversal is supported by usertransparent programmable graphics hardware. Adjustment
Adjacent channel interference in a multiradio wireless mesh node with
"... 802.11a/g interfaces ..."
AN ALGORITHM ORIENTED MESH DATABASE (AOMD) APPLICATION: DECIMATION
"... This paper discusses the efficiency and ease of implementation of a mesh coarsening or decimation (simplification) algorithm by using Algorithm Oriented Mesh Database (AOMD). AOMD is first introduced by the author and his coworkers in recent study [1]. The manuscript is aimed to give the reader the ..."
Abstract
 Add to MetaCart
related to mesh interentity adjacencies, meshmodel associations, i.e., classifications and AOMD data structures will be discussed. The selected decimation algorithm coarsens the mesh (2D or 3D) to the desired level by maintaining the topological and geometrical integrity of the input mesh by means
Results 1  10
of
482