Results 1  10
of
138,951
Large steps in cloth simulation
 SIGGRAPH 98 Conference Proceedings
, 1998
"... The bottleneck 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 572 (5 self)
 Add to MetaCart
as well. The implicit integration method generates a large, unbanded sparse linear system at each time step which is solved using a modified conjugate gradient method that simultaneously enforces particles ’ constraints. The constraints are always maintained exactly, independent of the number of conjugate
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 501 (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
Reevaluating Amdahl’s law
 Commun. ACM
, 1988
"... At Sandia National Laboratories, we are currently engaged in research involving massively parallel processing. There is considerable skepticism regarding the viability of massive parallelism; the skepticism centers around Amdahl’s law, an argument put forth by Gene Amda.hl in 1967 [l] that even w ..."
Abstract

Cited by 310 (4 self)
 Add to MetaCart
that very few problems will experience even a loofold speedup. Yet, for three very practical applications (s = 0.40.8 percent) used at Sandia, we have achieved speedup factors on a 1024processor hypercube that we believe are unprecedented [2]: 2022 for beam stress analysis using conjugate gradients
Avoiding Saturation By Trajectory Reparameterization
, 1996
"... The problem of trajectory tracking in the presence of input constraints is considered. The desired trajectory is reparameterized on a slower time scale in order to avoid input saturation. Necessary conditions that the reparameterizing function must satisfy are derived. The deviation from the nominal ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
The problem of trajectory tracking in the presence of input constraints is considered. The desired trajectory is reparameterized on a slower time scale in order to avoid input saturation. Necessary conditions that the reparameterizing function must satisfy are derived. The deviation from
A Pattern Approach to Interaction Design
, 2000
"... To create successful interactive systems, user interface designers need to cooperate with developers and application domain experts in an interdisciplinary team. These groups, however, usually miss a common terminology to exchange ideas, opinions, and values. This paper presents an approach that use ..."
Abstract

Cited by 253 (13 self)
 Add to MetaCart
To create successful interactive systems, user interface designers need to cooperate with developers and application domain experts in an interdisciplinary team. These groups, however, usually miss a common terminology to exchange ideas, opinions, and values. This paper presents an approach that uses pattern languages to capture this knowledge in software development, HCI, and the application domain. A formal, domainindependent definition of design patterns allows for computer support without sacrificing readability, and pattern use is integrated into the usability engineering lifecycle. As an example, experience from building an awardwinning interactive music exhibit was turned into a pattern language, which was then used to inform followup projects and support HCI education.
Combings of groups and the grammar of reparameterization
 Comment. Math. Helv
"... Abstract. A new construction of combings is used to distinguish between several previously indistinguishable classes of groups associated to the theory of automatic groups and nonpositive curvature in group theory. We construct synchronously bounded combings for a class of groups that are neither ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. A new construction of combings is used to distinguish between several previously indistinguishable classes of groups associated to the theory of automatic groups and nonpositive curvature in group theory. We construct synchronously bounded combings for a class of groups that are neither bicombable nor automatic. The linguistic complexity of these combings is analysed: in many cases the language of words in the combing is an indexed language.
Regularization by Model Reparameterization
"... (m ~ )k 2 + ckD ~ ~ \Delta m ~ k 2 : (1) This particular l 2 objective function is easily motivated as a maximum a posteriori estimate of the model given the data. Additive noise is assumed to be Gaussian and uncorrelated with zero mean. The model is assumed to be Gaussian and zero mea ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(m ~ )k 2 + ckD ~ ~ \Delta m ~ k 2 : (1) This particular l 2 objective function is easily motivated as a maximum a posteriori estimate of the model given the data. Additive noise is assumed to be Gaussian and uncorrelated with zero mean. The model is assumed to be Gaussian and zero mean, with an inverse covariance matrix equal to C ~ ~ \Gamma1 m j E(m ~ m ~ ) \Gamma1 = D ~ ~ \Delta D ~ ~ : (2) Asterisks indicate adjoints. The assumption that model samples are correlated is equivalent to the encouragement of simplicity. A constant c adjusts the ratio of variances assumed for noise and the model. Bube and Langan's continuation approach begins with a large constant<F3
Mesh Editing with PoissonBased Gradient Field Manipulation
 ACM TRANS. GRAPH
, 2004
"... In this paper, we introduce a novel approach to mesh editing with the Poisson equation as the theoretical foundation. The most distinctive feature of this approach is that it modifies the original mesh geometry implicitly through gradient field manipulation. Our approach can produce desirable and pl ..."
Abstract

Cited by 174 (17 self)
 Add to MetaCart
In this paper, we introduce a novel approach to mesh editing with the Poisson equation as the theoretical foundation. The most distinctive feature of this approach is that it modifies the original mesh geometry implicitly through gradient field manipulation. Our approach can produce desirable
SNAREpins: minimal machinery for membrane fusion
 Cell
, 1998
"... Recombinant vand tSNARE proteinsreconstitutedinto separate lipid bilayer vesicles assemble into SNAREpins—SNARE complexes linking two membranes. This leads to spontaneous fusion of the docked membranes at physiological temperature. Docked unfused intermediates can accumulate at lower temperature ..."
Abstract

Cited by 243 (11 self)
 Add to MetaCart
Recombinant vand tSNARE proteinsreconstitutedinto separate lipid bilayer vesicles assemble into SNAREpins—SNARE complexes linking two membranes. This leads to spontaneous fusion of the docked membranes at physiological temperature. Docked unfused intermediates can accumulate at lower temperatures and can fuse when brought to physiological temperature. A supply of unassembled v and tSNAREs is needed for these intermediates to form, but not for the fusion that follows. These data imply that SNAREpins are the minimal machinery for cellular membrane fusion.
Results 1  10
of
138,951