Irregular to Completely Regular Meshing in Computer Graphics This talk will provide a quick overview of meshing structures used in computer graphics. Maximizing rendering performance is a key goal, and irregular meshes provide the greatest geometric fidelity for a given mesh complexity. Level-ofdetail representations like progressive meshes allow selective refinement of such meshes even in real...

This paper describes a new technology of mesh size control using a background overlay grid size function. A background overlay grid is generated first according to the defined size functions and then is used as the base grid for determining the mesh size at each point during the meshing process. The definitions, classifications, implementations and control algorithms of three types of size func...

Finite element analysts and designers need to feel confident in the results of their analyses before sending a product to prototype or production. Mesh discretization can greatly influence the desired results. In this paper we present framework for adaptive mesh refinement to obtain FEA results with a desired accuracy. The process involves adaptively refining the mesh based on solution error no...

Based on the complex network theory, robustness analysis of condition monitoring wireless sensor network under uncertain interference is present. In the evolution of the topology of sensor networks, the density weighted algebraic connectivity is taken into account, and the phenomenon of removing and repairing the link and node in the network is discussed. Numerical simulation is conducted to ex...

Multimodality NIR spectroscopy systems offer the possibility of region-based vascular and molecular characterization of tissue in vivo. However, computationally efficient 3D image reconstruction algorithms specific to these image-guided systems currently do not exist. Image reconstruction is often based on finite-element methods (FEMs), which require volume discretization. Here, a boundary elem...

We present a new method for adaptive surface meshing and triangulation which controls the local level–of–detail of the surface approximation by local spectral estimates. These estimates are determined by a wavelet representation of the surface data. The basic idea is to decompose the initial data set by means of an orthogonal or semi–orthogonal tensor product wavelet transform (WT) and to analy...

The radiosity method is the most popular algorithm for simulating interre ection of light between di use surfaces. Most existing radiosity algorithms employ simple meshes and piecewise constant approximations, thereby constraining the radiosity function to be constant across each polygonal element. Much more accurate simulations are possible if linear, quadratic, or higher degree approximations...

This paper presents recent progress and extensions to TriQuaMesh (TQM) [1], targeted at providing good quality surface meshes: Increased robustness of the 1D mesh generator to handle highly non linear size variations; interior node generation driven by a size variation interpolation domain; improved mesh distortion reduction between the parameter space and the physical space. The concepts of Si...

Shadows are of great importance to computer graphics, especially for interactive animation, due to the visual cues which they provide. Most research in the field of dynamic shadowing has focussed on shadows from point light sources, since they are much easier to compute than those from area lights. This means that such shadows have sharp boundaries, and so resultant visualisations often appear ...