Initial-value ordinary differential equation solution via variable order Adams method (SIVA/DIVA) package is collection of subroutines for solution of nonstiff ordinary differential equations. There are versions for single-precision and double-precision arithmetic. Requires fewer evaluations of derivatives than other variable-order Adams predictor/ corrector methods. Option for direct integration of second-order equations makes integration of trajectory problems significantly more efficient. Written in FORTRAN 77.

Solving Ordinary Differential Equations

MEDICAL LITERATURE has been deluged during the past few years with books and papers on penicillin; but a book which has been produced under the general editorship of Sir Alexander Fleming himself represents a complete and authoritative summary of penicillin therapy as it stands today.' The book contains a series of independent contributions by \"experienced and eminent men who have worked with penicillin in Great Britain\". Their opinions and practical methods differ slightly, and there is some overlapping; but these are not disadvantageous, comparison and contrast lending interest to the reading. In the first or general section of the book Fleming contributes two chapters, one on the history and development of penicillin, introducing some interesting sidelights in the romance of discovery, the other on the bacteriological control of penicillin therapy. In both chapters the information is set out in meticulous detail and with a clarity and simplicity which can be enjoyed by all readers. Fleming also gives the right perspective to the place of penicillin amongst the antibiotics and lays down the principles of treatment. Both chapters are well illustrated and are the most outstanding in the book. Included in this first section also are chapters on the chemistry and manufacture of penicillin and its pharmacy, pharmacology and methods of administration. The second section of the book is entirely clinical, giving each author's view on the use of penicillin therapy in a disease or an infection of some particular region of the body. The entire range of peniCillin-sensitive conditions is considered in twenty authoritative and clearly written chapters; these contain many references and illustrations. Dental and veterinary diseases are also given fairly full consideration. The final section is a condensed resume of much of the preceding chapters and is written for. the general practttioner. This chapter is superttuous: it does not contain enough detall to be of much practical value. The book as a Whole, however, will undoubtedly be considered a classical contribution to medical literature and is strongly recommended, not only because of the general interest of its topic, but as a reference book on penicillin therapy of hitherto unequalled excellence. The typography, although conforming to war economy standards, is clear and the paper is good. There is an excellent list of references and the index is satisfactory.

Gray's Anatomy

Several existing volume rendering algorithms operate by factoring the viewing transformation into a 3D shear parallel to the data slices, a projection to form an intermediate but distorted image, and a 2D warp to form an undistorted final image. We extend this class of algorithms in three ways. First, we describe a new object-order rendering algorithm based on the factorization that is significantly faster than published algorithms with minimal loss of image quality. Shear-warp factorizations have the property that rows of voxels in the volume are aligned with rows of pixels in the intermediate image. We use this fact to construct a scanline-based algorithm that traverses the volume and the intermediate image in synchrony, taking advantage of the spatial coherence present in both. We use spatial data structures based on run-length encoding for both the volume and the intermediate image. Our implementation running on an SGI Indigo workstation renders a 2563 voxel medical data set in one second. Our second extension is a shear-warp factorization for perspective viewing transformations, and we show how our rendering algorithm can support this extension. Third, we introduce a data structure for encoding spatial coherence in unclassified volumes (i.e. scalar fields with no precomputed opacity). When combined with our shear-warp rendering algorithm this data structure allows us to classify and render a 2563 voxel volume in three seconds. The method extends to support mixed volumes and geometry and is parallelizable.

/pdf/fast-volume-rendering-using-a-shear-warp-factorization-of-11o5tav1m5.pdf

Fast volume rendering using a shear-warp factorization of the viewing transformation

Nowadays, direct volume rendering via 3D textures has positioned itself as an efficient tool for the display and visual analysis of volumetric scalar fields. It is commonly accepted, that for reasonably sized data sets appropriate quality at interactive rates can be achieved by means of this technique. However, despite these benefits one important issue has received little attention throughout the ongoing discussion of texture based volume rendering: the integration of acceleration techniques to reduce per-fragment operations. In this paper, we address the integration of early ray termination and empty-space skipping into texture based volume rendering on graphical processing units (GPU). Therefore, we describe volume ray-casting on programmable graphics hardware as an alternative to object-order approaches. We exploit the early z-test to terminate fragment processing once sufficient opacity has been accumulated, and to skip empty space along the rays of sight. We demonstrate performance gains up to a factor of 3 for typical renditions of volumetric data sets on the ATI 9700 graphics card.

Acceleration techniques for GPU-based volume rendering

A review of 3D/2D registration methods for image-guided interventions

In this paper we introduce a new compressed representation for the connectivity of a triangle mesh. We present local compression and decompression algorithms which are fast enough for real time applications. The achieved space compression rates keep pace with the best rates reported for any known global compression algorithm. These nice properties have great benefits for several important applications. Naturally, the technique can be used to compress triangle meshes without significant delay before they are stored on external devices or transmitted over a network. The presented decompression algorithm is very simple allowing a possible hardware realization of the decompression algorithm which could significantly increase the rendering speed of pipelined graphics hardware. CR Categories: I.3.1 [Computer Graphics]: Hardware Architecture; I.3.3 [Computer Graphics]: Picture/Image Generation— Display algorithms

/pdf/real-time-compression-of-triangle-mesh-connectivity-2bz4nez0o7.pdf

Real time compression of triangle mesh connectivity

We present a new output-sensitive rendering algorithm, the randomized z-buffer algorithm. It renders an image of an arbitrary three-dimensional scene consisting of triangular primitives by reconstruction from a dynamically chosen set of random surface sample points. This approach is independent of mesh connectivity and topology. The resulting rendering time grows only logarithmically with the numbers of triangles in the scene. We were able to render walkthroughs of scenes of up to 1014 triangles at interactive frame rates. Automatic identification of low detail scene components ensures that the rendering speed of the randomized z-buffer cannot drop below that of conventional z-buffer rendering. Experimental and analytical evidence is given that the image quality is comparable to that of common approaches like z-buffer rendering. The precomputed data structures employed by the randomized z-buffer allow for interactive dynamic updates of the scene. Their memory requirements grow only linearly with the number of triangles and allow for a scene graph based instantiation scheme to further reduce memory consumption.

https://www.cs.princeton.edu/courses/archive/spr01/cs598b/papers/wand01.pdf

The randomized z-buffer algorithm: interactive rendering of highly complex scenes

We present a new technique which enables direct volume rendering based on 3D texture mapping hardware, enabling shading as well as classification of the interpolated data. Our technique supports accurate lighting for a one directional light source, semi-transparent classification, and correct blending. To circumvent the limitations of one general classification, we introduce multiple classification spaces which are very valuable to understand the visualized data, and even mandatory to comprehensively grasp the 3D relationship of different materials present in the volumetric data. Furthermore, we illustrate how multiple classification spaces can be realized using existing graphics hardware.In contrast to previously reported algorithms, our technique is capable of performing all the above mentioned tasks within the graphics pipeline. Therefore, it is very efficient: The three dimensional texture needs to be stored only once and no load is put onto the CPU. Besides using standard OpenGL functionality, we exploit advanced per pixel operations and make use of available OpenGL extensions.

Enabling classification and shading for 3D texture mapping based volume rendering using OpenGL and extensions

In this paper, we propose a novel surface reconstruction technique based on Bayesian statistics: The measurement process as well as prior assumptions on the measured objects are modeled as probability distributions and Bayes’ rule is used to infer a reconstruction of maximum probability. The key idea of this paper is to define both measurements and reconstructions as point clouds and describe all statistical assumptions in terms of this finite dimensional representation. This yields a discretization of the problem that can be solved using numerical optimization techniques. The resulting algorithm reconstructs both topology and geometry in form of a well-sampled point cloud with noise removed. In a final step, this representation is then converted into a triangle mesh. The proposed approach is conceptually simple and easy to extend. We apply the approach to reconstruct piecewise-smooth surfaces with sharp features and examine the performance of the algorithm on different synthetic and real-world data sets.

/pdf/bayesian-point-cloud-reconstruction-2qzx4w7bih.pdf

Bayesian Point Cloud Reconstruction

We present Continuum-based Strain Limiting (CSL) – a new method for limiting deformations in physically-based cloth simulations. Despite recent developments for nearly inextensible materials, the efficient simulation of general biphasic textiles and their anisotropic behavior remains challenging. Many approaches use soft materials and enforce limits on edge elongations, leading to discretization-dependent behavior. Moreover, they offer no explicit control over shearing and stretching unless specifically aligned meshes are used. Based on a continuum deformation measure, our method allows accurate control over all strain components using individual thresholds. We impose deformation limits element-wise and cast the problem as a 6×6 system of linear equations. CSL can be combined with any cloth simulator and, as a velocity filter, integrates seamlessly into standard collision handling.

Wolfgang Straßer

Papers

Real time compression of triangle mesh connectivity

The randomized z-buffer algorithm: interactive rendering of highly complex scenes

Enabling classification and shading for 3D texture mapping based volume rendering using OpenGL and extensions

Bayesian Point Cloud Reconstruction

Continuum‐based Strain Limiting