• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 11 - 20 of 3,811
Next 10 →

Efficient, Fair Interpolation using Catmull-Clark Surfaces

by Mark Halstead, Michael Kass, Tony DeRose , 1993
"... We describe an efficient method for constructing a smooth surface that interpolates the vertices of a mesh of arbitrary topological type. Normal vectors can also be interpolated at an arbitrary subset of the vertices. The method improves on existing interpolation techniques in that it is fast, robus ..."
Abstract - Cited by 205 (9 self) - Add to MetaCart
We describe an efficient method for constructing a smooth surface that interpolates the vertices of a mesh of arbitrary topological type. Normal vectors can also be interpolated at an arbitrary subset of the vertices. The method improves on existing interpolation techniques in that it is fast

Analysis and Application of Subdivision Surfaces

by Jean E. Schweitzer , 1996
"... Subdivision surfaces are a convenient representation for modeling objects of arbitrary topological type. In this dissertation, we investigate the analysis of a piecewise smooth subdivision scheme, and we apply the scheme to reconstruct objects from non-uniformly sampled data points. Defined as the ..."
Abstract - Cited by 72 (0 self) - Add to MetaCart
Subdivision surfaces are a convenient representation for modeling objects of arbitrary topological type. In this dissertation, we investigate the analysis of a piecewise smooth subdivision scheme, and we apply the scheme to reconstruct objects from non-uniformly sampled data points. Defined

On primitive subdivisions of an elementary tetrahedron, preprint

by J. -m. Kantor, K. S. Sarkaria - URL http://www.ihes.fr/PREPRINTS/M01/Resu/resu- M01- 23.html , 2001
"... A polytope P of 3-space, which meets a given lattice L only in its vertices, is called L-elementary. An L-elementary tetrahedron has volume ≥ (1/6). det(L), in case equality holds it is called L-primitive. A result of Knudsen, Mumford and Waterman, tells us that any convex polytope P admits a linear ..."
Abstract - Cited by 9 (0 self) - Add to MetaCart
linear simplicial subdivision into tetrahedra which are primitive with respect to the bigger lattice (1/2) t.L, for some t depending on P. Improving this, we show that in fact the lattice (1/4).L always suffices. To this end, we first characterize all L-elementary tetrahedra for which even

Permission accounting in separation logic

by Richard Bornat, Cristiano Calcagno, Matthew Parkinson - In POPL , 2005
"... A lightweight logical approach to race-free sharing of heap storage between concurrent threads is described, based on the notion of permission to access. Transfer of permission between threads, subdivision and combination of permission is discussed. The roots of the approach are in Boyland’s [3] dem ..."
Abstract - Cited by 191 (24 self) - Add to MetaCart
A lightweight logical approach to race-free sharing of heap storage between concurrent threads is described, based on the notion of permission to access. Transfer of permission between threads, subdivision and combination of permission is discussed. The roots of the approach are in Boyland’s [3

On convex Sobolev inequalities and the rate of convergence to equilibrium for Fokker-Planck type equations

by Anton Arnold, Peter Markowich, Giuseppe Toscani, Andreas Unterreiter , 2000
"... It is well known that the analysis of the large-time asymptotics of Fokker-Planck type equations by the entropy method is closely related to proving the validity of convex Sobolev inequalities. Here we highlight this connection from an applied PDE point of view. In our unified presentation of the th ..."
Abstract - Cited by 163 (21 self) - Add to MetaCart
of the theory we present new results to the following topics: an elementary derivation of Bakry-Emery type conditions, results concerning perturbations of invariant measures with general admissible entropies, sharpness of convex Sobolev inequalities, applications to non-symmetric linear and certain non

GFUN: A Maple Package for the Manipulation of Generating and Holonomic Functions in One Variable

by Bruno Salvy, Paul Zimmermann , 1992
"... We describe the gfun package which contains functions for manipulating sequences, linear recurrences or di erential equations and generating functions of various types. This document isintended both as an elementary introduction to the subject and as a reference manual for the package. ..."
Abstract - Cited by 165 (18 self) - Add to MetaCart
We describe the gfun package which contains functions for manipulating sequences, linear recurrences or di erential equations and generating functions of various types. This document isintended both as an elementary introduction to the subject and as a reference manual for the package.

Black Hole Condensation And The Unification Of String Vacua

by Brian R. Greene, David R. Morrison, Andrew Strominger , 1995
"... It is argued that black hole condensation can occur at conifold singularities in the moduli space of type II Calabi-Yau string vacua. The condensate signals a smooth transition to a new Calabi-Yau space with different Euler characteristic and Hodge numbers. In this manner string theory unifies the m ..."
Abstract - Cited by 162 (14 self) - Add to MetaCart
It is argued that black hole condensation can occur at conifold singularities in the moduli space of type II Calabi-Yau string vacua. The condensate signals a smooth transition to a new Calabi-Yau space with different Euler characteristic and Hodge numbers. In this manner string theory unifies

Semantic Domains

by C. A. Gunter, D. S. Scott , 1990
"... this report started working on denotational semantics in collaboration with Christopher Strachey. In order to fix some mathematical precision, he took over some definitions of recursion theorists such as Kleene, Nerode, Davis, and Platek and gave an approach to a simple type theory of higher-type fu ..."
Abstract - Cited by 166 (7 self) - Add to MetaCart
this report started working on denotational semantics in collaboration with Christopher Strachey. In order to fix some mathematical precision, he took over some definitions of recursion theorists such as Kleene, Nerode, Davis, and Platek and gave an approach to a simple type theory of higher-type

A Multiresolution Framework for Variational Subdivision

by Leif Kobbelt, Peter Schröder , 1998
"... Subdivision is a powerful paradigm for the generation of curves and surfaces. It is easy to implement, computationally efficient, and useful in a variety of applications because of its intimate connection with multiresolution analysis. An important task in computer graphics and geometric modeling is ..."
Abstract - Cited by 45 (0 self) - Add to MetaCart
including one that reproduces non-uniform interpolating cubic splines. Expressing the construction in terms of certain elementary operations we are able to embed variational subdivision in the lifting framework, a powerful technique to construct wavelet filter banks given a subdivision scheme. This allows

Fast Rendering of Subdivision Surfaces

by Kari Pulli, Mark Segal , 1996
"... Subdivision surfaces provide a curved surface representation that is useful in a number of applications, including modeling surfaces of arbitrary topological type [5], fitting scattered data [6], and geometric compression and automatic level-of-detail generation using wavelets [8]. Subdivision sur ..."
Abstract - Cited by 30 (1 self) - Add to MetaCart
Subdivision surfaces provide a curved surface representation that is useful in a number of applications, including modeling surfaces of arbitrary topological type [5], fitting scattered data [6], and geometric compression and automatic level-of-detail generation using wavelets [8]. Subdivision
Next 10 →
Results 11 - 20 of 3,811
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University