T. Veldhuizen. " Techniques for scientic c++. " Online: http://oonumerics.org/oon/#reference, 1999. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Level Sets As Input For Hybrid Mesh Generation - Gloth, Vilsmeier (Correct)
....easier, compared to classical stand alone numerical codes. Computational eciency of object oriented programs has a very bad reputation. Although this was true in the past, there exists now a variety of possibilities to overcome this. A good introduction to object oriented numerics can be found in [7]. Object oriented codes gain more and more eciency and are close to that of FORTRAN codes now (see also [3] This is also what could be observed in the case of the software mentioned here. Another interesting eld for future research could be the combination of level set based meshing with level ....
T. Veldhuizen. " Techniques for scientic c++. " Online: http://oonumerics.org/oon/#reference, 1999.
Container Adaptors - Powell, Weiser (1999) (Correct)
....a very interesting set of trait templates. The algorithm is simple: Map the two iterator category tags to integers, choose the smaller one and map it back to the corresponding iterator category tag. Note that this has to be done at compile time. This kind of technique was invented by Veldhuizen [5]. First we set up a template to give us the minimum value of two integers. Since this is a compile time determination we could not use the standard library min template, instead we use the : operator in an enumeration. Next we created the combine traits template that encapsulates the whole ....
Todd Veldhuizen. Techniques for scientic C++. http://extreme. indiana.edu/~tveldhui/papers/techniques/techniques.ps, 1999. 11
The View Template Library - Weiser, Powell (2000) (2 citations) (Correct)
....type; Next we de ne a template class which will take our two internal template mapping classes and do the work of de ning a typename based on our lookup critera. Namely, the lesser category type of the two iterator types. This kind of technique was invented in the context of type promotion [4, 15]. Given two types and priority mappings to and from integers, compute the lower type. template class A, class B, template class T class map, template int x class inv struct combine traits typedef typename inv min traits map A : x, map B : x : x : type type; In the ....
T. Veldhuizen. Techniques for scientic C++. http://extreme.indiana. edu/~tveldhui/papers/techniques/, 1999. 20
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC