Visualization of eclipses and planetary conjunction events. The interplay between model coherence, scaling and animation The problem of an instructive and realistic animation and visualization of the shadow and colorconditions during conjunctions of actively and passively illuminated cosmic objects has found only particularly satisfying solutions so far. As an example we study  axc2xa0total solar eclipse. There are didactic shortcomings of specialized astronomical software, even though solutions have been given, which are very impressive for experts. Using the possibilities of commercial 3Danimation software we give an objectoriented partial solution. In order to get correct astronomical representations we model xe2x80x93 for different tasks xe2x80x93 the object space under cinematic aspects with parameters for spatial and temporal scaling, for illumination and coloring under couplings of varying strength. The adaptation of the parameters to optimal acceptance of the spectator must be done axc2xa0posteriori.

Efficient and consistent recursive filtering of images with reflective extension Recursive filters are commonly used in scale space construction for their efficiency and simple implementation. However these filters have an initialisation problem which either produces unusable results near the image boundaries or requires costly approximate solutions such as extending the boundary manually. In this paper, we describe a method for the recursive filtering of reflectively extended images for filters with symmetric denominator. We begin with an analysis of reflective extensions and their effect on nonrecursive filtering operators. Based on the nonrecursive case, we derive a formulation of recursive filtering on reflective domains as a linear but timevarying implicit operator. We then give an efficient method for decomposing and solving the linear implicit system. This decomposition needs to be performed only once for each dimension of the image. This yields a filtering which is both stable and consistent with the ideal infinite extension. The filter is efficient, requiring the same order of computation as the standard recursive filtering. We give experimental evidence to verify these claims.