Implicit Surface Fitting Using Directional Constraints

A commonly used technique for fitting curves and surfaces to measured data is that known as orthogonal distance regression, where the sum of squares of orthogonal distances from the data points to the surface is minimized. An alternative has recently been proposed for curves and surfaces which are parametrically defined, which minimizes the sum of squares in given directions which depend on the measuring process. In addition to taking account of that process, it is claimed that this technique has the advantage of complying with traditional fixed-regressor assumptions, enabling standard inference theory to apply. Here we consider extending this idea to curves and surfaces where the only assumption made is that there is an implicit formulation. Numerical results are given to illustrate the algorithmic performance.This revised version was published online in October 2005 with corrections to the Cover Date.     

Smooth surface reconstruction via natural neighbour interpolation of distance functions

We present an algorithm to reconstruct smooth surfaces of arbitrary topology from unorganised sample points and normals. The method uses natural neighbour interpolation, works in any dimension and accommodates non-uniform samples. The reconstructed surface interpolates the data points and is implicitly represented as the zero set of some pseudo-distance function. It can be meshed so as to satisfy a user-defined error bound, which makes the method especially relevant for small point sets. Experimental results are presented for surfaces in .     

Willmore Surfaces in S n

A surface x> : M S ⁿ is called a Willmore surface if it is a critical surface of the Willmore functional. It is well known that any minimal surface is a Willmore surface and that many nonminimal Willmore surfaces exists. In this paper, we establish an integral inequality for compact Willmore surfaces in S ⁿ and obtain a new characterization of the Veronese surface in S ⁴ as a Willmore surface. Our result reduces to a well-known result in the case of minimal surfaces.     

Construction of Surfaces with Parallelism Conditions

In this paper we define the notion of pseudo-parallel parameterized surfaces, extending that of offset surfaces. Then we consider the problem of fitting a set of scattered points with a surface pseudo-parallel to a given reference surface. We propose a method of solution based on a modified version of the classical smoothing D ^m -splines over a bounded domain. The convergence of the method is established and some numerical examples are given.     

The Compressibility of Checkerboard Surfaces of Link Diagrams

Consider the checkerboard surfaces defined by some link diagrams. When they are not orientable, one considers the boundary surfaces of small regular neighborhoods of them. This article studies the compressibility problem of these kinds of surfaces in the link complements. The problem is solved by devising a normalization theory for the compressing discs, which brings up an algorithm to read out compressibility directly from the link diagrams. As an application of the algorithm, the compressibility changes under Reidermeister moves are studied. Diagrams from the knot tables are also studied, and surprisingly, some of them are shown to define completely compressible surfaces of this kind. Infinitely many examples of non-alternating knot diagrams with incompressible surfaces of this kind are also constructed.     

Uniformly Distributed Circular Porous Pattern Generation on Surface for 3D Printing

We present an algorithm for uniformly distributed circular porous pattern generation on surface for three-dimensional (3D) printing using a phase-field model. The algorithm is based on the narrow band domain method for the nonlocal Cahn–Hilliard (CH) equation on surfaces. Surfaces are embedded in 3D grid and the narrow band domain is defined as the neighborhood of surface. It allows one can perform numerical computation using the standard discrete Laplacian in 3D instead of the discrete surface Laplacian. For complex surfaces, we reconstruct them from point cloud data and represent them as the zero-level set of their discrete signed distance functions. Using the proposed algorithm, we can generate uniformly distributed circular porous patterns on surfaces in 3D and print the resulting 3D models. Furthermore, we provide the test of accuracy and energy stability of the proposed method.     

基于层次T网格的分片孔斯曲面重构

本文提出一种基于任意层次T网格的多项式(PHT)样条空间$S(3,3,1,1,T)$的一个新的曲面重构算法.该算法由分片插值于层次T网格上每个小矩形单元对应4个顶点的16个参数的孔斯曲面形式给出.对于一个给定的T网格和相应基点处的几何信息(函数值,两个一阶偏导数和混合导数值),可得到与$S(3,3,1,1,T)$的PHT样条曲面相同的结果,且曲面表达形式更简单,同时,在离散数据点的曲面拟合中,我们给出了自适应的曲面加细算法.数值算例显示,该自适应算法能够有效的拟合离散数据点.     

Non-manifold surface reconstruction from high-dimensional point cloud data

We present an algorithm capable of reconstructing a non-manifold surface embedded as a point cloud in a high-dimensional space. Our algorithm extends a previously developed incremental method and produces a non-optimal triangulation, but will work for non-orientable surfaces, and for surfaces with certain types of self-intersection. The self-intersections must be ordinary double curves and are fitted locally by intersecting planes using a degenerate quadratic surface. We present the algorithm in detail and provide many examples, including a dataset describing molecular conformations of cyclo-octane.     

BOUNDING PYRAMIDS AND BOUNDING CONES FOR TRIANGULAR BEZIER SURFACES

1. IntroductionA 6ounding pyramid/cone of a rational B6zier surface patch is a pyramid/cone whichhas the property that if its vertex is translated to any point on the B6zier patch, thepatch will lie completely outside the pyramid/cone. These kinds of pyramids/conesare useful tools in detecting closed loops in surface/surface intersections[2, 3] and determining directions for which a surface is single valued[5]. While methods of finding bounding pyramids and bounding cones for rectangular B6zi…     

NURBS曲线曲面拟合数据点的迭代算法

本文推广了文献[1]的结果,将文献[1]中关于B样条曲线曲面拟合数据点的迭代算法推广至有理形式,给出了无需求解方程组反求控制点及权因子即可得到拟合NURBS曲线曲面的迭代方法．该算法和文献[1]的算法本质上是统一的,而后者恰是前者的一种退化形式．文章还给出了收敛性证明以及一些定性分析．文末的数值实例说明该算法简单实用．     

Bounding Pyramids and Bounding Cones for Triangular Bézier Surfaces

This paper describes practical approaches on how to construct bounding pyramids and bounding cones for triangular Bézier surfaces. Examples are provided to illustrate the process of construction and comparison is made between various surface bounding volumes. Furthermore, as a starting point for the construction, we provide a way to compute hodographs of triangular Bézier surfaces and improve the algorithm for computing the bounding cone of a set of vectors.     

G~1 Continuity Conditions of B-spline Surfaces

According to the B-spline theory and Boehm algorithm, this paper presents several necessary and sufficient G1 continuity conditions between two adjacent B-spline surfaces. In order to meet the need of application, a kind of sufficient conditions of G1 continuity are developed, and a kind of sufficient conditions of G1 continuity among N(N > 2) patch B-spline surfaces meeting at a common corner are given at the end.     

Transplantation and Jacobians of Sunada isospectral Riemann surfaces

We consider relations among the Jacobians of isospectral compact Riemann surfaces constructed using Sunada's theorem. We use a simple algebraic formulation of “transplantation” of holomorphic 1-forms and singular 1-cycles to obtain two main results. First, we obtain a geometric proof of a result of Prasad and Rajan that Sunada isospectral Riemann surfaces have isogenous Jacobians. Second, we determine a relationship (weaker than isogeny) that holds among the Jacobians of Sunada isospectral Riemann surfaces when the Jacobians’ extra structure as principally polarized abelian varieties is taken into account. We also show all Sunada isospectral manifolds have isomorphic real cohomology algebras. Finally, we exhibit transplantation of cycles explicitly in a concrete example of a pair of isospectral Riemann surfaces constructed by Brooks and Tse.     

Construction of covering maps between orientable surfaces

Consider the following problem. Can a set of numbers be realized as boundary covering indices of a covering map between surfaces? How to realize them? A set of equivalent criteria for this problem are found, which can be checked by a finite algorithm. Furthermore, the algorithm will also construct a solution if such one exists. As an application, a well_known group of necessary conditions are shown to be not sufficient in infinitely many cases, while in most cases, numbers satisfying them are realizable.     

Crosscap numbers of pretzel knots

The crosscap number of a knot in the 3-sphere is defined as the minimal first Betti number of non-orientable surfaces bounded by the knot. In this paper, we determine the crosscap numbers of a large class of pretzel knots. The key ingredient to obtain the result is the algorithm of enumerating all essential surfaces for Montesinos knots developed by Hatcher and Oertel.     

一种改进的密度核估计算法

密度核估计是解决统计问题中样本分布密度函数拟合的一类非参数统计方法,在经济、金融等领域有着重要的应用价值.密度核估计重点在于研究它的算法,使其估计值相对精确.本文提出了一种密度核估计的迭代方法,并通过算例与原有的密度核估计方法进行统计模拟比较,得出迭代后的值具有较好的拟合程度,充分验证了迭代方法的可行性与优越性.     

Helix splines as an example of affine Tchebycheffian splines

The present paper summarizes the theory of affine Tchebycheffian splines and presents an interesting affine Tchebycheffian free-form scheme, the “helix scheme”. The curve scheme provides exact representations of straight lines, circles and helix curves in an arc length parameterization. The corresponding tensor product surfaces contain helicoidal surfaces, surfaces of revolution and patches on all types of quadrics. We also show an application to the construction of planarC ² motions interpolating a given set of positions. Because the spline curve segments are calculated using a subdivision algorithm, many algorithms, which are of fundamental importance in the B-spline technique, can be applied to helix splines as well. This paper should demonstrate how to create an affine free-form scheme fitting to certain special applications.     

On Minimizing Problems with a Volume Constraint in Hyperbolic 3-Manifolds

This paper investigates the existence of an area (or Dirichlet integral) minimizing parametric surface in a hyperbolic 3-manifold subject to a volume constraint. The existence of a minimizing surface is proved, assuming some conditions on the prescribed free homotopy class. This result implies a non-existence result of minimizing surfaces of prescribed mean curvature. A criterion for the existence of surfaces of prescribed mean curvature, which turns out to be optimal in view of the non-existence result, is also obtained.     

Approximating rational triangular Bézier surfaces by polynomial triangular Bézier surfaces

An attractive method for approximating rational triangular Bézier surfaces by polynomial triangular Bézier surfaces is introduced. The main result is that the arbitrary given order derived vectors of a polynomial triangular surface converge uniformly to those of the approximated rational triangular Bézier surface as the elevated degree tends to infinity. The polynomial triangular surface is constructed as follows. Firstly, we elevate the degree of the approximated rational triangular Bézier surface, then a polynomial triangular Bézier surface is produced, which has the same order and new control points of the degree-elevated rational surface. The approximation method has theoretical significance and application value: it solves two shortcomings-fussy expression and uninsured convergence of the approximation-of Hybrid algorithms for rational polynomial curves and surfaces approximation.