Results 11  20
of
3,745
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
of vertices in an initially dense mesh of triangles).
Numerical Solutions of the Euler Equations by Finite Volume Methods Using RungeKutta TimeStepping Schemes
, 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
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
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
Efficient Implementation of Progressive Meshes
, 1998
"... In earlier work, we introduced the progressive mesh (PM) representation, a new format for storing and transmitting arbitrary triangle meshes. For a given mesh, the PM representation defines a continuous sequence of levelofdetail approximations, allows smooth visual transitions (geomorphs) between ..."
Abstract

Cited by 134 (1 self)
 Add to MetaCart
In earlier work, we introduced the progressive mesh (PM) representation, a new format for storing and transmitting arbitrary triangle meshes. For a given mesh, the PM representation defines a continuous sequence of levelofdetail approximations, allows smooth visual transitions (geomorphs) between
Smooth ViewDependent LevelofDetail Control and Its Application to Terrain Rendering
"... The key to realtime rendering of largescale surfaces is to locally adapt surface geometric complexity to changing view parameters. Several schemes have been developed to address this problem of viewdependent levelofdetail control. Among these, the viewdependent progressive mesh (VDPM) framewor ..."
Abstract

Cited by 264 (1 self)
 Add to MetaCart
) framework represents an arbitrary triangle mesh as a hierarchy of geometrically optimized refinement transformations, from which accurate approximating meshes can be efficiently retrieved. In this paper we extend the general VDPM framework to provide temporal coherence through the runtime creation
Mesh Reduction with Error Control
 Visualization 96. ACM
, 1996
"... In many cases the surfaces of geometric models consist of a large number of triangles. Several algorithms were developed to reduce the number of triangles required to approximate such objects. Algorithms that measure the deviation between the approximated object and the original object are only avai ..."
Abstract

Cited by 110 (20 self)
 Add to MetaCart
available for special cases. In this paper we use the Hausdorff distance between the original and the simplified mesh as a geometrically meaningful error value which can be applied to arbitrary triangle meshes. We present a new algorithm to reduce the number of triangles of a mesh without exceeding a user
Dynamic Refinement of Deformable Triangle Meshes for Rendering
 IN PROC. COMPUTER GRAPHICS INTERNATIONAL 2001
, 2001
"... We present a method to adaptively refine an irregular triangle mesh as it deforms in realtime. The method increases surface smoothness in regions of high deformation by splitting triangles in a fashion similar to one or two steps of Loop subdivision. The refinement is computed for an arbitrary tria ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
We present a method to adaptively refine an irregular triangle mesh as it deforms in realtime. The method increases surface smoothness in regions of high deformation by splitting triangles in a fashion similar to one or two steps of Loop subdivision. The refinement is computed for an arbitrary
Surface Reconstruction by Voronoi Filtering
 Discrete and Computational Geometry
, 1998
"... We give a simple combinatorial algorithm that computes a piecewiselinear approximation of a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to remove triangles from the Delaunay triangulation. We prove the algorithm correct by showing that for densely sampled ..."
Abstract

Cited by 405 (11 self)
 Add to MetaCart
We give a simple combinatorial algorithm that computes a piecewiselinear approximation of a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to remove triangles from the Delaunay triangulation. We prove the algorithm correct by showing that for densely sampled
Interpolating Subdivision for Meshes with Arbitrary Topology
"... Subdivision is a powerful paradigm for the generation of surfaces of arbitrary topology. Given an initial triangular mesh the goal is to produce a smooth and visually pleasing surface whose shape is controlled by the initial mesh. Of particular interest are interpolating schemes since they match the ..."
Abstract

Cited by 236 (24 self)
 Add to MetaCart
Subdivision is a powerful paradigm for the generation of surfaces of arbitrary topology. Given an initial triangular mesh the goal is to produce a smooth and visually pleasing surface whose shape is controlled by the initial mesh. Of particular interest are interpolating schemes since they match
Lossless Topological Subdivision of Triangle Meshes
, 1999
"... In this paper, we investigate subdivision tree representations of arbitrary triangle meshes. By subdivision, we mean the recursive topological partitioning of a triangle into subtriangles. Such a process can be represented by a subdivision tree. We identify the class of regular triangle meshes, t ..."
Abstract
 Add to MetaCart
In this paper, we investigate subdivision tree representations of arbitrary triangle meshes. By subdivision, we mean the recursive topological partitioning of a triangle into subtriangles. Such a process can be represented by a subdivision tree. We identify the class of regular triangle meshes
Results 11  20
of
3,745