Results 1 - 10 of 1,366

Multiresolution Analysis of Arbitrary Meshes

by Matthias Eck , Tony DeRose, Tom Duchamp, Hugues Hoppe, Michael Lounsbery, Werner Stuetzle , 1995
"... In computer graphics and geometric modeling, shapes are often represented by triangular meshes. With the advent of laser scanning systems, meshes of extreme complexity are rapidly becoming commonplace. Such meshes are notoriously expensive to store, transmit, render, and are awkward to edit. Multire ..."
Abstract - Cited by 600 (16 self) - Add to MetaCart
in practice typically do not meet this requirement. In this paper we present a method for overcoming the subdivision connectivity restriction, meaning that completely arbitrary meshes can now be converted to multiresolution form. The method is based on the approximation of an arbitrary initial mesh M by a

Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh

by Dejan Kostic, Adolfo Rodriguez, Jeannie Albrecht, Amin Vahdat , 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 self-organize 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
deliver fundamentally higher bandwidth and reliability relative to typical tree structures. This paper presents Bullet, a scalable and distributed algorithm that enables nodes spread across the Internet to self-organize into a high bandwidth overlay mesh. We construct Bullet around the insight that data

Large steps in cloth simulation

by David Baraff, Andrew Witkin - SIGGRAPH 98 Conference Proceedings , 1998
"... The bottle-neck in most cloth simulation systems is that time steps must be small to avoid numerical instability. This paper describes a cloth simulation system that can stably take large time steps. The simulation system couples a new technique for enforcing constraints on individual cloth particle ..."
Abstract - Cited by 576 (5 self) - Add to MetaCart
particles with an implicit integration method. The simulator models cloth as a triangular mesh, with internal cloth forces derived using a simple continuum formulation that supports modeling operations such as local anisotropic stretch or compression; a unified treatment of damping forces is included

Teddy: A sketching interface for 3d freeform design

by Takeo Igarashi, Satoshi Matsuoka, Hidehiko Tanaka , 1999
"... We present a sketching interface for quickly and easily designing freeform models such as stuffed animals and other rotund objects. The user draws several 2D freeform strokes interactively on the screen and the system automatically constructs plausible 3D polygonal surfaces. Our system supports seve ..."
Abstract - Cited by 486 (35 self) - Add to MetaCart
several modeling operations, including the operation to construct a 3D polygonal surface from a 2D silhouette drawn by the user: it inflates the region surrounded by the silhouette making wide areas fat, and narrow areas thin. Teddy, our prototype system, is implemented as a Java ™ program, and the mesh

ASYMPTOTIC EXPANSION AND SUPERCONVERGENCE FOR TRIANGULAR LINEAR FINITE ELEMENT ON A CLASS OF TYPICAL MESH

by Haiyuan Yu, Yunqing Huang
"... Abstract. In this paper, we present a new approach to obtain the asymptotic expansion and superconvergence for the linear element on Union Jack mesh. First, we construct a generalized interpolation function and its discrete harmonic extension by using the energy embedding method and the method of se ..."
Abstract - Add to MetaCart
Abstract. In this paper, we present a new approach to obtain the asymptotic expansion and superconvergence for the linear element on Union Jack mesh. First, we construct a generalized interpolation function and its discrete harmonic extension by using the energy embedding method and the method

ROAMing Terrain: Real-time Optimally Adapting Meshes

by Mark Duchaineau , Murray Wolinsky, David E. Sigeti, Mark C. Miller , Charles Aldrich, Mark B. Mineev-Weinstein , 1997
"... Terrain visualization is a difficult problem for applications requiring accurate images of large datasets at high frame rates, such as flight simulation and ground-based aircraft testing using synthetic sensor stimulation. On current graphics hardware, the problem is to maintain dynamic, view-depend ..."
Abstract - Cited by 287 (10 self) - Add to MetaCart
additional performance optimizations: incremental triangle stripping and prioritycomputation deferral lists. ROAM execution time is proportionate to the number of triangle changes per frame, which is typically a few percent of the output mesh size, hence ROAM performance is insensitive to the resolution

Geometry images

by Xianfeng Gu, Steven J. Gortler, Hugues Hoppe - IN PROC. 29TH SIGGRAPH , 2002
"... Surface geometry is often modeled with irregular triangle meshes. The process of remeshing refers to approximating such geometry using a mesh with (semi)-regular connectivity, which has advantages for many graphics applications. However, current techniques for remeshing arbitrary surfaces create onl ..."
Abstract - Cited by 342 (24 self) - Add to MetaCart
only semi-regular meshes. The original mesh is typically decomposed into a set of disk-like charts, onto which the geometry is parametrized and sampled. In this paper, we propose to remesh an arbitrary surface onto a completely regular structure we call a geometry image. It captures geometry as a

Progressive Compression for Lossless Transmission of Triangle Meshes

by Pierre Alliez, Mathieu Desbrun , 2001
"... Lossless transmission of 3D meshes is a very challenging and timely problem for many applications, ranging from collaborative design to engineering. Additionally, frequent delays in transmissions call for progressive transmission in order for the end user to receive useful successive refinements of ..."
Abstract - Cited by 99 (4 self) - Add to MetaCart
. For typical meshes, our method compresses connectivity down to less than 3.7 bits per vertex, 40% better in average than the best methods previously reported [5, 18]; we further reduce the usual geometry bit rates by 20% in average by exploiting the smoothness of meshes. Concretely, our technique can reduce

Optimal Point Placement for Mesh Smoothing

by Nina Amenta, Marshall Bern, David Eppstein , 1997
"... We study the problem of moving a vertex in a finite element mesh to optimize the shapes of adjacent triangles. We show that many such problems can be solved in linear time using generalized linear programming. We also give efficient algorithms for some mesh smoothing problems that do not fit into th ..."
Abstract - Cited by 89 (5 self) - Add to MetaCart
into the generalized linear programming paradigm. 1 Introduction Unstructured mesh generation, a key step in the finite element method, can be divided into two stages. In point placement, the input domain is augmented by Steiner points and a preliminary mesh is formed, typically by Delaunay triangulation. In mesh

A Simple Mesh Generator in MATLAB

by Per-olof Persson, Gilbert Strang - SIAM Review , 2004
"... Abstract. Creating a mesh is the first step in a wide range of applications, including scientific computing and computer graphics. An unstructured simplex mesh requires a choice of meshpoints (vertex nodes) and a triangulation. We want to offer a short and simple MATLAB code, described in more detai ..."
Abstract - Cited by 89 (4 self) - Add to MetaCart
is described implicitly by its distance function. In addition to being much shorter and simpler than other meshing techniques, our algorithm typically produces meshes of very high quality. We discuss ways to improve the robustness and the performance, but our aim here is simplicity. Readers can download (and
Results 1 - 10 of 1,366