text:
Level set equations on surfaces via the Closest Point Method
- Myles Payne
- 2 years ago
- Views:
1 Level set equations on surfaces via the Closest Point Method Colin B. Macdonald 1, Steven J. Ruuth 2 1 Department of Mathematics, Simon Fraser University, Burnaby, BC, V5A1S6 Canada. 2 Department of Mathematics, Simon Fraser University, Burnaby, BC, V5A1S6 Canada. Preprint: 5 February 2008 Abstract Level set methods have been used in a great number of applications in R 2 and R 3 and it is natural to consider extending some of these methods to problems defined on surfaces embedded in R 3 or higher dimensions. In this paper we consider the treatment of level set equations on surfaces via a recent technique for solving partial differential equations (PDEs) on surfaces, the Closest Point Method [18]. Our main modification is to introduce a Weighted Essentially Non-Oscillatory (WENO) interpolation step into the Closest Point Method. This, in combination with standard WENO for Hamilton Jacobi equations, gives high-order results (up to fifth-order) on a variety of smooth test problems including passive transport, normal flow and redistancing. The algorithms we propose are straightforward modifications of standard codes, are carried out in the embedding space in a well-defined band around the surface and retain the robustness of the level set method with respect to the self-intersection of interfaces. Numerous examples are provided to illustrate the flexibility of the method with respect to geometry. Key words Closest Point Method level set methods partial differential equations implicit surfaces WENO schemes WENO interpolation The work of this author was partially supported by a grant from NSERC Canada and a scholarship from the Pacific Institute for the Mathematical Sciences (PIMS). The work of this author was partially supported by a grant from NSERC Canada.
2 2 Colin B. Macdonald, Steven J. Ruuth 1 Introduction The level set method [15] has been successfully applied to a tremendous variety of problems involving curve evolution in R 2 or surface evolution in R 3. This curve or surface the interface is represented as the zero contour of a level set function φ. A principal strength of the level set method comes from its ability to handle changes in topology of the evolving interface, i.e., interfaces break apart or merge naturally, and without the need for special code or instructions to detect or treat the shape changes as they occur. A second, and also key, benefit that occurs when using level set methods is that the discretization of the underlying level set equation (of Hamilton Jacobi type) can be carried out using well-known, accurate and reliable discretization techniques, such as the weighted essentially non-oscillatory (WENO) methods described in [10, 8, 7]. Taken together, these benefits have contributed to a widespread adoption of level set techniques in different disciplines [14,21]. Level set methods have primarily been used to treat evolving interfaces in R 2 and R 3. It is natural to want to evolve level set equations on general domains, to give a way of robustly capturing the motion of interfaces on curved surfaces. Such an extension would be extremely interesting since it could open up the possibility of generalizing existing level set applications to curved surfaces. For example, suppose one wished to segment out objects appearing on a surface. By extending level set methods to surfaces, we gain the possibility of solving this problem by simply transferring existing level set methods for segmentation to the case of surfaces. This approach becomes even more compelling if the algorithms for surface flows end up being based on existing codes for standard two- and three-dimensional flows. Indeed, we shall see this is the case with the Closest Point Method. An interesting method for evolving interfaces on surfaces was proposed by Cheng et al. [2]. In their approach, a level set representation of the underlying surface was taken, with the evolving interface being represented by the intersection of two level set functions. The level set evolution equation for φ made use of standard gradients followed by projections to the surface rather than using the surface gradients that would otherwise appear in a surface PDE. Thus, the method evolved a level set PDE in R 3, and, at any time, gave the position of the interface on the surface as the zero contour of φ on the surface. See [2] for further details on the method as well as a fascinating selection of examples using the method. An alternative way of developing a method to evolve interfaces on surfaces is to start from a level set equation defined on a surface, e.g., a Hamilton Jacobi equation of the form φ t + H(t, x, φ, S φ) = 0, φ(0, x) = φ 0 (x), (1a) (1b) or some curvature-dependent generalization of this, and to solve it with some existing strategy for evolving PDEs on surfaces. For example, one
3 Level set equations on surfaces via the Closest Point Method 3 might apply the method of Bertalmío et al. [1] or Greer [6] to treat the surface PDE. These methods use a level set representation of the surface and replace surface gradients by standard gradients and projection operators in R 3 to get an embedding PDE which is defined throughout time and space and agrees with the surface evolution on the surface. This leads to similar or the same PDEs as those appearing in [2], and will therefore be very similar in character to the methods described there. In this paper, we will evolve the level set equations of Hamilton Jacobi type (1) according to the recently proposed Closest Point Method [18]. The Closest Point Method has a number of properties that make it quite attractive for solving level set equations on surfaces. First of all, it takes the underlying surface representation to be a closest point representation. This allows it to treat PDEs on surfaces that have boundaries, lack any clearly defined inside/outside or are of arbitrary codimension. Similar to level set based methods, the method uses an embedding PDE defined in the embedding space (e.g., R 3 ). The meaning and use of the embedding PDE is fundamentally different, however, since it is only valid initially, and therefore requires an extension step to ensure its accuracy. A desirable property of the Closest Point Method is that it works on sharply defined bands around the surface of interest without any loss of accuracy whatsoever. Finally, we note that the method, in its explicit form, leads to embedding PDEs which are simply the PDEs of the corresponding flow in the embedding space. This last advantage means that with the insertion of a simple extension step we can reuse highly effective three-dimensional level set codes without any other modifications to obtain the motion of level sets on surfaces. Note that this paper does not consider curvature-driven flows; such motions have been treated successfully using the Closest Point Method with a central difference spatial discretization in [18]. A crucial step in applying the Closest Point Method to solve level set equations on surfaces is to design an appropriate extension step. This paper considers a new extension based on a WENO interpolation which is sixth order in smooth regions and formally fourth order elsewhere. Our approach has all the practical advantages of the Closest Point Method: flexibility when selecting a surface, efficiency with respect to banding and extreme simplicity of implementation. We emphasize that while our new extension procedure will be used here for Hamilton Jacobi equations, it also could be valuable for treating much more general PDEs if high-order accuracy is desired but the PDE or the underlying surface is somewhere nonsmooth or marginally resolved. The paper unfolds as follows. Section 2 reviews the Closest Point Method, and includes details on the closest point representation and the method itself. Section 3 gives our new interpolation technique, a technique inspired by previous WENO methods. This section includes details on situations where WENO interpolation will be preferred over standard fixed-stencil Lagrange interpolation. Section 4 provides the numerical experiments. A focus is on numerical convergence, and we carry out a number of studies that show
4 4 Colin B. Macdonald, Steven J. Ruuth high-order accurate flows (up to fifth-order) for passive transport, normal flows, and the reinitialization PDE. A normal flow computation is performed on a non-trivial triangulated surface, illustrating that the method is in no way restricted to simple surfaces. We conclude by carrying out a standard level set calculation on a codimension-two hypersurface in 4D, the Klein bottle. This example highlights the method s ability to treat interesting surfaces without any inside/outside property. Finally Section 5 gives the paper s conclusions, and lists some areas for future work. 2 The Closest Point Method The Closest Point Method [18] is a general technique for solving partial differential equations and other processes on surfaces. This section reviews the method and some of its key features. We begin with a discussion on how the method represents surfaces before describing the algorithm itself. 2.1 Closest Point Representation of Surfaces The Closest Point Method for evolving PDEs on surfaces relies on a closest point representation of the underlying surface. Let the surface be embedded in R n then we introduce the closest point operator cp : R n R n such that given a point x, cp(x) is a point on the surface closest in Euclidean distance to x. If x is in a sufficiently small neighborhood of a smooth surface, then it will have a unique closest point, however, in general if there are multiple closest points to x, then we define cp(x) to return an arbitrarily chosen closest point. For example, if the surface is a circle of radius R centred at the origin embedded in R 2 Rx Ry then cp( x, y ) = provided x 2 +y, 2 x 2 +y 2 x, y 0, 0. The origin is closest to any point on the circle so we define cp( 0, 0 ) to be some arbitrary point on the circle. Because the Closest Point Method uses a closest point representation, a representation which is defined throughout the embedding space, it belongs to the class of embedding methods. Some other embedding methods for surface PDEs (e.g. [2,6]) make use of level set representations of the underlying surface. Note that the closest point representation has the advantage of not requiring a notion of inside/outside allowing the straightforward representation of surfaces with boundaries or non-orientable surfaces (e.g., a Möbius strip). Surfaces of codimension-two or higher such as the Klein bottle in 4D (Section 4.6) or a filament in 3D can also be represented without additional complication. Thus, an important feature of the closest point representation is that it does not inherently impose any limitations on the geometry or dimension of surfaces that can be represented.
5 Level set equations on surfaces via the Closest Point Method Equivalence of Gradients Besides the obvious flexibility they give for representing general surfaces, closest point representations have the advantage of giving us a means to extend quantities φ defined on the surface to the rest of space via φ(cp(x)). Such closest point extensions result in functions which are constant in the direction normal to the surface, at least within a neighborhood of the surface. This is important because it leads to simplified derivative calculations in the embedding space [18]. To proceed, let S denote the gradient intrinsic to the surface S. Then, at the surface, φ(cp(x)) = S φ since the function φ(cp(x)) is constant in the normal direction and therefore only varies along the surface. In other words, at points on the surface, surface gradients are the same as standard Cartesian gradients of φ(cp(x)). This will be all that we need to derive the embedding PDEs used in the examples appearing in this paper. A second principle also holds [18]. For this, let S denote the divergence operator intrinsic to the surface S and let v be any vector field on R 3 that is tangent at S, and also tangent at all surfaces displaced by a fixed distance from S (i.e., all surfaces defined as level sets of the distance function to S). Then at the surface v = S v. Combinations of this and the gradient property may be made, to allow for very general motion laws for secondorder operators, including the level set equation for curvature motion and other nonlinear diffusion operators [18]. Indeed, even higher-order and more general derivative replacements may be considered by carrying out multiple closest point extensions [18], although this has not yet been tried in practice. To help illustrate these ideas we provide two simple examples on a circle of radius R. Example 1 Consider the surface gradient, expressed in polar coordinates S φ = 0e r + φ s e θ, where s is the arc length. We have s = Rθ, therefore φ s = 1 R φ θ and S φ = 1 R φ θe θ. Now φ(cp(x)) = φ r (cp(x))e r + 1 r φ θ(cp(x))e θ. As noted earlier, φ(cp(x)) is constant in the direction normal to the surface which in this case is the radial direction, so φ r (cp(x)) = 0. Thus, for points x on the surface φ(cp(x)) = 1 R φ θ(cp(x))e θ = 1 R φ θ(x)e θ = S φ(x). Example 2 Consider, in polar coordinates, the surface Laplace-Beltrami operator 2 S φ = φ ss = 1 R φ 2 θθ and the Laplacian operator 2 φ(cp(x)) = φ rr (cp(x))+ 1 r φ r(cp(x))+ 1 r φ 2 θθ (cp(x)). Again, φ(cp(x)) is constant in the radial r-direction so both radial derivatives are zero, and for x on the surface 2 φ(cp(x)) = 1 R 2 φ θθ(x) = 2 Sφ(x).
6 6 Colin B. Macdonald, Steven J. Ruuth 2.3 The Algorithm Having determined a way of evaluating gradients and other derivatives in the embedding space, we are now in a position to give the Closest Point Method. Central to this task is to determine a PDE, defined in the embedding space, to generate the flow corresponding to the surface PDE. Suppose that our surface PDE takes the form ( ( )) S φ φ t = F t, x, φ, S φ, S, (2a) S φ φ(0, x) = φ 0 (x). (2b) More general PDEs can be treated directly by the Closest Point Method, but this form includes many of the second-order flows that arise in geometric interface motion [21, 14]. Based on the principles described in our previous subsection, and originally given in [18], we may replace the gradients and divergence operators by the standard Cartesian derivatives in the embedding space, according to φ t = F φ(0, x) = φ 0 (cp(x)), ( t, cp(x), φ(cp(x)), φ(cp(x)), ( )) φ(cp(x)), (3a) φ(cp(x)) (3b) and the solutions of (2) and (3) will agree at the surface. Notice that if we start from a φ(0, x) which comes from a closest point extension (as we do here in (3b)), then the right hand side of (3) and the embedding PDE ( ( )) φ φ t = F t, cp(x), φ, φ,, (4a) φ φ(0, x) = φ 0 (x), (4b) agree initially (although not for later times). This suggests a way of explicitly treating (3) efficiently: starting from a closest point extension of the solution at time-step t n, take one forward Euler step (or stage of a higherorder explicit Runge Kutta scheme) of (4) to advance in time to φ n+1. After this evolution step φ n+1 will not be constant in a direction normal to the surface. To regain this property, we perform a closest point extension of φ n+1 according to φ n+1 (x) = φ n+1 (cp(x)). This gives us an update which is constant in the direction normal to the surface, ensuring once again that (4) will initially agree with (3) and hence with the original surface PDE (2). We can then repeat the process of alternating between time-stepping (4) and performing closest point extensions to obtain the solution at the desired time. The semi-discrete (discrete in time, continuous in space) Closest Point Method with forward Euler time-stepping is thus: 1. Find the embedding PDE (4) corresponding to the surface PDE (2).
7 Level set equations on surfaces via the Closest Point Method 7 S x 1 q 1 x 2 q 2 grid points interpolation point interpolation kernel Fig. 1: Closest point extensions for grid points x 1 and x 2 where q 1 = cp(x 1) and q 2 = cp(x 2). In this case, low-order bilinear interpolation is used to estimate a value for φ(q i ) = φ(cp(x i)) from a stencil of the four neighboring grid points to q i. 2. Extend the initial conditions off the surface out into the surrounding domain to each point x, i.e., φ 0 (x) = φ 0 (cp(x)). At time t n perform the following steps to advance to time t n+1 : 3. Perform a forward Euler time-step ( ( )) φ φ n+1 = φ n + tf t n, cp(x), φ n, φ n n, φ n. 4. Perform a closest point extension for each point x φ n+1 (x) = φ n+1 (cp(x)). For higher-order explicit Runge Kutta methods, we employ a closest point extension following each stage of the Runge Kutta scheme. There is great flexibility available in choosing the spatial discretization. Similar to [18] we will select a finite difference method on a banded, but regular, Cartesian mesh. We will henceforth assume that the computation is carried out on a regular Cartesian mesh, noting that spectral methods have also been used to solve the embedding PDE; see [12] for details. The closest point extension is an interpolation step because, although x is a grid point in a regular Cartesian grid, cp(x) likely will not be. This is illustrated in Figure 1 where bilinear interpolation is used to estimate a value for φ(cp(x)) from a stencil of the four neighboring grid points. Clearly one could use a larger interpolation stencil to increase the accuracy of the interpolation, and this is precisely the focus of Section 3 where we construct a smooth high-order interpolation using dynamic stencils. We conclude this section with a few observations about the Closest Point Method: The evolution step of the Closest Point Method (step 3 above) is done using standard methods in the embedding space. Moreover the embedding
8 8 Colin B. Macdonald, Steven J. Ruuth PDE does not involve any projections or other surface-specific modifications; it is simply the standard PDE in the embedding space. This is very convenient since it implies that standard, well-understood algorithms in R 3 can be straightforwardly modified to accommodate surface flows. Indeed, this is exactly the approach we take in Section 4 where we reuse standard Hamilton Jacobi algorithms. The Closest Point Method uses a closest point representation for the surface. As discussed earlier in this section, this has the advantage of allowing the treatment of arbitrary surfaces of varying codimension, with boundaries, or even without orientation. The method does not introduce any artificial boundaries at the edge of the computational band to carry out banded calculations near the surface. The method merely computes on a band which is wide enough so that all values in the interpolation stencil have been accurately evolved (see Section 4.1). As a general principle, artificial boundaries should be avoided since they can lead to a degradation of accuracy even in simple diffusive problems [6]. Finally, we remark that the use and meaning of the embedding PDE is fundamentally different for the level set methods for PDEs on surfaces and Closest Point Method. In a level set approach the embedding PDE gives the solution at the surface for all times. In the Closest Point Method the embedding PDE only gives a valid evolution initially and for one explicit time-step (or stage in a Runge Kutta method). Thus the extension step is necessary to ensure the consistency of the algorithm. For further details on the Closest Point Method and on how it contrasts with other methods and, in particular, other embedding methods we refer to [18]. 3 WENO Interpolation Weighted Essentially Non-Oscillatory (WENO) spatial discretizations [10, 8, 7,9] are well-studied and commonly used for the evolution of PDEs with discontinuous or non-smooth solutions. We will make use of standard WENO discretizations in Section 4 for the evolution step of the Closest Point Method. However, the second part of the Closest Point Method the extension step requires an interpolation scheme to approximate φ(cp(x)) from grid points near the surface. We expect that fixed-stencil Lagrange interpolation may encounter difficulties from either non-smooth φ or from non-smooth or poorly resolved surfaces. In this Section we derive a WENObased interpolation in one dimension and in multiple dimensions. This is followed by some numerical experiments which illustrate that WENO interpolation can give very good results even when fixed-stencil Lagrange interpolation fails or gives undesirable results. WENO interpolation was considered in [20] to interpolate between subdomains of a multidomain WENO finite difference calculation for hyperbolic
9 Level set equations on surfaces via the Closest Point Method 9 S 2 z } { x i 2 x i 1 x i x x i+1 x i+2 x i+3 {z } S {z } 1 S 3 Fig. 2: The one dimensional interpolation grid, where x [x i, x i+1) and three candidate stencils S 1, S 2 and S 3. conservation laws. However, in [20] one of the candidate stencils corresponds to an extrapolation rather than an interpolation (see Fig. 2 of [20]). In this work we derive and study new WENO interpolation schemes in which all candidate polynomials are interpolants. The question of whether improved results can be obtained by allowing some extrapolation in the candidate polynomials will be addressed in future studies. 3.1 One-dimensional WENO interpolation Consider the 1D interpolation problem (Figure 2): given the six points x i 2, x i 1, x i, x i+1, x i+2, x i+3, corresponding data f i 2, f i 1, f i, f i+1, f i+2, f i+3 and a value of x [x i, x i+1 ), we want to estimate f(x). We being with three candidate interpolants p 1 (x) = f i 2 + fi 1 fi 2 x (x x i 2 ) + fi 2fi 1+fi 2 2 x (x x 2 i 2 )(x x i 1 ) + fi+1 3fi+3fi 1 fi 2 6 x 3 (x x i 2 )(x x i 1 )(x x i ), p 2 (x) = f i 1 + fi fi 1 x (x x i 1 ) + fi+1 2fi+fi 1 2 x (x x 2 i 1 )(x x i ) + fi+2 3fi+1+3fi fi 1 6 x (x x 3 i 1 )(x x i )(x x i+1 ), p 3 (x) = f i + fi+1 fi x (x x i ) + fi+2 2fi+1+fi 2 x (x x 2 i )(x x i+1 ) + fi+3 3fi+2+3fi+1 fi 6 x 3 (x x i )(x x i+1 )(x x i+2 ), where each interpolant corresponds to the cubic polynomial fit to the data given on one of the three candidate stencils S 1 = {x i 2,..., x i+1 }, S 2 = {x i 1,...,x i+2 }, and S 3 = {x i,...,x i+3 } (see Figure 2). These interpolants will be combined to give the WENO interpolant I WENO6 (x) = w 1 (x)p 1 (x) + w 2 (x)p 2 (x) + w 3 (x)p 3 (x), where w i (x), i = 1, 2, 3 are the required weights (still to be determined). In a smooth problem, all the point data should be used to obtain an interpolation which is as high order as possible, i.e., that agrees with the degree five interpolating polynomial through all six points. These ideal weights C i,
10 10 Colin B. Macdonald, Steven J. Ruuth i = 1, 2, 3 are given by C 1 (x) = (x i+2 x)(x i+3 x) 20 x 2, C 2 (x) = (x i+3 x)(x x i 2 ) 10 x 2, C 3 (x) = (x x i 2)(x x i 1 ) 20 x 2. Note that unlike WENO for hyperbolic conservation laws [10, 8] and WENO for Hamilton Jacobi problems [7], here the interpolation point x is not fixed and the values of the ideal weights depend on x. Still, these C i (x) are completely analogous to the well-known 1 10, 6 10, 3 10 weights in those works. In nonsmooth regions, at least one of the interpolations p i (x), i = 1, 2, 3 will be superior to an interpolation with the ideal values because of the problems associated with fitting high-order polynomials to nonsmooth data namely highly oscillatory results. To decide which stencils to use, we compute a smoothness indicator for each interpolant. We take the smoothness indicator IS i for interpolant p i as a sum of squares of scaled L 2 norms of all the derivatives of the [interpolant p i ] over the interval [of interpolation] [22]. Specifically IS i = 3 xi+1 ( x) 2j 1 j=1 x i ( d j ) 2 p i (x) dx. (7) If a particular interpolant exhibits rapid change on the interval (x i, x i+1 ) compared to the other two interpolants, then it will have larger-in-magnitude derivatives on that interval, which in turn increases the corresponding smoothness indicator (7). Smooth interpolants those that are desirable for use in our interpolation will exhibit less drastic changes in their derivatives and thus minimize (7). If all three candidate interpolants are smooth, then all three smoothness indicators will have similar (small) values. For completeness, (7) can be worked out as dx j IS 1 = ( 814f 2 i f2 i f2 i f2 i f if i f i f i f i f i f i+1 f i 1 683f i+1 f i f i 1 f i 2 ) /180, IS 2 = ( 1986f 2 i f 2 i + 244f 2 i f 2 i f i f i f i f i f i f i f i+1 f i f i+2 f i+1 293f i+2 f i 1 ) /180, IS 3 = ( 814f 2 i f2 i f2 i f2 i+3 683f if i f i f i f i f i f i+1 f i f i+1 f i f i+2 f i+3 ) /180. We note as expected that the smoothness indicators do not depend on the particular point of interpolation x because they measure a property of the interpolant candidates themselves.
11 Level set equations on surfaces via the Closest Point Method 11 y 2.4 IS = IS 2 = IS 3 = 9.07 w (x) = w (x) = 1.27e 3 2 w 3 (x) = 1.05e data point 1.4 WENO interp. Lagrange interp. 1.2 x i 2 x i 1 x i x i+1 x i+2 x i+3 x Fig. 3 One-dimensional interpolation example contrasting Lagrange and WENO interpolation near a discontinuity. The computation of the weights is carried out using the smoothness indicators as in the standard WENO procedure by first calculating α i (x) = C i(x), i = 1, 2, 3, (ε + IS i ) 2 where ε is a small parameter to prevent division-by-zero in the case when all IS i 0; we use ε = in all our calculations. Finally, the weights are w i (x) = α i (x), i = 1, 2, 3. α 1 (x) + α 2 (x) + α 3 (x) Appendix A constructs a formally fourth-order WENO interpolation from two candidate quadratic interpolants using a similar approach to above. Both of these WENO interpolation routines are constructed so that wherever the ideal weights are chosen (i.e., w i (x) = C i (x)), the results are identical to using fixed-stencil interpolating polynomials through all candidate points. Therefore, in this case, they are also identical to the fixed-stencil Lagrange interpolation procedure used in previous Closest Point Method works [18,12]. In non-smooth problems, however, stencils corresponding to smooth regions are automatically selected. Figure 3 shows one such example, where a one-dimensional function is reconstructed using interpolation in a cell adjacent to a discontinuity. Lagrange interpolation based on the six data points gives a spurious oscillation in the cell of interest, since it interpolates across the discontinuity. On the other hand, with WENO interpolation the smoothness indicators IS 2 and IS 3 are very large resulting in small weights w 2 and w 3 and thus the data from the rightmost two data points give a negligible contribution to the interpolation. This leads to the desired non-oscillatory result. Another type of problem for which WENO based interpolation is expected to give superior results arises when the underlying surface is marginally resolved by the grid or is nonsmooth. We investigate the former possibility in Section 3.3.
12 12 Colin B. Macdonald, Steven J. Ruuth grid point 2D interp. point 1D interp. point in x Fig. 4: Using a 1D interpolation scheme to build a 2D interpolation routine. Suppose we want to find a value at the point by interpolating the values at the grid points. We begin by performing multiple 1D interpolations in the horizontal direction to obtain the values at the points. We then do a final 1D interpolation of the values at points to obtain a value at point. 3.2 Higher-Dimensional WENO Interpolation Higher-dimensional interpolation is built in the standard fashion from onedimensional interpolations. For example, two-dimensional sixth-order WENO interpolation is carried out by first interpolating six times in the x-direction to obtain six values which have x-coordinate values that agree with the interpolation point. One-dimensional interpolation is then carried out on these six points to get the desired interpolated value. See Figure 4 for an illustration. Three and higher dimensions are treated in a similar dimensionby-dimension manner. 3.3 WENO Interpolation and Marginally Resolved Surfaces Even when the solution of the PDE is smooth, WENO interpolation can offer superior results over fixed-stencil Lagrange interpolation when the underlying surface is marginally resolved or otherwise nonsmooth. We demonstrate the former situation by considering the reinitialization equation (see Section 4.4) with sinusoidal initial conditions on the lines x = a and x = b, i.e., φ t + sgn(φ 0 )( S φ 1) = 0, with φ 0 (a, y) = sin(πy), φ 0 (b, y) = cos(πy). Thinking of the two lines as representing different parts of a surface embedded in R 2, we may apply the Closest Point Method to compute approximations of the solution. Clearly, the underlying PDE and initial conditions give a smooth flow. The problem becomes computationally interesting when the two lines are separated by only a few cells. Such problems illustrate how the
13 Level set equations on surfaces via the Closest Point Method φ 0 (a,y) φ 0 (b,y) y (a) Initial conditions φ(a,y) φ(b,y) exact y (b) Lagrange interpolation φ(a,y) φ(b,y) exact y (c) WENO interpolation Fig. 5: A comparison of Lagrange interpolation versus WENO interpolation on closely spaced surfaces with b a = 4 x. This is a signed distance computation (Section 4.4) with t f = 4 and periodic boundary conditions. method treats a smooth PDE on a smooth but marginally resolved surface and gives us insight into whether WENO interpolation can give superior results to the standard Lagrange interpolation approach on marginally resolved surfaces. Figure 5 shows the results when the lines are separated by four grid nodes (in this example, b a = 4 x). Using standard WENO for Hamilton Jacobi equations in 2D for the evolution step (see Section 4) and Lagrange interpolation (based on degree five polynomials) for the closest point extension, leads to an obviously incorrect solution with discontinuities and substantial movement of the zero-contour. This error is due to the close proximity of the lines resulting in the stencil using data from both lines, an approach which is clearly nonlocal and incorrect. WENO interpolation, however, chooses stencils based on smoothness and hence avoids using data from the more distant line. This leads to a non-oscillatory numerical approximation that is in excellent agreement with the exact result. It turns out via a straightforward examination of the two interpolation stencils and the evolution stencil that to avoid nonlocal interactions, there must be eight grid points between the lines in the Lagrange interpolation case but only four grid points in the WENO interpolation case. We conclude that it is safer to use WENO for the interpolation whenever the PDE or the underlying surface is nonsmooth or marginally resolved. We also recommend WENO-based Hamilton Jacobi methods in the evolution step. Such methods have been widely used to treat standard Hamilton Jacobi equations in R 2 and R 3 with good results and will be relatively safe when nonsmooth or marginally resolved problems arise. 4 Numerical Results We now provide some numerical studies illustrating the behaviour and convergence of the method for a variety of interesting cases: passive transport,
14 14 Colin B. Macdonald, Steven J. Ruuth BW evolve BW extend grid points interpolation point interpolation kernel evolution kernel Fig. 6: The minimum bandwidths involved in a Closest Point Method computation for a surface in the vicinity of point. geometric flow under constant normal flow, and redistancing via the standard reinitialization PDE. We also illustrate the geometric flexibility of the method by treating normal flow on the triangulated surface of a human hand, and flow on a Klein bottle, a codimensional-two object in four dimensions. In all of our examples, our WENO-based interpolation procedure is used to carry out the extension step and standard Hamilton Jacobi WENO-based techniques are used to treat the embedding PDE. For efficiency, calculations are performed in a narrow band around the surface as is described in Section Bandwidth The evolution and extension steps of the Closest Point Method may be performed over the entire embedding space. However, such an implementation is inefficient because only a subset of grid points in the vicinity of the surface have any effect on the numerical solution. A more efficient approach is to perform calculations in a narrow band around the surface. This band must be wide enough to ensure that all nodal values within the interpolation stencil have been accurately evolved. By working in such a band we obtain the same results as we would for a global calculation because the closest point extension extends all values out from the surface after each step Bandwidth upper bounds We begin by determining upper bounds on the bandwidth. We consider an R d embedding space and for simplicity assume that the grid spacing is x in all d dimensions. Our WENO interpolation stencil from Section 3.2 is a d-dimensional hypercube where each side has a width of 5 x. Considering Figure 6, the evolution step can therefore be carried out on a set of grid points which lie within a distance of BW evolve = x = 3 d x, (9)
15 Level set equations on surfaces via the Closest Point Method 15 Table 1 Sufficient bandwidth for Closest Point Method evolution and interpolation steps in various embedding dimensions. dim. BW evolve BW extend 2D x x 3D x x 4D 6 x x from the surface, i.e., the diagonal distance across a d-dimensional hypercube with side widths 3 x. To generate accurate values on points inside the interpolation kernel at t n+1, the evolution kernel needs accurate values inside its own finite difference stencil at t n. Thus the interpolation step at t n must update all grid points within the evolution stencil applied at every grid point in the interpolation stencil around every point on the surface. In our case, the fifth-order Hamilton Jacobi WENO finite difference scheme has a stencil consisting of a hypercross (see Figure 6) where each arm has width 6 x. From the furthest corner of the interpolation kernel hypercube, the evolution stencil extends in grid-aligned directions; the extension step should therefore be performed on a bandwidth of BW extend = 3 2 (d 1) + (3 + 3) 2 x. (10) Values of the bandwidths (9) and (10) for two, three and four dimensions are tabulated in Table 1. Bandwidth calculations for standard Lagrange interpolation can be carried out using similar considerations; see [18] for further details. When defining the computational domain based on these upper bounds, we note there may be some points which are inside BW evolve but are outside the union of the interpolation kernels around each closest point on the surface. These points therefore have, at most, a negligible effect 1 on the solution as the calculation proceeds. Evolving on these points thus introduces redundant computation. Likewise, there may be points inside BW extend which are not needed for the evolution; these introduce additional redundant calculations. To illustrate these ideas, Table 2 gives some results for a Closest Point Method calculation on bands which vary by width. We find that our banded procedures gives results identical to computing over the entire embedding space. Table 2 also illustrates that using smaller bandwidths than those in Table 1 results in a different solution. 1 In principle, these points could influence the artificial dissipation parameters appearing in schemes such as the (global) Lax Friedrichs (LF) scheme [4, 14] or the local Lax Friedrichs (LLF) scheme [23,14]. Although we did not observe any such effects in practice, the stencil set approach discussed next avoids this issue altogether.
16 16 Colin B. Macdonald, Steven J. Ruuth The stencil set approach As noted above, using the bandwidth upper bounds (9) and (10) to define the computational bands may include unnecessary points thus increasing the computational expense without improving accuracy. An alternate approach is to explicitly construct the sets of points which define the evolution and extension bands. Let S evolve be the set of nodes in the evolution band, and S extend be the set of nodes in the extension band. We proceed as follows: Initialize both sets to the empty set, i.e., set S evolve = and S extend =. Loop over all grid nodes x in the embedding space that are within a distance BW extend of the surface: Loop over all grid nodes y in the interpolation stencil surrounding cp(x): Add node y to the evolution band by setting S evolve = {y} S evolve. Let K be the set of grid nodes appearing in the evolution stencil for y. Add this set to the extension band by setting S extend = K S extend. After this procedure, S evolve and S extend are the sets over which the evolution and extension steps should be carried out for the Closest Point Method. Table 2 confirms that for a LLF calculation, the stencil set approach produces identical results to computing on the entire embedding domain. Table 2 also indicates the number of points in each band and we note that in three dimensions the extension band contains 94% of the points used in the bandwidth approach. Likewise, the evolution band contains 85% of the points used in the bandwidth approach. In the Klein bottle computation in 4D (see Section 4.6), these savings are more significant since only 72% and 54% of the points are required in the respective bands. The stencil set approach thus offers computational savings, which, in combination with its simplicity, leads us to use this approach in the calculations appearing throughout this section. 4.2 Passive transport: flow under a specified velocity field An important case of interface motion is passive transport or flow under a specified velocity field. In this case, an interface represented by the zerocontour of a level set function is advected via a velocity field which is independent of the interface geometry. On the surface, such a motion corresponds to the equation φ t + V S φ = 0, for some velocity field V specified on the surface. To evolve this surface PDE using the Closest Point Method, we instead treat the embedding PDE φ t + V (cp(x)) φ = 0, (11)
17 Level set equations on surfaces via the Closest Point Method 17 Table 2: Numerical verification of the bandwidths for a 3D Closest Point Method calculation. The actual values of error are not important here; we note only that the errors are identical (down to the bit-pattern of the double precision floating point numbers) provided the bandwidths are taken larger than the minimums from Table 1. (The computation is the same as Table 4 on a grid of with error measured as the maximum absolute value of φ along the theoretical interface location with x 0 and z 0.) banding strategy error points in band BW evolve BW extend evolution extension 10 x 10 x x 7.35 x x 7.35 x x 7.3 x stencil set bands no banding on a uniform 3D grid. Equation (11) is simply the standard equation for passive transport in 3D since V (cp(x)) is well-defined in R 3. It is therefore natural to use standard methods [14], and approximate φ using upwinding and WENO approximations in a dimension-by-dimension fashion. Namely, for each point x j we compute φ + x from the values {φ j 2,..., φ j+3 } using the Hamilton Jacobi WENO procedure. Similarly we compute φ x using {φ j 3,..., φ j+2 }. If v x, the first component of V (cp(x)), is positive then we approximate φ x with φ x, otherwise we approximate φ x with φ + x. The same procedure is repeated to approximate φ y and φ z. We then use these values to approximate V (cp(x)) φ = v x φ x + v y φ y + v z φ z which allows us to proceed by the method-of-lines. Time-stepping is done with the threestage, third-order strong-stability-preserving (SSP) Runge Kutta scheme [23] (SSPRK(3,3)) with t = 1 2 x and with closest point extensions performed after each stage. We emphasize that apart from the closest point extensions, this is simply a standard procedure used for evolving (11) in three dimensions. To test the numerical convergence of the method we consider a circular interface on a unit sphere, evolving by passive transport. As shown in Figure 7, we take a velocity field that is of unit length and emanates from one pole to the other in a radially symmetric fashion about the axis between the poles (like lines of longitude on a tilted globe). A comparison of the numerical result against the exact solution is provided in Table 3. These results show a clear fifth-order convergence. For this smooth problem we see that the Closest Point Method gives the full accuracy of the underlying discretization of the embedding PDE. This implies that our closest point extension procedure based on WENO interpolation performs as anticipated and without degrading the fifth-order accurate treatment of the embedding PDE.
18 18 Colin B. Macdonald, Steven J. Ruuth Fig. 7: Passive transport of a circular interface on a sphere. The circle starts initially at y = 0.9 on the far side of the sphere. It is advected over the surface of the sphere via the velocity field indicated with arrows to the final solution at t f = 2.24 shown on the front of the sphere. The exact solution also a circle is shown but within the tolerances of the plot, it is almost indistinguishable from the numerical solution. A computational grid is chosen on the domain [ 2, 2] 3. Table 3: Convergence study for a circle moving on a sphere according to a specified velocity field. Error-in-position measures the error in the position of the interface along the surface where z = 0. Graphically, the situation is similar to Figure 7, but with the circle beginning initially at y = 0.25 and running to t f = 1. The embedding domain is [ 2,2] 3. grid error-in-position order Normal flow We next consider the case of normal flow where the motion of the interface is governed not by an external velocity field but by the shape of the interface itself. We begin with constant normal flow φ t + C S φ = 0, where the interface moves in the direction of its normal vector at a constant speed C. If C = 1, we refer to this as unit normal flow and for this problem,
19 Level set equations on surfaces via the Closest Point Method 19 Table 4: Convergence study for constant normal flow for a circle moving on a unit-radius sphere. Error-in-position measures the maximum error in the position of the zero-contour over the quadrant of the sphere where x 0 and z 0. The circle begins at y = 0.25 and the computation proceeds using LLF to t f = 0.5 with t = 1 x. The computational domain is 2 [ 2,2]3. grid error-in-position order the underlying 3D embedding PDE is φ t + φ = 0, (12) which is a Hamilton Jacobi equation with Hamiltonian H( φ) = φ. We discretize the embedding PDE in space using Lax Friedrichs for Hamilton Jacobi equations [14, 16]. Specifically we use the numerical Hamiltonian φ Ĥ = x +φ+ x 2, φ y +φ+ y 2, φ z +φ+ z 2 α x ( φ + x φ x 2 ) α y ( φ + y φ y 2 ) ( ) α z φ + z φ z 2, (13) where φ + x, φ y, etc. are calculated using Hamilton Jacobi WENO and the latter three terms provide artificial dissipation. The dissipation coefficients α x, α y, and α z are calculated as the bounds for partial derivatives of the Hamiltonian H over some domain, the choice of which leads to variations of the Lax Friedrichs scheme. We implement the local Lax Friedrichs (LLF) and stencil local Lax Friedrichs (SLLF) variants [14]. After computing the numerical Hamiltonian, we can proceed by the method-of-lines where timestepping is again done with the SSPRK(3,3) scheme with t = 1 2 x and closest point extensions after each stage. To test the order of convergence of our method, we compute the motion of a circle on a sphere via unit normal flow. The exact solution is simply the circle moved along the surface of the sphere, similar to the passive transport case in Figure 7. Table 4 shows that the Closest Point Method achieves at least fifth order on this problem, again validating the choice of our WENO interpolation technique. Of course, non-spherical surfaces may also be treated. Figure 8 shows the motion of an initial interface on a torus, as computed using the SLLF scheme for the embedding PDE. As anticipated, the interface moves from left to right parallel to the y-axis via unit normal flow, separating and recombining as necessary.
20 20 Colin B. Macdonald, Steven J. Ruuth Fig. 8: Unit normal flow on a torus with radii 0.8 and 0.4. The interface begins at y = 1 and the computation proceeds using SLLF to t f = 2. The interface is shown at every 0.4 units of time. A computational grid is taken on the embedding domain [ 2, 2] Signed Distance / Reinitialization In practical applications, level set functions may become either too steep or flat during their evolution. Reinitialization is often used to take general level set functions closer to signed distance functions, or even to generate accurate approximations of signed distance functions. Given the widespread use of such techniques, it is of interest to see whether the corresponding surface reinitialization PDE φ t + sgn(φ 0 )( S φ 1) = 0, (14) can be accurately treated using the Closest Point Method. Here we assume that the initial interface is, as usual, specified as the zero-contour of an initial φ 0. Starting from φ 0, the surface level set equation (14) evolves φ so that in the steady state φ(x) gives the signed distance (along the surface) from x to the interface. In practice, this evolution will also move the zero-contour of φ; we want this motion to be small, and to vanish as the discretization grid spacings tend to zero. Treating this problem using the Closest Point Method is straightforward; we discretize the corresponding three dimensional redistancing embedding PDE φ t + sgn(φ 0 )( φ 1) = 0, (15a) and as is standard practice [14, 5, 13], we replace the signum function with a smoother version sgn(φ 0 ) S(φ o ) = φ 0 φ ǫ 2. (15b) Typically, ǫ is set equal to x but in this work we use ǫ = x, as suggested in [3]. This latter choice of ǫ gave considerably better convergence results
Section 1.1. Introduction to R n
The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure toMore information
MA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem
MA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem David L. Finn November 30th, 2004 In the next few days, we will introduce some of the basic problems in geometric modelling, andMore information
Calculus C/Multivariate Calculus Advanced Placement G/T Essential Curriculum
Calculus C/Multivariate Calculus Advanced Placement G/T Essential Curriculum UNIT I: The Hyperbolic Functions basic calculus concepts, including techniques for curve sketching, exponential and logarithmicMore information
We can display an object on a monitor screen in three different computer-model forms: Wireframe model Surface Model Solid model
CHAPTER 4 CURVES 4.1 Introduction In order to understand the significance of curves, we should look into the types of model representations that are used in geometric modeling. Curves play a very significantMore information
5 Numerical Differentiation
D. Levy 5 Numerical Differentiation 5. Basic Concepts This chapter deals with numerical approximations of derivatives. The first questions that comes up to mind is: why do we need to approximate derivativesMore information
Level Set Evolution Without Re-initialization: A New Variational Formulation
Level Set Evolution Without Re-initialization: A New Variational Formulation Chunming Li 1, Chenyang Xu 2, Changfeng Gui 3, and Martin D. Fox 1 1 Department of Electrical and 2 Department of Imaging 3More information
Level Set Framework, Signed Distance Function, and Various Tools
Level Set Framework Geometry and Calculus Tools Level Set Framework,, and Various Tools Spencer Department of Mathematics Brigham Young University Image Processing Seminar (Week 3), 2010 Level Set FrameworkMore information
Advanced CFD Methods 1
Advanced CFD Methods 1 Prof. Patrick Jenny, FS 2014 Date: 15.08.14, Time: 13:00, Student: Federico Danieli Summary The exam took place in Prof. Jenny s office, with his assistant taking notes on the answers.More information
Natural Neighbour Interpolation
Natural Neighbour Interpolation DThe Natural Neighbour method is a geometric estimation technique that uses natural neighbourhood regions generated around each point in the data set. The method is particularlyMore information
11.1. Objectives. Component Form of a Vector. Component Form of a Vector. Component Form of a Vector. Vectors and the Geometry of Space
11 Vectors and the Geometry of Space 11.1 Vectors in the Plane Copyright Cengage Learning. All rights reserved. Copyright Cengage Learning. All rights reserved. 2 Objectives! Write the component form ofMore information
Interactive simulation of an ash cloud of the volcano Grímsvötn
Interactive simulation of an ash cloud of the volcano Grímsvötn 1 MATHEMATICAL BACKGROUND Simulating flows in the atmosphere, being part of CFD, is on of the research areas considered in the working groupMore information
Mean Value Coordinates
Mean Value Coordinates Michael S. Floater Abstract: We derive a generalization of barycentric coordinates which allows a vertex in a planar triangulation to be expressed as a convex combination of itsMore information
H.Calculating Normal Vectors
Appendix H H.Calculating Normal Vectors This appendix describes how to calculate normal vectors for surfaces. You need to define normals to use the OpenGL lighting facility, which is described in ChapterMore information
Figure 2.1: Center of mass of four points.
Chapter 2 Bézier curves are named after their inventor, Dr. Pierre Bézier. Bézier was an engineer with the Renault car company and set out in the early 196 s to develop a curve formulation which wouldMore information
Stress Recovery 28 1
. 8 Stress Recovery 8 Chapter 8: STRESS RECOVERY 8 TABLE OF CONTENTS Page 8.. Introduction 8 8.. Calculation of Element Strains and Stresses 8 8.. Direct Stress Evaluation at Nodes 8 8.. ExtrapolationMore information
Introduction to the Finite Element Method (FEM)
Introduction to the Finite Element Method (FEM) ecture First and Second Order One Dimensional Shape Functions Dr. J. Dean Discretisation Consider the temperature distribution along the one-dimensionalMore information
Blasius solution. Chapter 19. 19.1 Boundary layer over a semi-infinite flat plate
Chapter 19 Blasius solution 191 Boundary layer over a semi-infinite flat plate Let us consider a uniform and stationary flow impinging tangentially upon a vertical flat plate of semi-infinite length FigMore information
15.062 Data Mining: Algorithms and Applications Matrix Math Review
.6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to developMore information
the points are called control points approximating curve
Chapter 4 Spline Curves A spline curve is a mathematical representation for which it is easy to build an interface that will allow a user to design and control the shape of complex curves and surfaces.More information
Appendix E: Graphing Data
You will often make scatter diagrams and line graphs to illustrate the data that you collect. Scatter diagrams are often used to show the relationship between two variables. For example, in an absorbanceMore information
Geometry and Topology from Point Cloud Data
Geometry and Topology from Point Cloud Data Tamal K. Dey Department of Computer Science and Engineering The Ohio State University Dey (2011) Geometry and Topology from Point Cloud Data WALCOM 11 1 / 51More information
A QUIK GUIDE TO THE FOMULAS OF MULTIVAIABLE ALULUS ontents 1. Analytic Geometry 2 1.1. Definition of a Vector 2 1.2. Scalar Product 2 1.3. Properties of the Scalar Product 2 1.4. Length and Unit VectorsMore information
Mathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which areMore information
Computer Graphics. Geometric Modeling. Page 1. Copyright Gotsman, Elber, Barequet, Karni, Sheffer Computer Science - Technion. An Example.
An Example 2 3 4 Outline Objective: Develop methods and algorithms to mathematically model shape of real world objects Categories: Wire-Frame Representation Object is represented as as a set of pointsMore information
Understanding Poles and Zeros
MASSACHUSETTS INSTITUTE OF TECHNOLOGY DEPARTMENT OF MECHANICAL ENGINEERING 2.14 Analysis and Design of Feedback Control Systems Understanding Poles and Zeros 1 System Poles and Zeros The transfer functionMore information
Numerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a numberMore information
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 19, NO. 12, DECEMBER 2010 3243 Distance Regularized Level Set Evolution and Its Application to Image Segmentation Chunming Li, Chenyang Xu, Senior Member, IEEE,More information
European Conference on Computational Fluid Dynamics ECCOMAS CFD 26 P. Wesseling, E. Oñate and J. Périaux (Eds) c TU Delft, The Netherlands, 26 HIGH ORDER WENO SCHEMES ON UNSTRUCTURED TETRAHEDRAL MESHESMore information
Metric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give someMore information
CHAPTER 1 Splines and B-splines an Introduction
CHAPTER 1 Splines and B-splines an Introduction In this first chapter, we consider the following fundamental problem: Given a set of points in the plane, determine a smooth curve that approximates theMore information
Computational Geometry. Lecture 1: Introduction and Convex Hulls
Lecture 1: Introduction and convex hulls 1 Geometry: points, lines,... Plane (two-dimensional), R 2 Space (three-dimensional), R 3 Space (higher-dimensional), R d A point in the plane, 3-dimensional space,More information
Chapter 2. Derivation of the Equations of Open Channel Flow. 2.1 General Considerations
Chapter 2. Derivation of the Equations of Open Channel Flow 2.1 General Considerations Of interest is water flowing in a channel with a free surface, which is usually referred to as open channel flow.More information
Solutions to Exercises, Section 5.1
Instructor s Solutions Manual, Section 5.1 Exercise 1 Solutions to Exercises, Section 5.1 1. Find all numbers t such that ( 1 3,t) is a point on the unit circle. For ( 1 3,t)to be a point on the unit circleMore information
SOLUTIONS. f x = 6x 2 6xy 24x, f y = 3x 2 6y. To find the critical points, we solve
SOLUTIONS Problem. Find the critical points of the function f(x, y = 2x 3 3x 2 y 2x 2 3y 2 and determine their type i.e. local min/local max/saddle point. Are there any global min/max? Partial derivativesMore information
Computer Graphics CS 543 Lecture 12 (Part 1) Curves. Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)
Computer Graphics CS 54 Lecture 1 (Part 1) Curves Prof Emmanuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) So Far Dealt with straight lines and flat surfaces Real world objects includeMore information
Introduction to the Finite Element Method
Introduction to the Finite Element Method 09.06.2009 Outline Motivation Partial Differential Equations (PDEs) Finite Difference Method (FDM) Finite Element Method (FEM) References Motivation Figure: crossMore information
Hardware-Aware Analysis and. Presentation Date: Sep 15 th 2009 Chrissie C. Cui
Hardware-Aware Analysis and Optimization of Stable Fluids Presentation Date: Sep 15 th 2009 Chrissie C. Cui Outline Introduction Highlights Flop and Bandwidth Analysis Mehrstellen Schemes Advection CachingMore information
Path Tracking for a Miniature Robot
Path Tracking for a Miniature Robot By Martin Lundgren Excerpt from Master s thesis 003 Supervisor: Thomas Hellström Department of Computing Science Umeå University Sweden 1 Path Tracking Path trackingMore information
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 126, Number 12, December 1998, Pages 3721 3726 S 0002-9939(98)04456-6 ON SELF-INTERSECTIONS OF IMMERSED SURFACES GUI-SONG LI (Communicated by RonaldMore information
Differential Relations for Fluid Flow. Acceleration field of a fluid. The differential equation of mass conservation
Differential Relations for Fluid Flow In this approach, we apply our four basic conservation laws to an infinitesimally small control volume. The differential approach provides point by point details ofMore information
Numerical Methods for Differential Equations
Numerical Methods for Differential Equations Course objectives and preliminaries Gustaf Söderlind and Carmen Arévalo Numerical Analysis, Lund University Textbooks: A First Course in the Numerical AnalysisMore information
Solving Simultaneous Equations and Matrices
Solving Simultaneous Equations and Matrices The following represents a systematic investigation for the steps used to solve two simultaneous linear equations in two unknowns. The motivation for consideringMore information
Math 241, Exam 1 Information.
Math 241, Exam 1 Information. 9/24/12, LC 310, 11:15-12:05. Exam 1 will be based on: Sections 12.1-12.5, 14.1-14.3. The corresponding assigned homework problems (see http://www.math.sc.edu/ boylan/sccourses/241fa12/241.html)More information
OPRE 6201 : 2. Simplex Method
OPRE 6201 : 2. Simplex Method 1 The Graphical Method: An Example Consider the following linear program: Max 4x 1 +3x 2 Subject to: 2x 1 +3x 2 6 (1) 3x 1 +2x 2 3 (2) 2x 2 5 (3) 2x 1 +x 2 4 (4) x 1, x 2More information
OpenFOAM Optimization Tools
OpenFOAM Optimization Tools Henrik Rusche and Aleks Jemcov email@example.com and email@example.com Wikki, Germany and United Kingdom OpenFOAM Optimization Tools p. 1 Agenda Objective Review optimisationMore information
50 CHAPTER 4 4. METHODS FOR MEASURING DISTANCE IN IMAGES 4.1. INTRODUCTION In image analysis, the distance transform measures the distance of each object point from the nearest boundary and is an importantMore information
Figure 1.1 Vector A and Vector F
CHAPTER I VECTOR QUANTITIES Quantities are anything which can be measured, and stated with number. Quantities in physics are divided into two types; scalar and vector quantities. Scalar quantities haveMore information
Grid adaptivity for systems of conservation laws
Grid adaptivity for systems of conservation laws M. Semplice 1 G. Puppo 2 1 Dipartimento di Matematica Università di Torino 2 Dipartimento di Scienze Matematiche Politecnico di Torino Numerical AspectsMore information
INTERPOLATION. Interpolation is a process of finding a formula (often a polynomial) whose graph will pass through a given set of points (x, y).
INTERPOLATION Interpolation is a process of finding a formula (often a polynomial) whose graph will pass through a given set of points (x, y). As an example, consider defining and x 0 =0, x 1 = π 4, xMore information
Copyright 2011 Casa Software Ltd. www.casaxps.com. Centre of Mass
Centre of Mass A central theme in mathematical modelling is that of reducing complex problems to simpler, and hopefully, equivalent problems for which mathematical analysis is possible. The concept ofMore information
SOLID MECHANICS TUTORIAL MECHANISMS KINEMATICS - VELOCITY AND ACCELERATION DIAGRAMS This work covers elements of the syllabus for the Engineering Council exams C105 Mechanical and Structural EngineeringMore information
Concepts in Calculus III
Concepts in Calculus III Beta Version UNIVERSITY PRESS OF FLORIDA Florida A&M University, Tallahassee Florida Atlantic University, Boca Raton Florida Gulf Coast University, Ft. Myers Florida InternationalMore information
The Fourth International DERIVE-TI92/89 Conference Liverpool, U.K., 12-15 July 2000. Derive 5: The Easiest... Just Got Better!
The Fourth International DERIVE-TI9/89 Conference Liverpool, U.K., -5 July 000 Derive 5: The Easiest... Just Got Better! Michel Beaudin École de technologie supérieure 00, rue Notre-Dame Ouest MontréalMore information
Finite Elements for 2 D Problems
Finite Elements for 2 D Problems General Formula for the Stiffness Matrix Displacements (u, v) in a plane element are interpolated from nodal displacements (ui, vi) using shape functions Ni as follows,More information
Finite Element Formulation for Plates - Handout 3 -
Finite Element Formulation for Plates - Handout 3 - Dr Fehmi Cirak (fc286@) Completed Version Definitions A plate is a three dimensional solid body with one of the plate dimensions much smaller than theMore information
1.7 Cylindrical and Spherical Coordinates
56 CHAPTER 1. VECTORS AND THE GEOMETRY OF SPACE 1.7 Cylindrical and Spherical Coordinates 1.7.1 Review: Polar Coordinates The polar coordinate system is a two-dimensional coordinate system in which theMore information
Problem 1 (10 pts) Find the radius of convergence and interval of convergence of the series
1 Problem 1 (10 pts) Find the radius of convergence and interval of convergence of the series a n n=1 n(x + 2) n 5 n 1. n(x + 2)n Solution: Do the ratio test for the absolute convergence. Let a n =. Then,More information
P. Lu, Sh. Huang and K. Jiang
416 Rev. Adv. Mater. Sci. 33 (2013) 416-422 P. Lu, Sh. Huang and K. Jiang NUMERICAL ANALYSIS FOR THREE-DIMENSIONAL BULK METAL FORMING PROCESSES WITH ARBITRARILY SHAPED DIES USING THE RIGID/VISCO-PLASTICMore information
AN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS Revised Edition James Epperson Mathematical Reviews BICENTENNIAL 0, 1 8 0 7 z ewiley wu 2007 r71 BICENTENNIAL WILEY-INTERSCIENCE A John Wiley & Sons, Inc.,More information
How High a Degree is High Enough for High Order Finite Elements?
This space is reserved for the Procedia header, do not use it How High a Degree is High Enough for High Order Finite Elements? William F. National Institute of Standards and Technology, Gaithersburg, Maryland,More information
Multi-Block Gridding Technique for FLOW-3D Flow Science, Inc. July 2004
FSI-02-TN59-R2 Multi-Block Gridding Technique for FLOW-3D Flow Science, Inc. July 2004 1. Introduction A major new extension of the capabilities of FLOW-3D -- the multi-block grid model -- has been incorporatedMore information
Understanding Basic Calculus
Understanding Basic Calculus S.K. Chung Dedicated to all the people who have helped me in my life. i Preface This book is a revised and expanded version of the lecture notes for Basic Calculus and otherMore information
ESSENTIAL COMPUTATIONAL FLUID DYNAMICS Oleg Zikanov WILEY JOHN WILEY & SONS, INC. CONTENTS PREFACE xv 1 What Is CFD? 1 1.1. Introduction / 1 1.2. Brief History of CFD / 4 1.3. Outline of the Book / 6 ReferencesMore information
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linearMore information
We call this set an n-dimensional parallelogram (with one vertex 0). We also refer to the vectors x 1,..., x n as the edges of P.
Volumes of parallelograms 1 Chapter 8 Volumes of parallelograms In the present short chapter we are going to discuss the elementary geometrical objects which we call parallelograms. These are going toMore information
Express Introductory Training in ANSYS Fluent Lecture 1 Introduction to the CFD Methodology
Express Introductory Training in ANSYS Fluent Lecture 1 Introduction to the CFD Methodology Dimitrios Sofialidis Technical Manager, SimTec Ltd. Mechanical Engineer, PhD PRACE Autumn School 2013 - IndustryMore information
Chapter 8 THREE DIMENSIONAL GEOMETRY 8.1 Introduction In this chapter we present a vector algebra approach to three dimensional geometry. The aim is to present standard properties of lines and planes,More information
Module 1 : Conduction. Lecture 5 : 1D conduction example problems. 2D conduction
Module 1 : Conduction Lecture 5 : 1D conduction example problems. 2D conduction Objectives In this class: An example of optimization for insulation thickness is solved. The 1D conduction is consideredMore information
Performance Comparison and Analysis of Different Schemes and Limiters
International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering Vol:5, No:7, 0 Performance Comparison and Analysis of Different Schemes and Limiters Wang Wen-long, LiMore information
2.2 Creaseness operator
2.2. Creaseness operator 31 2.2 Creaseness operator Antonio López, a member of our group, has studied for his PhD dissertation the differential operators described in this section [72]. He has comparedMore information
An Overview of the Finite Element Analysis
CHAPTER 1 An Overview of the Finite Element Analysis 1.1 Introduction Finite element analysis (FEA) involves solution of engineering problems using computers. Engineering structures that have complex geometryMore information
Adaptive Online Gradient Descent
Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650More information
Constrained curve and surface fitting
Constrained curve and surface fitting Simon Flöry FSP-Meeting Strobl (June 20, 2006), firstname.lastname@example.com, Vienna University of Technology Overview Introduction Motivation, Overview, ProblemMore information
Programming the Finite Element Method
Programming the Finite Element Method FOURTH EDITION I. M. Smith University of Manchester, UK D. V. Griffiths Colorado School of Mines, USA John Wiley & Sons, Ltd Contents Preface Acknowledgement xv xviiMore information
ABSTRACT. For example, circle orders are the containment orders of circles (actually disks) in the plane (see [8,9]).
Degrees of Freedom Versus Dimension for Containment Orders Noga Alon 1 Department of Mathematics Tel Aviv University Ramat Aviv 69978, Israel Edward R. Scheinerman 2 Department of Mathematical SciencesMore information
Level Set Methods and Dynamic Implicit Surfaces
Level Set Methods and Dynamic Implicit Surfaces Stanley Osher Ronald Fedkiw SPRINGER Applied Mathematical Sciences Volume 153 Editors S.S. Antman J.E. Marsden L. Sirovich Advisors J.K. Hale P. Holmes J.More information
Applications to Data Smoothing and Image Processing I
Applications to Data Smoothing and Image Processing I MA 348 Kurt Bryan Signals and Images Let t denote time and consider a signal a(t) on some time interval, say t. We ll assume that the signal a(t) isMore information
Practice Final Math 122 Spring 12 Instructor: Jeff Lang
Practice Final Math Spring Instructor: Jeff Lang. Find the limit of the sequence a n = ln (n 5) ln (3n + 8). A) ln ( ) 3 B) ln C) ln ( ) 3 D) does not exist. Find the limit of the sequence a n = (ln n)6More information
TESLA Report 2003-03
TESLA Report 23-3 A multigrid based 3D space-charge routine in the tracking code GPT Gisela Pöplau, Ursula van Rienen, Marieke de Loos and Bas van der Geer Institute of General Electrical Engineering,More information
Mathematics on the Soccer Field
Mathematics on the Soccer Field Katie Purdy Abstract: This paper takes the everyday activity of soccer and uncovers the mathematics that can be used to help optimize goal scoring. The four situations thatMore information
A Strategy for Teaching Finite Element Analysis to Undergraduate Students
A Strategy for Teaching Finite Element Analysis to Undergraduate Students Gordon Smyrell, School of Computing and Mathematics, University of Teesside The analytical power and design flexibility offeredMore information
Surface bundles over S 1, the Thurston norm, and the Whitehead link
Surface bundles over S 1, the Thurston norm, and the Whitehead link Michael Landry August 16, 2014 The Thurston norm is a powerful tool for studying the ways a 3-manifold can fiber over the circle. InMore information
FINAL EXAM SOLUTIONS Math 21a, Spring 03
INAL EXAM SOLUIONS Math 21a, Spring 3 Name: Start by printing your name in the above box and check your section in the box to the left. MW1 Ken Chung MW1 Weiyang Qiu MW11 Oliver Knill h1 Mark LucianovicMore information
Multiphase Flow - Appendices
Discovery Laboratory Multiphase Flow - Appendices 1. Creating a Mesh 1.1. What is a geometry? The geometry used in a CFD simulation defines the problem domain and boundaries; it is the area (2D) or volumeMore information
MATH 1231 S2 2010: Calculus. Section 1: Functions of severable variables.
MATH 1231 S2 2010: Calculus For use in Dr Chris Tisdell s lectures Section 1: Functions of severable variables. Created and compiled by Chris Tisdell S1: Motivation S2: Function of two variables S3: VisualisingMore information
Lecture 7 - Meshing. Applied Computational Fluid Dynamics
Lecture 7 - Meshing Applied Computational Fluid Dynamics Instructor: André Bakker http://www.bakker.org André Bakker (2002-2006) Fluent Inc. (2002) 1 Outline Why is a grid needed? Element types. Grid types.More information
Localization of touching points for interpolation of discrete circles
Annales Mathematicae et Informaticae 36 (2009) pp. 103 110 http://ami.ektf.hu Localization of touching points for interpolation of discrete circles Roland Kunkli Department of Computer Graphics and ImageMore information
Math 1B, lecture 5: area and volume
Math B, lecture 5: area and volume Nathan Pflueger 6 September 2 Introduction This lecture and the next will be concerned with the computation of areas of regions in the plane, and volumes of regions inMore information
Copyright 2011 Casa Software Ltd. www.casaxps.com
Table of Contents Variable Forces and Differential Equations... 2 Differential Equations... 3 Second Order Linear Differential Equations with Constant Coefficients... 6 Reduction of Differential EquationsMore information
Fluid Dynamics and the Navier-Stokes Equation
Fluid Dynamics and the Navier-Stokes Equation CMSC498A: Spring 12 Semester By: Steven Dobek 5/17/2012 Introduction I began this project through a desire to simulate smoke and fire through the use of programmingMore information
International Journal of Advanced Research in Engineering and Technology (IJARET) Volume 7, Issue 2, March-April 2016, pp. 30 52, Article ID: IJARET_07_02_004 Available online at http://www.iaeme.com/ijaret/issues.asp?jtype=ijaret&vtype=7&itype=2More information
Improved Billboard Clouds for Extreme Model Simplification
Improved Billboard Clouds for Extreme Model Simplification I.-T. Huang, K. L. Novins and B. C. Wünsche Graphics Group, Department of Computer Science, University of Auckland, Private Bag 92019, Auckland,More information
Arrangements And Duality
Arrangements And Duality 3.1 Introduction 3 Point configurations are tbe most basic structure we study in computational geometry. But what about configurations of more complicated shapes? For example,More information
Jiří Matas. Hough Transform
Hough Transform Jiří Matas Center for Machine Perception Department of Cybernetics, Faculty of Electrical Engineering Czech Technical University, Prague Many slides thanks to Kristen Grauman and BastianMore information
POISSON AND LAPLACE EQUATIONS. Charles R. O Neill. School of Mechanical and Aerospace Engineering. Oklahoma State University. Stillwater, OK 74078
21 ELLIPTICAL PARTIAL DIFFERENTIAL EQUATIONS: POISSON AND LAPLACE EQUATIONS Charles R. O Neill School of Mechanical and Aerospace Engineering Oklahoma State University Stillwater, OK 74078 2nd ComputerMore information
Constrained Tetrahedral Mesh Generation of Human Organs on Segmented Volume *
Constrained Tetrahedral Mesh Generation of Human Organs on Segmented Volume * Xiaosong Yang 1, Pheng Ann Heng 2, Zesheng Tang 3 1 Department of Computer Science and Technology, Tsinghua University, BeijingMore information
Chapter 11 Equilibrium
11.1 The First Condition of Equilibrium The first condition of equilibrium deals with the forces that cause possible translations of a body. The simplest way to define the translational equilibrium ofMore information
EECS 556 Image Processing W 09. Interpolation. Interpolation techniques B splines
EECS 556 Image Processing W 09 Interpolation Interpolation techniques B splines What is image processing? Image processing is the application of 2D signal processing methods to images Image representationMore information
Estimated Pre Calculus Pacing Timeline
Estimated Pre Calculus Pacing Timeline 2010-2011 School Year The timeframes listed on this calendar are estimates based on a fifty-minute class period. You may need to adjust some of them from time toMore information
Sketch Feature: The shape or topology of the initial sketch or model is important, but exact geometry and dimensions of the initial sketched shapes are NOT. It recommended to work in the following order:More information


text:
By Sal Ruibal, USA TODAY
While much of the USA is defrosting from a major winter storm, California is gearing up for a nice, long bike ride.
The Tour of California begins Sunday on the hills of San Francisco and ends a week later in the shadow of the Queen Mary luxury liner docked in Long Beach.
Race organizers say last year's inaugural race drew more than 1 million spectators.
The route isn't exactly a full Grand Tour excursion around the Golden State, but includes enough warm-weather racing and scenic locales to draw some of the biggest names in the sport, including current world champion and 2004 Olympic gold medalist Paolo Bettini, who is making his first visit to the USA.
"It is funny that I am from La California (in Italy), and now I am going to California," says the diminutive Bettini, who will be backed by his formidable QuickStep-Innergetic team, one of the powerhouses on the top-level European Pro Tour.
Bettini will be joined by fellow Italian Ivan Basso, winner of the 2006 Giro d'Italia grand tour stage race and a recent addition to the U.S.-based Discovery team, which will also bring a talent-laden squad that includes U.S. national road race champion George Hincapie, Tour de France top-five finisher Levi Leipheimer and rising star Tom Danielson.
Basso was not allowed to ride in the 2006 Tour de France because of alleged ties to a Spanish doping ring, but he has since been cleared by the Italian Olympic Committee and he signed with Discovery this year.
"After all that has happened, I am looking forward to riding in California," Basso says. "I will support Levi in this race and hope to help him to a victory."
Leipheimer won the stage that ended in his hometown of Santa Rosa in last year's Tour of California. His career includes wins in some of the sport's biggest races, but he says the emotion of winning in Santa Rosa is one of his favorite cycling memories.
"The crowd was so loud," he says. "They were screaming and ringing cowbells, and the energy was huge. I'll never forget it."
Team CSC will also compete with three top American stars: Tour de France podium finisher Bobby Julich, world time-trial silver medalist Dave Zabriskie and former U.S. Postal standout Christian Vandevelde.
After last year's race, word of California's good weather and enthusiastic fans soon passed through the European peloton. Nine of the 18 pro teams in this year's race are from the sport's major league. Several Pro Tour teams interested in participating were turned away because international cycling rules only allow half the teams to be from that classification.
"We concentrated last year on making the inaugural Amgen Tour of California race experience great for riders, and that positive experience coupled with the phenomenal success of the race has resulted in one of the best fields ever to race on U.S. soil," says Shawn Hunter, president of AEG Sports, presenter of the race.
"This field puts the Amgen Tour of California on par with the Grand Tours in Europe, and we're thrilled to welcome such an accomplished group of cyclists from the international community to California."
One rider who won't be returning is American Floyd Landis, who used his overall win in the first Tour of California as a springboard to his victory in the 2006 Tour de France.
Landis is suspended from pro racing as a result of a doping test after the 17th stage of the Tour de France that indicated he had an illegal testosterone ratio.
He's fighting that result but won't have his first hearing before the U.S. Anti-Doping Agency until May 14.
The schedule includes a mix of time trials, rolling hills and tense circuit races.
On paper, the mountainous sixth stage from Santa Barbara to Santa Clarita appears to be the decisive day. The 105-mile course includes four big climbs. The final ascent of Balcom Canyon is expected to be jammed with as many as 10,000 spectators.

subset: commoncrawl


text:
Pumpkin Cream Pie in a Chocolate Crust
Cookbook author Melissa Clark likes pumpkin pie, but she likes making it in new and unexpected ways. Here she bakes a silky pumpkin custard in a crispy chocolate cookie crust, then dollops the pie with a tangy crème fraîche topping.
- Active:
- Total Time:
- Servings: 8 to 10
- Time(Other): Plus cooling
- 8 ounces chocolate wafer cookies (33 cookies)
- 1 stick unsalted butter, melted
- 2 tablespoons sugar
- One 15-ounce can pure pumpkin puree
- 3/4 cup heavy cream
- 2 large eggs
- 1 tablespoon bourbon, brandy or apple cider
- 1/2 cup packed light brown sugar
- 1 teaspoon finely grated peeled fresh ginger
- 1 1/2 teaspoons ground ginger
- 1 1/2 teaspoons ground cinnamon
- 1/2 teaspoon fine sea salt
- 1/4 teaspoon grated nutmeg
- 1/8 teaspoon ground allspice
- 1 cup crème fraîche
- 1/2 cup heavy cream
- 2 tablespoons confectioners' sugar
- Chocolate curls (see Note), for garnish
How to make this recipe
Make the crust In a food processor, pulse the cookies until finely ground. Transfer to a medium bowl and add the butter and sugar. Mix until well combined, then press into a 9-inch metal pie plate. Refrigerate for 30 minutes.
Preheat the oven to 350°. Bake the crust for 8 to 10 minutes, until set. Transfer to a rack and let cool.
Make the filling In a large bowl, whisk the pumpkin puree with all of the remaining ingredients until smooth. Scrape the filling into the piecrust and bake for 50 minutes to 1 hour, until the filling is set but slightly jiggly in the center. Transfer to a rack and let cool completely.
Make the topping In a medium bowl, using a hand mixer, beat the crème fraîche with the cream and confectioners' sugar until soft peaks form. Spoon the topping over the pie, garnish with chocolate curls and serve.
Make Ahead
The pie can be refrigerated overnight. Garnish with chocolate curls before serving.
To make chocolate curls, use a vegetable peeler to shave them right off of a large block of chocolate.


text:
Isawa Orinoko was a fire shugenja of the Phoenix Clan, student to the Master of Fire Isawa Koiso herself. [1]
External Links Edit
- Isawa Orinoko (A Line in the Sand)
- ↑ Isawa Orinoko (A Line in the Sand flavor)
|This Phoenix Clan related article is a stub. That means that it has been started, but is incomplete. You can help by adding to the information here.


text:
If ever a club needed to sign a defender it was Melbourne City, struggling with an injury-prone rearguard and a propensity to leak goals unmatched by any teams in the A-League other than cellar dwellers Central Coast Mariners.
If City can plug the holes at the back and push on for a top two spot, Asian Champions League qualification and a grand final berth, then John van 't Schip's pursuit and eventual capture of the Socceroo centre back Alex Wilkinson on a short-term contract will look like an inspired move.
Centre back and captain Paddy Kisnorbo has recovered from the injury that saw him limp off in the opening minutes of last week's thrilling 4-3 loss to league leaders Western Sydney and he is available for Sunday's game against the struggling Newcastle Jets.
But another veteran in Aaron Hughes has once again succumbed to injury. He missed the defeat in Sydney, and will be absent not just from the reckoning for the Jets game but the next three or four weeks as well after scans revealed a more significant calf tear than was originally thought.
Olyroo centre half Connor Chapman is still out with injury too, meaning that, for the Newcastle match at least, van 't Schip will have to rely on Kisnorbo as his defensive anchor, with the likes of Jack Clisby, Osama Malik and converted midfielder Jacob Melling in the other central positions – depending on whether he opts to play a back three once again or switches to a more orthodox back four.
That the free wheeling City are the A-League's entertainers is indisputable. With 43 goals in 17 matches they are scoring at more than two a game, winning friends and the admiration of those who like free flowing attacking football every time they take to the pitch.
But translating that attacking efficiency into a championship is a little harder than it might appear. As Sydney boss Graham Arnold pugnaciously pointed out this week, there are many ways of winning games than just with a gung ho attacking strategy and there are no more points on offer for a 5-0 win than there are for a 1-0 win from the penalty spot.
Still, van' t Schip will not be turned from his exciting approach, and why should he when he has players like attacking full backs Ivan Franjic and Michael Zullo, midfield conductor Aaron Mooy and two of the league's deadliest marksmen in Bruno Fornaroli and Harry Novillo at his disposal.
Nevertheless, he knows that his team must tighten up at the back, and although Wilkinson will not be available for Sunday's game against Newcastle – he won't arrive in Melbourne until Monday, when he is likely to be unveiled at a press conference at City's training ground – he will undoubtedly bring know how, experience and grit to the back four when he makes his debut, probably in the following weekend's Melbourne derby.
The only concern is that Wilkinson has not played since the conclusion of the K-League season, where his old club, Jeonbuk Motors, took the title as a parting gift for the Australian international.
However, van 't Schip is not concerned by his absence, suggesting, in fact, that Wilkinson might have benefited from an extended break.
"He (Wilkinson) has played a massive amount of games in the past two years without a break and I think this break will only benefit him for a fresh start mentally and physically.
"He is fit, he has been out for a few weeks. To rush him in playing would not be a good thing. He is going to come in tomorrow and then he will have a good week with us.
"He could be making his debut in the derby. He will give us more defensive stability with his experience. We have some issues with players who are not fit, with Connor and Aaron hughes, and that's an extra body. He can provide us with cover there.
The Dutchman is used to his team's title credentials being questioned because of the number of goals they concede – 31 in their 17 matches so far, almost two a game – but he is getting fed up with defending his side's flamboyant approach.
"It's a team issue, defending. But I would prefer talking about all the goals we are scoring. It makes our game a bit open, we are very attacking, we like to go forward. Now it's about building the team even further."
City won 4-0 when they played in Newcastle earlier this season and the Jets have since lost star player David Carney to Sydney but van 't Schip says that nothing can be taken for granted.
"If you don't approach every game in the right way or put in the effort you are going to struggle," he said.
"They have some refreshment in their team with (striker) Leonardo, with Morten Nordstrand (a former Danish international who joined the Jets in January). They have Nigel Boogard back which gives them stability at the back. We have to just make sure that we are on top and prepared."
The Dutchman says that the January window is now slammed shut as far as he is concerned, and he is no longer interested in speculation about new arrivals or departures or whether the likes of Fornaroli will be pursued by cashed up Chinese clubs.
"For me it's the end of talking about players," he declared on Saturday, suggesting that to continue doing so only encouraged endless speculation.


text:
|Message view
|« Date » · « Thread »
|« Date » · « Thread »
|Ryan Bloom <...@covalent.net>
|Re: Gack! Weirdo DAV bug.
|Sat, 17 Nov 2001 05:12:51 GMT
On Friday 16 November 2001 06:49 pm, Greg Stein wrote: > The current logic is basically: > > if (method_number != M_GET) > return do_get(); > > if (method_number != M_PROPFIND) > return do_propfind(); > > if (method_number != M_INVALID) > return DECLINED; > > if (strcmp(method_name, "REPORT") == 0) > return do_report(); > > if (strcmp(method_name, "MERGE") == 0) > return do_merge(); > > > We use the M_INVALID to shortcut a bunch of strcmp() operations on the > method name. Switching that logic over to use the APIs is not going to save > us much (if anything!) over the strcmp(). For each method, we'd have to > call into the API to say "is it <this> one?" or "is it <that> one?" > > I'm going to have to look into this whole method registration thing. I saw > it go in, but never bothered looking too closely. It didn't seem like it > was going to monkey with the method number stored in the request. Eek. The point was to allow modules to be able to associate a number with a method that the core server didn't know anything about. In order to do that, we did need to change the number. > Dunno that the method stuff must change. At a minimum, mod_dav can just > pre-register everything and keep the numbers around for use in the above > logic. But I still want to get a look at the stuff and see what's there. > I've got some particular experience with extended methods :-) That was the original idea. Modules would register the method at startup, and compare against that number, which is what the API's do. Ryan ______________________________________________________________ Ryan Bloom email@example.com Covalent Technologies firstname.lastname@example.com --------------------------------------------------------------
|View raw message


text:
Funding the Academy
11th Annual Flea Market and Craft Fair
August 15, 2015 – 8:00 am to 3:00 pm
Peace Lutheran Academy, Sussex, WI
Plan to join us for this exciting time in support of Peace Lutheran Academy. There will be a variety of vendors, a bake sale, and concessions.
8th Annual Christmas Craft and Vendor Fair
November 11, 2017 – 9:00 am to 3:00 pm
Peace Lutheran Academy, Sussex, WI
A place to do all (or nearly all) your Christmas shopping. We are expecting more than 30 vendors selling crafts, household items, and that hard-to-find gift.
Christmas Craft Fair Vendor information
Peace Lutheran Academy Fish Fry
3rd Friday of Every Month
Scrip Program
Scrip is a "gift certificate/gift card" program that enables you to buy groceries, gas, and many other goods at retail stores and restaurants in the same manner you would purchase these things with cash. When you purchase Scrip from the Academy, the Academy keeps a portion of the price as profit. Scrip program information Scrip List
You can also order online at: shopwithscrip.com Please contact the parish office for the organizational code.


text:
Residence with 2 shared swimming pools. Tennis open from middle of June to middle September (extra) 250 m away. Large, cosy residence Urb. El Palmar. In the district of Las Marinas, 4.5 km from the centre of D�nia, 400 m from the sea, road to cross. For shared use: swimming pool (01.01.-31.12.). Slide, children's playground. Supermarket 400 m, restaurant, bar, caf�, bus stop 300 m, sandy beach 400 m. Golf course 11 km, tennis 2 km.
3-room terraced house 46 m2, simple furnishings: living/dining room with open fireplace and TV (flat screen TV). Exit to the patio. 1 room with 1 double bed, air-conditioning and warm air heating. 1 double bedroom with air-conditioning and warm air heating. Open kitchen. Shower/WC. Small garden 30 m2. Terrace furniture. Facilities: washing machine. Reserved parking. Please note: TV only ES. ES.
Hotel Parking
Hotel Play Area
Hotel Swimming Pool
Hotel Television
Room Air Conditioning Room
Room Shower
Room Washing Machine