Results 1  10
of
1,696
A Nonlinear Subdivision Scheme for Triangle Meshes
 Vision, Modeling and Visualization 2000
, 2000
"... Subdivision schemes are commonly used to obtain dense or smooth data representations from sparse discrete data. E. g., Bsplines are smooth curves or surfaces that can be constructed by infinite subdivision of a polyline or polygon mesh of control points. New vertices are computed by linear combinat ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
combinations of the initial control points. We present a new nonlinear subdivision scheme for the refinement of triangle meshes that generates smooth surfaces with minimum curvature variations. It is based on a combination of edge splitting operations and interpolation by blending circular arcs. In contrast
Refining Triangle Meshes by NonLinear Subdivision
, 2001
"... Subdivision schemes are commonly used to obtain dense or smooth data representations from sparse discrete data. E. g., Bsplines are smooth curves or surfaces that can be constructed by infinite subdivision of a polyline or polygon mesh of control points. New vertices are computed by linear combinat ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
combinations of the initial control points. We present a new nonlinear subdivision scheme for the refinement of triangle meshes that generates smooth surfaces with minimum curvature variations. It is based on a combination of edge splitting operations and interpolation by blending circular arcs. In contrast
Refining Triangle Meshes by NonLinear Subdivision
"... Subdivision schemes are commonly used to obtain dense or smooth data representations from sparse discrete datu. E. g., Bsplines are smooth curves or sugaces that can be constructed by injinite subdivision of a polyline or polygon mesh of control points. New vertices are computed by linear combinat ..."
Abstract
 Add to MetaCart
combinations of the initial control points. We present a new nonlinear subdivision scheme for the rejinement of triangle meshes that generates smooth surfaces with minimum curvature variations. It is based on a combination of edge splitting operations and interpolation by blending circular arcs. In contrast
A Butterfly Subdivision Scheme for Surface Interpolation with Tension Control
 ACM TRANSACTIONS ON GRAPHICS
, 1990
"... A new interpolatory subdivision scheme for surface design is presented. The new scheme is designed for a general triangulation of control points and has a tension parameter that provides design flexibility. The resulting limit surface is C¹ for a specified range of the tension parameter, with a few ..."
Abstract

Cited by 393 (7 self)
 Add to MetaCart
A new interpolatory subdivision scheme for surface design is presented. The new scheme is designed for a general triangulation of control points and has a tension parameter that provides design flexibility. The resulting limit surface is C¹ for a specified range of the tension parameter, with a few
The Determinants of Credit Spread Changes.
 Journal of Finance
, 2001
"... ABSTRACT Using dealer's quotes and transactions prices on straight industrial bonds, we investigate the determinants of credit spread changes. Variables that should in theory determine credit spread changes have rather limited explanatory power. Further, the residuals from this regression are ..."
Abstract

Cited by 422 (2 self)
 Add to MetaCart
rates, r 10 t . To capture potential nonlinear effects due to convexity, we also include the squared level of the term structure, (r 10 t ) 2 . Slope of Yield Curve We define the slope of the yield curve as the difference between Datastream's 10year and 2year Benchmark Treasury yields, slope
A Nonlinear Circlepreserving Subdivision Scheme
, 2006
"... We describe a new method for constructing a sequence of refined polygons, which starts with a sequence of points and associated normals. The newly generated points are sampled from circles which approximate adjacent points and the corresponding normals. By iterating the refinement procedure, we get ..."
Abstract
 Add to MetaCart
We describe a new method for constructing a sequence of refined polygons, which starts with a sequence of points and associated normals. The newly generated points are sampled from circles which approximate adjacent points and the corresponding normals. By iterating the refinement procedure, we get
√3subdivision
 IN PROCEEDINGS OF ACM SIGGRAPH
, 2000
"... A new stationary subdivision scheme is presented which performs slower topological refinement than the usual dyadic split operation. The number of triangles increases in every step by a factor of 3 instead of 4. Applying the subdivision operator twice causes a uniform refinement with trisection of ..."
Abstract

Cited by 138 (4 self)
 Add to MetaCart
A new stationary subdivision scheme is presented which performs slower topological refinement than the usual dyadic split operation. The number of triangles increases in every step by a factor of 3 instead of 4. Applying the subdivision operator twice causes a uniform refinement with tri
Displaced subdivision surfaces
 Siggraph 2000, Computer Graphics Proceedings, Annual Conference Series, pages 85–94. ACM Press / ACM SIGGRAPH
, 2000
"... In this paper we introduce a new surface representation, the displaced subdivision surface. It represents a detailed surface model as a scalarvalued displacement over a smooth domain surface. Our representation defines both the domain surface and the displacement function using a unified subdivisio ..."
Abstract

Cited by 158 (2 self)
 Add to MetaCart
In this paper we introduce a new surface representation, the displaced subdivision surface. It represents a detailed surface model as a scalarvalued displacement over a smooth domain surface. Our representation defines both the domain surface and the displacement function using a unified
The Relaxation Schemes for Systems of Conservation Laws in Arbitrary Space Dimensions
 Comm. Pure Appl. Math
, 1995
"... We present a class of numerical schemes (called the relaxation schemes) for systems of conservation laws in several space dimensions. The idea is to use a local relaxation approximation. We construct a linear hyperbolic system with a stiff lower order term that approximates the original system with ..."
Abstract

Cited by 250 (21 self)
 Add to MetaCart
We present a class of numerical schemes (called the relaxation schemes) for systems of conservation laws in several space dimensions. The idea is to use a local relaxation approximation. We construct a linear hyperbolic system with a stiff lower order term that approximates the original system
The Simplest Subdivision Scheme for Smoothing Polyhedra
, 1997
"... Given a polyhedron, construct a new polyhedron by connecting every edgemidpoint to its four neighboring edgemidpoints. This refinement rule yields a C 1 surface and the surface has a piecewise quadratic parametrization except at finite number of isolated points. We analyze and improve the constru ..."
Abstract

Cited by 90 (7 self)
 Add to MetaCart
the construction. keywords: simplest smooth subdivision, surface, arbitrary topology, characteristic map, boxspline 1 Introduction Consider an input polyhedron with not necessarily planar facets. The simplest subdivision scheme connects every edgemidpoint to the four midpoints of the edges that share both a
Results 1  10
of
1,696