Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree

The contour tree is an abstraction of a scalar field that encodes the nesting relationships of isosurfaces. We show how to use the contour tree to represent individual contours of a scalar field, how to simplify both the contour tree and the topology of the scalar field, how to compute and store geometric properties for all possible contours in the contour tree, and how to use the simplified contour tree as an interface for exploratory visualization.     

KamiWaAI – interactive 3D sketching with Java based on Cl(4, 1) conformal model of Euclidean space

This paper introduces the new interactive Java sketching software KamiWaAi, recently developed at the University of Fukui. Its graphical user interface enables the user without any knowledge of both mathematics or computer science, to do full three dimensional “drawings” on the screen. The resulting constructions can be reshaped interactively by dragging its points over the screen. The programming approach is new. KamiWaAi implements geometric objects like points, lines, circles, spheres, etc. directly as software objects (Java classes) of the same name. These software objects are geometric entities mathematically defined and manipulated in a conformal geometric algebra, combining the five dimensions of origin, three space and infinity. Simple geometric products in this algebra represent geometric unions, intersections, arbitrary rotations and translations, projections, distance, etc. To ease the coordinate free and matrix free implementation of this fundamental geometric product, a new algebraic three level approach is presented. Finally details about the Java classes of the new GeometricAlgebra software package and their associated methods are given. KamiWaAi is available for free internet download.     

A boundary parametric approximation to the linearized scalar potential magnetostatic field problem

We consider the linearized scalar potential formulation of the magnetostatic field problem in this paper. Our approach involves a reformulation of the continuous problem as a parametric boundary problem. By the introduction of a spherical interface and the use of spherical harmonics, the infinite boundary conditions can also be satisfied in the parametric framework. That is the field in the exterior of a sphere is expanded in a ‘harmonic series’ of eigenfunctions for the exterior harmonic problem. The approach is essentially a finite element method coupled with a spectral method via a boundary parametric procedure. The reformulated problem is discretized by finite element techniques which leads to a discrete parametric problem which can be solved by well conditioned iteration involving only the solution of decoupled Neumann type elliptic finite element systems and L² projection onto subspaces of spherical harmonics. Error and stability estimates given show exponential convergence in the degree of the spherical harmonics and optimal order convergence with respect to the finite element approximation for the resulting fields in L².     

Designing and proving correct a convex hull algorithm with hypermaps in Coq

This article presents the formal design of a functional algorithm which computes the convex hull of a finite set of points incrementally. This algorithm, specified in Coq, is then automatically extracted into an OCaml program which can be plugged into an interface for data input (point selection) and graphical visualization of the output. A formal proof of total correctness, relying on structural induction, is also carried out. This requires to study many topologic and geometric properties. We use a combinatorial structure, namely hypermaps, to model planar subdivisions of the plane. Formal specifications and proofs are carried out in the Calculus of Inductive Constructions and its implementation: the Coq system.     

Change Trees and Mutagrams for the Visualization of Local Changes in Sequence Data

The analysis of local changes in sequence data is of interest for various applications such as the segmentation of DNA and other genetic sequences, or financial data sequences. Patterns of change that can be characterized as local jump change or slope change are of special interest. We propose simple graphical tools to visualize such patterns of local change. The concept of mode trees—developed for the visualization of local patterns in densities—is adapted to visualize patterns of local change in dependency on a threshold parameter by means of a change tree . The simultaneous visualization of scale effects, in analogy to SiZer, motivates another graphical device, the mutagram . We illustrate these concepts with several sets of sequence data.     

曲率流的参数化有限元逼近

许多物理现象可以在数学上描述为受曲率驱动的自由界面运动,例如薄膜和泡沫的演变、晶体生长,等等.这些薄膜和界面的运动常依赖于其表面曲率,从而可以用相应的曲率流来描述,其相关自由界面问题的数值计算和误差分析一直是计算数学领域中的难点.参数化有限元法是曲率流的一类有效计算方法,已经能够成功模拟一些曲面在几类基本的曲率流下的演化过程.本文重点讨论曲率流的参数化有限元逼近,它的产生、发展和当前的一些挑战.     

Analysis model visualization and graphical analysis attribute specification system

A visual environment for defining and manipulating engineering analysis information has been developed. This environment: (i) allows queries and modifications of the topology and geometry that defines a geometric model obtained from various geometric modeling systems, (ii) abstracts the modeler's functionality needed to associate analysis information, (iii) provides a hierarchical attribute association model, and (iv) gives a graphical user interface to both the geometric modeler abstraction and attribute management system. Finally graphical issues relating to performance, portability and flexibility of different workstation environments are discussed.     

Augmented hybrid finite element method for domain decomposition

We present an Augmented Hybrid Finite Element Method for Domain Decompositon. In this method, finite element approximations are defined independently on each subdomain and do not match at interface. This dows the user to mda local change of design, of meshes on one aubdomain without modifying other subdomains. Optimal reaults are obtained for a second-order model problem.     

Error estimates for a mixed finite volume method for the p-Laplacian problem

In this work we propose and analyze a mixed finite volume method for the p-Laplacian problem which is based on the lowest order Raviart–Thomas element for the vector variable and the P1 nonconforming element for the scalar variable. It is shown that this method can be reduced to a P1 nonconforming finite element method for the scalar variable only. One can then recover the vector approximation from the computed scalar approximation in a virtually cost-free manner. Optimal a priori error estimates are proved for both approximations by the quasi-norm techniques. We also derive an implicit error estimator of Bank–Weiser type which is based on the local Neumann problems.This work was supported by the Post-doctoral Fellowship Program of Korea Science & Engineering Foundation (KOSEF).