Results 1 - 10 of 4,896

Decimation of triangle meshes

by William J. Schroeder, Jonathan A. Zarge, William E. Lorensen - Computer Graphics (SIGGRAPH '92 Proceedings , 1992
"... The polygon remains a popular graphics primitive for computer graphics application. Besides having a simple representation, computer rendering of polygons is widely supported by commercial graphics hardware and software. ..."
Abstract - Cited by 640 (2 self) - Add to MetaCart
The polygon remains a popular graphics primitive for computer graphics application. Besides having a simple representation, computer rendering of polygons is widely supported by commercial graphics hardware and software.

Progressive Meshes

by Hugues Hoppe
"... Highly detailed geometric models are rapidly becoming commonplace in computer graphics. These models, often represented as complex triangle meshes, challenge rendering performance, transmission bandwidth, and storage capacities. This paper introduces the progressive mesh (PM) representation, a new s ..."
Abstract - Cited by 1315 (11 self) - Add to MetaCart
scheme for storing and transmitting arbitrary triangle meshes. This efficient, lossless, continuous-resolution representation addresses several practical problems in graphics: smooth geomorphing of level-of-detail approximations, progressive transmission, mesh compression, and selective refinement

View-Dependent Refinement of Progressive Meshes

by Hugues Hoppe
"... Level-of-detail (LOD) representations are an important tool for realtime rendering of complex geometric environments. The previously introduced progressive mesh representation defines for an arbitrary triangle mesh a sequence of approximating meshes optimized for view-independent LOD. In this paper, ..."
Abstract - Cited by 459 (5 self) - Add to MetaCart
, smooth visual transitions (geomorphs) can be constructed between any two selectively refined meshes. A number of previous schemes create view-dependent LOD meshes for height fields (e.g. terrains) and parametric surfaces (e.g. NURBS). Our framework also performs well for these special cases. Notably

Numerical Solutions of the Euler Equations by Finite Volume Methods Using Runge-Kutta Time-Stepping Schemes

by Antony Jameson, Wolfgang Schmidt, Eli Turkel , 1981
"... A new combination of a finite volume discretization in conjunction with carefully designed dissipative terms of third order, and a Runge Kutta time stepping scheme, is shown to yield an effective method for solving the Euler equations in arbitrary geometric domains. The method has been used to deter ..."
Abstract - Cited by 517 (78 self) - Add to MetaCart
A new combination of a finite volume discretization in conjunction with carefully designed dissipative terms of third order, and a Runge Kutta time stepping scheme, is shown to yield an effective method for solving the Euler equations in arbitrary geometric domains. The method has been used

Using spin images for efficient object recognition in cluttered 3D scenes

by Andrew E. Johnson, Martial Hebert - IEEE Transactions on Pattern Analysis and Machine Intelligence , 1999
"... We present a 3-D shape-based object recognition system for simultaneous recognition of multiple objects in scenes containing clutter and occlusion. Recognition is based on matching surfaces by matching points using the spin-image representation. The spin-image is a data level shape descriptor that i ..."
Abstract - Cited by 582 (9 self) - Add to MetaCart
that is used to match surfaces represented as surface meshes. We present a compression scheme for spin-images that results in efficient multiple object recognition which we verify with results showing the simultaneous recognition of multiple objects from a library of 20 models. Furthermore, we demonstrate

Efficient Decimation of Complex Triangle Meshes

by Swen Campagna, Leif Kobbelt, Hans-peter Seidel , 1998
"... Due to their simplicity triangle meshes are used to represent surfaces in many applications. Since the number of triangles often goes beyond the capabilities of computer graphics hardware, a large variety of mesh simplification algorithms has been proposed in the last years. In this paper we identif ..."
Abstract - Cited by 9 (1 self) - Add to MetaCart
attained and discuss implementation aspects in detail. We present a mesh decimation scheme that fulfills these design goals and which has already been evaluated by several users from different application areas. We apply this algorithm to typical meshes to demonstrate its performance. 1 Introduction

Joint Channel Assignment and Routing for Throughput Optimization in Multi-radio Wireless Mesh Networks

by Mansoor Alicherry , Randeep Bhatia , Li Erran Li , 2005
"... Multi-hop infrastructure wireless mesh networks offer increased reliability, coverage and reduced equipment costs over their singlehop counterpart, wireless LANs. Equipping wireless routers with multiple radios further improves the capacity by transmitting over multiple radios simultaneously using o ..."
Abstract - Cited by 443 (0 self) - Add to MetaCart
orthogonal channels. Efficient channel assignment and routing is essential for throughput optimization of mesh clients. Efficient channel assignment schemes can greatly relieve the interference effect of close-by transmissions; effective routing schemes can alleviate potential congestion on any gateways

A Stream Algorithm for the Decimation of Massive Meshes

by Jianhua Wu, Leif Kobbelt , 2003
"... We present an out-of-core mesh decimation algorithm that is able to handle input and output meshes of arbitrary size. The algorithm reads the input from a data stream in a single pass and writes the output to another stream while using only a fixed-sized in-core buffer. By applying randomized multip ..."
Abstract - Cited by 30 (2 self) - Add to MetaCart
multiple choice optimization, we are able to use incremental mesh decimation based on edge collapses and the quadric error metric. The quality of our results is comparable to state-of-the-art highquality mesh decimation schemes (which are slower than our algorithm) and the decimation performance matches

A General Framework for Mesh Decimation

by Leif Kobbelt, Swen Campagna, Hans-peter Seidel - in Proceedings of Graphics Interface , 1998
"... The decimation of highly detailed meshes has emerged as an important issue in many computer graphics related fields. A whole library of different algorithms has been proposed in the literature. By carefully investigating such algorithms, we can derive a generic structure for mesh reduction schemes w ..."
Abstract - Cited by 94 (19 self) - Add to MetaCart
The decimation of highly detailed meshes has emerged as an important issue in many computer graphics related fields. A whole library of different algorithms has been proposed in the literature. By carefully investigating such algorithms, we can derive a generic structure for mesh reduction schemes

Interactive Multi-Resolution Modeling on Arbitrary Meshes

by Leif Kobbelt , Swen Campagna, Jens Vorsatz, Hans-Peter Seidel , 1998
"... During the last years the concept of multi-resolution modeling has gained special attention in many fields of computer graphics and geometric modeling. In this paper we generalize powerful multiresolution techniques to arbitrary triangle meshes without requiring subdivision connectivity. Our major o ..."
Abstract - Cited by 307 (34 self) - Add to MetaCart
observation is that the hierarchy of nested spaces which is the structural core element of most multi-resolution algorithms can be replaced by the sequence of intermediate meshes emerging from the application of incremental mesh decimation. Performing such schemes with local frame coding of the detail
Results 1 - 10 of 4,896