Results 1  10
of
3,592
Parallel Mesh Simplification
, 2000
"... The simplification of three dimensional scenes represented by polygon meshes is becoming one of the most challenging tasks in the computer graphics community. A few years ago, complex meshes consisted of some thousands of polygons. Today, the number of polygons used for the modeling of 3Dobjects of ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. An efficient dataparallel mesh simplification algorithm is presented in...
Progressive Meshes
"... 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
. In addition, we present a new mesh simplification procedure for constructing a PM representation from an arbitrary mesh. The goal of this optimization procedure is to preserve not just the geometry of the original mesh, but more importantly its overall appearance as defined by its discrete and scalar
QSplat: A Multiresolution Point Rendering System for Large Meshes
, 2000
"... Advances in 3D scanning technologies have enabled the practical creation of meshes with hundreds of millions of polygons. Traditional algorithms for display, simplification, and progressive transmission of meshes are impractical for data sets of this size. We describe a system for representing and p ..."
Abstract

Cited by 502 (8 self)
 Add to MetaCart
Advances in 3D scanning technologies have enabled the practical creation of meshes with hundreds of millions of polygons. Traditional algorithms for display, simplification, and progressive transmission of meshes are impractical for data sets of this size. We describe a system for representing
Mesh Optimization
, 1993
"... We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh wH, produce a mesh w, of the same topological type as wH, that fits the data well and has a small number of vertices. Our approach is to minimize an energy f ..."
Abstract

Cited by 392 (8 self)
 Add to MetaCart
function that explicitly models the competing desires of conciseness of representation and fidelity to the data. We show that mesh optimization can be effectively used in at least two applications: surface reconstruction from unorganized points, and mesh simplification (the reduction of the number
Reconstruction and Representation of 3D Objects with Radial Basis Functions
 Computer Graphics (SIGGRAPH ’01 Conf. Proc.), pages 67–76. ACM SIGGRAPH
, 2001
"... We use polyharmonic Radial Basis Functions (RBFs) to reconstruct smooth, manifold surfaces from pointcloud data and to repair incomplete meshes. An object's surface is defined implicitly as the zero set of an RBF fitted to the given surface data. Fast methods for fitting and evaluating RBFs al ..."
Abstract

Cited by 505 (1 self)
 Add to MetaCart
We use polyharmonic Radial Basis Functions (RBFs) to reconstruct smooth, manifold surfaces from pointcloud data and to repair incomplete meshes. An object's surface is defined implicitly as the zero set of an RBF fitted to the given surface data. Fast methods for fitting and evaluating RBFs
Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh
, 2003
"... In recent years, overlay networks have become an effective alternative to IP multicast for efficient point to multipoint communication across the Internet. Typically, nodes selforganize with the goal of forming an efficient overlay tree, one that meets performance targets without placing undue burd ..."
Abstract

Cited by 424 (22 self)
 Add to MetaCart
burden on the underlying network. In this paper, we target highbandwidth data distribution from a single source to a large number of receivers. Applications include largefile transfers and realtime multimedia streaming. For these applications, we argue that an overlay mesh, rather than a tree, can
Mesh Simplification In Parallel
, 1999
"... This paper presents a parallel method for progressive mesh simplification. A progressive mesh (PM) is a continuous mesh representation of a given 3D object which makes it possible to efficiently access all mesh representations between a low and a high level of resolution ..."
Abstract
 Add to MetaCart
This paper presents a parallel method for progressive mesh simplification. A progressive mesh (PM) is a continuous mesh representation of a given 3D object which makes it possible to efficiently access all mesh representations between a low and a high level of resolution
Mesh Simplification In Parallel
, 1999
"... This paper presents a parallel method for progressive mesh simplification. A progressive mesh (PM) is a continuous mesh representation of a given 3D object which makes it possible to efficiently access all mesh representations between a low and a high level of resolution. The creation of a progre ..."
Abstract
 Add to MetaCart
This paper presents a parallel method for progressive mesh simplification. A progressive mesh (PM) is a continuous mesh representation of a given 3D object which makes it possible to efficiently access all mesh representations between a low and a high level of resolution. The creation of a
Parallel model simplification of very large polygonal meshes
 In Prodeedings of the International Conference on Parallel and Distributed Processing Techniques and Applications
"... Abstract: Working with polygonal models that contain tens of millions of polygons or more is difficult because such models tend not to fit into the core memory of a typical workstation. Even models of only a few million polygons are too large. A typical workstation has a gigabyte of memory, but thes ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
models the algorithms must be parallelized and the data distributed across a number of processors. One such class of algorithms is mesh simplification. Given RSimp, a sequential model simplification algorithm, we derive a parallel implementation (PRSimp). Our results show that very large models can
Results 1  10
of
3,592