Sciweavers

CAGD
2007
75views more  CAGD 2007»
13 years 4 months ago
Lines of curvature and umbilical points for implicit surfaces
WuJun Che, Jean-Claude Paul, Xiaopeng Zhang
CAGD
2007
77views more  CAGD 2007»
13 years 4 months ago
Cycle bases of graphs and sampled manifolds
Craig Gotsman, Kanela Kaligosi, Kurt Mehlhorn, Dim...
CAGD
2007
69views more  CAGD 2007»
13 years 4 months ago
On geometric interpolation of circle-like curves
In this paper, geometric interpolation of certain circle-like curves by parametric polynomial curves is studied. It is shown that such an interpolating curve of degree n achieves ...
Gasper Jaklic, Jernej Kozak, Marjeta Krajnc, Emil ...
CAGD
2007
59views more  CAGD 2007»
13 years 4 months ago
Discrete quadratic curvature energies
We present a family of discrete isometric bending models (IBMs) for triangulated surfaces in 3-space. These models are derived from an axiomatic treatment of discrete Laplace oper...
Max Wardetzky, Miklós Bergou, David Harmon,...
CAGD
2007
91views more  CAGD 2007»
13 years 4 months ago
Note on curve and surface energies
Energies of curves and surfaces together with their discrete variants play a prominent role as fairness functionals in geometric modeling and computer aided geometric design. This ...
Johannes Wallner
CAGD
2007
119views more  CAGD 2007»
13 years 4 months ago
Principal curvatures from the integral invariant viewpoint
The extraction of curvature information for surfaces is a basic problem of Geometry Processing. Recently an integral invariant solution of this problem was presented, which is bas...
Helmut Pottmann, Johannes Wallner, Yong-Liang Yang...
CAGD
2007
75views more  CAGD 2007»
13 years 4 months ago
Geometric interpolation by planar cubic polynomial curves
The purpose of this paper is to provide sufficient geometric conditions that imply the existence of a cubic parametric polynomial curve which interpolates six points in the plane....
Jernej Kozak, Marjeta Krajnc
CAGD
2007
75views more  CAGD 2007»
13 years 4 months ago
Computing roots of polynomials by quadratic clipping
We present an algorithm which is able to compute all roots of a given univariate polynomial within a given interval. In each step, we use degree reduction to generate a strip boun...
Michael Barton, Bert Jüttler
CAGD
2007
132views more  CAGD 2007»
13 years 4 months ago
Normals of subdivision surfaces and their control polyhedra
For planar spline curves and bivariate box-spline functions, the cone of normals of a polynomial spline piece is enclosed by the cone of normals of its spline control polyhedron. ...
Ingo Ginkel, Jörg Peters, Georg Umlauf
CAGD
2007
77views more  CAGD 2007»
13 years 4 months ago
A geometric diagram and hybrid scheme for triangle subdivision
We introduce a geometrical diagram to study the improvement in shape of triangles generated by iterative application of triangle subdivision. The four Triangles Longest Edge (4TLE...
Angel Plaza, José P. Suárez, Graham ...