Results 1 - 10 of 676

Edgebreaker: Connectivity compression for triangle meshes

by Jarek Rossignac - 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 three-dimensional 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 op-code describing the topological relation between the current triangle and the boundary of the remaining part of the mesh. Decompression uses these op-codes to reconstruct the entire incidence graph. Because Edgebreaker’s compression

Articulated Mesh Animation from Multi-view Silhouettes

by Daniel Vlasic, Ilya Baran, Wojciech Matusik, Jovan Popović - ACM TRANSACTIONS ON GRAPHICS , 2008
"... Details in mesh animations are difficult to generate but they have great impact on visual quality. In this work, we demonstrate a practical software system for capturing such details from multi-view video recordings. Given a stream of synchronized video images that record a human performance from mu ..."
Abstract - Cited by 168 (6 self) - Add to MetaCart
animations with flowing garment motions. We accomplish this with a fast pose tracking method followed by nonrigid deformation of the template to fit the silhouettes. The entire process takes less than sixteen seconds per frame and requires no markers or texture cues. Captured meshes are in full

Mesh-based inverse kinematics

by Robert W. Sumner, Matthias Zwicker, Craig Gotsman, Jovan Popović - ACM Trans. Graph , 2005
"... The ability to position a small subset of mesh vertices and produce a meaningful overall deformation of the entire mesh is a fundamental task in mesh editing and animation. However, the class of meaningful deformations varies from mesh to mesh and depends on mesh kinematics, which prescribes valid m ..."
Abstract - Cited by 98 (8 self) - Add to MetaCart
The ability to position a small subset of mesh vertices and produce a meaningful overall deformation of the entire mesh is a fundamental task in mesh editing and animation. However, the class of meaningful deformations varies from mesh to mesh and depends on mesh kinematics, which prescribes valid

Mesh Collapse Compression

by Martin Isenburg Jack, Jack Snoeyink - In Proceedings of SIBGRAPI’99 , 1999
"... We present a novel algorithm for encoding the topology of triangular meshes. A sequence of edge contract and divide operations collapses the entire mesh into a single vertex. This implicitly creates a tree with weighted edges. The weights are vertex degrees and capture the topology of the unlabele ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
We present a novel algorithm for encoding the topology of triangular meshes. A sequence of edge contract and divide operations collapses the entire mesh into a single vertex. This implicitly creates a tree with weighted edges. The weights are vertex degrees and capture the topology

STREAMING COMPRESSION OF TRIANGLE MESHES

by Martin Peter Jack
"... Standard schemes for compressing polygonal meshes first construct an explicit representation of the mesh connectivity and then traverse it with some deterministic strategy. This implicitly assumes that the compressor is allowed to reorder the mesh triangles as it sees fit. Hence, current mesh compre ..."
Abstract - Add to MetaCart
compressors take the entire mesh as input, construct temporary data structures in the size of the mesh, and produce a completely reordered compressed mesh. In this report we describe a compression scheme that can preserve the original triangle order of a mesh. It incrementally constructs mesh connectivity

Streaming Compression of Triangle Meshes

by Martin Isenburg, Peter Lindstrom, Jack Snoeyink , 2005
"... Current mesh compression schemes encode triangles and vertices in an order derived from systematically traversing the connectivity graph. These schemes struggle with gigabyte-sized mesh input where the construction and the usage of the data structures that support topological traversal queries becom ..."
Abstract - Cited by 21 (9 self) - Add to MetaCart
become I/O-inefficient and require large amounts of temporary disk space. Furthermore they expect the entire mesh as input. Since meshes cannot be compressed until their generation is complete, they have to be stored at least once in uncompressed form. We radically depart from the traditional approach

The SMesh Wireless Mesh Network

by Yair Amir, Claudiu Danilov, Raluca Musăloiu-elefteri, Nilo Rivera , 2009
"... Wireless mesh networks extend the connectivity range of mobile devices by using multiple access points, some of them connected to the Internet, to create a mesh topology and forward packets over multiple wireless hops. However, the quality of service provided by the mesh is impaired by the delays an ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
and routing logic is done solely by the access points, and therefore connectivity is attainable by any 802.11 device. In SMesh, the entire mesh network is seen by the mobile clients as a single, omnipresent access point, giving the mobile clients the illusion that they are stationary. We use multicast

Fast handoff for seamless wireless mesh networks

by Yair Amir, Claudiu Danilov, Michael Hilsdale, Raluca Musăloiu-elefteri, Nilo Rivera - ACM MobiSys , 2006
"... This paper presents the architecture and protocols of SMesh, a completely transparent wireless mesh system that offers seamless, fast handoff, supporting VoIP and other real-time application traffic for any unmodified 802.11 device. In SMesh, the entire mesh network is seen by the mobile clients as ..."
Abstract - Cited by 39 (5 self) - Add to MetaCart
This paper presents the architecture and protocols of SMesh, a completely transparent wireless mesh system that offers seamless, fast handoff, supporting VoIP and other real-time application traffic for any unmodified 802.11 device. In SMesh, the entire mesh network is seen by the mobile clients

Automatic Smoothing of Quad & Triangle Meshes

by Patrick Donnelly
"... I present a methodology to create smooth meshes using spline patches generated automatically from the geometry of the mesh. The intent is to create a smooth surface across the entire mesh, which creates smooth silhouette edges and is very useful for high quality ray tracing. An additional goal was t ..."
Abstract - Add to MetaCart
I present a methodology to create smooth meshes using spline patches generated automatically from the geometry of the mesh. The intent is to create a smooth surface across the entire mesh, which creates smooth silhouette edges and is very useful for high quality ray tracing. An additional goal

1Triangular Mesh Segmentation Based On Surface Normal

by Dong Hwan Kim, Il Dong Yun, Sang Uk Lee
"... This paper presents an algorithm for segmentation of 3D triangular mesh data. The proposed algorithm uses iterative merging of adjacent triangle pairs based on the orientation of triangles. The surface is segmented into patches, where each patch has a similar normal property. Thus, each region can b ..."
Abstract - Add to MetaCart
be approximated to planar patch and its boundaries have perceptually important geometric information of the entire mesh model. The experimental results show that the proposed algorithm is performed efficiently. 1.
Results 1 - 10 of 676