Results 1  10
of
8,417
The Bounding Mesh Algorithm The Bounding Mesh Algorithm
, 2015
"... We present an algorithm to generate a onesided approximation of a given triangular mesh. We refer to such an approximate mesh as a bounding mesh, which includes the original mesh and has fewer vertices. Likewise, an inner bounding mesh is defined as an approximate mesh that is included by a given m ..."
Abstract
 Add to MetaCart
We present an algorithm to generate a onesided approximation of a given triangular mesh. We refer to such an approximate mesh as a bounding mesh, which includes the original mesh and has fewer vertices. Likewise, an inner bounding mesh is defined as an approximate mesh that is included by a given
Reconfigurable Mesh Algorithms For The Area And
"... Parallel reconfigurable mesh computer algorithms are developed to obtain the area and perimeter of image components. For an NN image, our algorithms take O (logN) time on an NN RMESH. ..."
Abstract
 Add to MetaCart
Parallel reconfigurable mesh computer algorithms are developed to obtain the area and perimeter of image components. For an NN image, our algorithms take O (logN) time on an NN RMESH.
ACSGM  An adaptive CSG meshing algorithm
 Proceedings of CSG 96, Information Geometers
, 1996
"... We present a new algorithm, called ACSGM (which is short for Adaptive CSG Mesher), that converts scenes in CSG representation into a boundary representation (BREP ) based on flat triangles. The algorithm is based on the marching cube algorithm, but instead of working at a fixed resolution, the siz ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
, the size of the cubes used in the meshing process is changed adaptively. Quite different from the marching cube algorithm, which calculates the vertices of the triangles of the final mesh using linear interpolation, ACSGM uses ray casting for this computation. This approach not only produces exact
Implicit Fairing of Irregular Meshes using Diffusion and Curvature Flow
, 1999
"... In this paper, we develop methods to rapidly remove rough features from irregularly triangulated data intended to portray a smooth surface. The main task is to remove undesirable noise and uneven edges while retaining desirable geometric features. The problem arises mainly when creating highfidelit ..."
Abstract

Cited by 542 (23 self)
 Add to MetaCart
curvature flow operator that achieves a smoothing of the shape itself, distinct from any parameterization. Additional features of the algorithm include automatic exact volume preservation, and hard and soft constraints on the positions of the points in the mesh. We compare our method to previous operators
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
ViewDependent Refinement of Progressive Meshes
"... Levelofdetail (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 viewindependent LOD. In this paper, ..."
Abstract

Cited by 459 (5 self)
 Add to MetaCart
, we introduce a framework for selectively refining an arbitrary progressive mesh according to changing view parameters. We define efficient refinement criteria based on the view frustum, surface orientation, and screenspace geometric error, and develop a realtime algorithm for incrementally refining
Efficient Variants of the ICP Algorithm
 INTERNATIONAL CONFERENCE ON 3D DIGITAL IMAGING AND MODELING
, 2001
"... The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of threedimensional models when an initial estimate of the relative pose is known. Many variants of ICP have been proposed, affecting all phases of the algorithm from the selection and matching of points to the minim ..."
Abstract

Cited by 718 (5 self)
 Add to MetaCart
The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of threedimensional models when an initial estimate of the relative pose is known. Many variants of ICP have been proposed, affecting all phases of the algorithm from the selection and matching of points
Reconfigurable mesh algorithms for the Hough transform
, 1994
"... We develop parallel algorithms to compute the Hough transform on a reconfigurable mesh with buses (RMESH) multiprocessor. The p angle Hough transform of an NN image can be computed in O (plog(N/p)) time by an NN RMESH, in O ((p/N)logN) time by an NN RMESH with N copies of the image pretiled, in ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We develop parallel algorithms to compute the Hough transform on a reconfigurable mesh with buses (RMESH) multiprocessor. The p angle Hough transform of an NN image can be computed in O (plog(N/p)) time by an NN RMESH, in O ((p/N)logN) time by an NN RMESH with N copies of the image pretiled
Subdivision on Arbitrary Meshes: Algorithms and Theory
, 2005
"... Subdivision surfaces have become a standard geometric modeling tool for a variety of applications. This survey is an introduction to subdivision algorithms for arbitrary meshes and related mathematical theory; we review the most important subdivision schemes the theory of smoothness of subidivision ..."
Abstract
 Add to MetaCart
Subdivision surfaces have become a standard geometric modeling tool for a variety of applications. This survey is an introduction to subdivision algorithms for arbitrary meshes and related mathematical theory; we review the most important subdivision schemes the theory of smoothness of subidivision
Mesh Algorithms for Multiplication and Division ⋆ (Preliminary Version)
"... Abstract. We consider the implementation of multiplication and division operations on one and two dimensional mesh of processors. We develop an O ( √ n) step 2dim mesh algorithm for multiplying two nbit numbers. The algorithm is simple and does not rely upon discrete fourier transforms. We also d ..."
Abstract
 Add to MetaCart
Abstract. We consider the implementation of multiplication and division operations on one and two dimensional mesh of processors. We develop an O ( √ n) step 2dim mesh algorithm for multiplying two nbit numbers. The algorithm is simple and does not rely upon discrete fourier transforms. We also
Results 1  10
of
8,417