This paper describes a robust algorithm for computing all parts of the intersection curve of two general parametric surfaces. The algorithm follows a divide-and-conquer approach. Surfaces (and parts of them) are enclosed by tight parallel epipeds and axis aligned bounding boxes. If two bounding volumes intersect, one surface is split into two patches. This step is repeated recur-sively for both...

A bounding surface plasticity model based on the effective stress concept is presented to describe behaviour of unsaturated structured soils subjected hydro-mechanical loadings. The structural degradation effects compressive and tensile strength are considered through controlling size surface, allowing for a smooth transition response from unstructured states. modelled using work hardening appr...

While volume rendering is becoming more widely used in medical applications, it is still difficult to generate a good quality image interactively without expensive hardware when the size of the dataset is quite large. For interactive rendering of a large dataset, we present an acceleration method, image-space bounding surface. Using an image-space bounding surface, the isosurface ray casting is...

We give a diameter bound for fundamental domains for isometric actions of closed hyperbolic surface groups on δ-hyperbolic spaces, where the bound depends on the hyperbolicity constant δ, the genus of the surface, and the injectivity radius of the action, which we assume to be strictly positive.

Aiming at the problems on estimate of the initial transformation, matching precision and global optimization in matching, this paper presents a matching method, which is based on rough localization and exact adjustment. By means of rotation, translation and coincidence of the minimum bounding boxes of surface and measured points, rough localization is realized, which produces a good estimate fo...

This paper presents a fast approach for computing tight surface bounds in meshless animation, and its application to collision detection. Given a high-resolution surface animated by a comparatively small number of simulation nodes, we are able to compute tight bounding volumes with a cost linear in the number of simulation nodes. Our approach extends concepts about bounds of convex sets to the ...

We present a new visibility driven rasterization scheme that significantly increases the rendering performance of modern graphic subsystems. Instead of rasterizing, texturing, lighting, and depth-testing each individual pixel, we introduce a two-level visibility mask within the rasterization stage which facilitates the removal of groups of pixels and triangles from rasterization and subsequent ...