Results 271 to 280 of about 7,208,381 (319)
Some of the next articles are maybe not open access.
HCMU Surfaces and Weingarten Surfaces
The Journal of Geometric Analysis, 2022A non-contant sectional curvature extremal Kähler metric with finite singularities on a compact Riemann surface is often called HCMU metric (the Hessian of the Curvature of the Metric is Umbilical). \textit{C.-K. Peng} and \textit{Y. Wu} [Result. Math. 75, No. 4, Paper No. 133, 10 p.
Zhiqiang Wei, Yingyi Wu
openaire +2 more sources
Computer Aided Geometric Design, 1990
The authors present two methods for constructing functions, defined over convex surfaces, interpolating data values at scattered points on the surfaces. These are local methods. The first one is basically an extension of the 3D Shepard's method that restrict the domain to a convex surface. The second one consists in an extension of the triangular-based
Robert E. Barnhill, H. S. Ou
openaire +2 more sources
The authors present two methods for constructing functions, defined over convex surfaces, interpolating data values at scattered points on the surfaces. These are local methods. The first one is basically an extension of the 3D Shepard's method that restrict the domain to a convex surface. The second one consists in an extension of the triangular-based
Robert E. Barnhill, H. S. Ou
openaire +2 more sources
Computer Aided Geometric Design, 1987
An adaptive surface/surface intersection algorithm is developed for rectangular parametric C 1 patches, each defined over a unit square. The algorithm is general (does not depend on particular surface type) and proceeds in two distinct stages: the first is to find one point on some intersection curve (using adaptive triangular mesh generation and ...
Robert E. Barnhill +3 more
openaire +1 more source
An adaptive surface/surface intersection algorithm is developed for rectangular parametric C 1 patches, each defined over a unit square. The algorithm is general (does not depend on particular surface type) and proceeds in two distinct stages: the first is to find one point on some intersection curve (using adaptive triangular mesh generation and ...
Robert E. Barnhill +3 more
openaire +1 more source
A tracing algorithm for surface-surface intersections on surface boundaries
Journal of Computer Science and Technology, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kyu-Yeul Lee, Doo-Yeoun Cho, Tae Wan Kim
openaire +1 more source
Surface diffusion on a stepped surface
Physical Review B, 1993Surface diffusion of an adatom on a vicinal surface is investigated, using site-dependent hopping rates based on a model surface-potential profile of a regularly stepped surface. We solved analytically the coupled rate equations for the occupation probability of an adatom at a sufficiently long time, in analogy to the tight-binding theory of electronic
Natori, A., Godby, R.W.
openaire +3 more sources
Bonnet Surfaces and Isothermic Surfaces
Results in Mathematics, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Weihuan, Li, Haizhong
openaire +1 more source
Bezier surface/surface intersection
IEEE Computer Graphics and Applications, 1990The computational requirements and accuracy of two methods for finding the intersection of Bezier surfaces are examined. In both methods, the existence of an intersection curve is confirmed by using the convex hull property of such surfaces. The first method evaluates the intersection by recursive subdivision of two patches with overlapping hulls.
Nadim M. Aziz, Reda Bata, Sudarshan Bhat
openaire +1 more source