The main motivation of this work is the problem of compute intersection curve between two surface. The surface/surface intersection, is a fundamental problem in computational geometry and geometric modelling of complex shapes. In general surface intersections, the most commonly used methods include subdivision and marching. Marching-based algorithms begin by finding a starting point on the inte...

The traditional Fast Marching Method (FMM) based on the finite-difference scheme can solve traveltime of first arrivals; however, accuracy and efficiency FMM are usually affected by schemes grid size. Vidale double-grid technology adopted to replace first-order second-order in this paper improve computation efficiency. does not provide corresponding raypath calculation methods, view interoperab...

We propose an Eulerian description of the bounce-back boundary condition based on the high-order implicit time marching schemes to improve the accuracy of lattice Boltzmann simulation in the vicinity of curved boundary. The Eulerian description requires only one grid spacing between fluid nodes when the second-order accuracy in time and space is desired, although high-order accurate boundary co...

We develop a new scalar migration technique that is highly accurate for imaging steep dips in heterogeneous media. This method is based on arbitrarily wideangle wave equations (AWWEs) that are highly accurate space-domain one-way wave equations and have a form similar to the 15◦ equation. The accuracy of the proposed method is increased by introducing auxiliary variables, as well as adjusting t...

This paper presents a new fast method for polygonization of implicit surfaces. Our method put emphasis on the shape of triangles generated and on the polygonization speed. The main advantages of the triangulation presented are simplicity and the stable features that can be used for future expansion. The implementation is not complicated and only the standard data structures are used. This algor...

We introduce two concepts in this work: polynomial mortar and transfinite mortar, apply them to curved nonconforming sliding meshes. It is shown that, on meshes, always carries geometric errors while has no such errors, which makes the latter superior former almost every aspect. For example, better accuracies introduces smaller numerical disturbances. The proposed sliding-mesh method utilizing ...

We present a method for calculating the envelope surface of a parametric solid object swept along a path in three-dimensional space. The boundary surface of the solid is the combination of parametric surfaces and an implicit surface where the Jacobian of the defining function has a rank-deficiency condition. Using the rank deficiency condition, we determine a set of square sub-Jacobian determin...

We present a new method for automatically detecting and tracking, in sequences of 2D fluorescence images, punctual objects which are intermittently visible. We demonstrate the ability of our approach to track, in live cells and at a molecular level, membrane proteins specifically attached to quantum dots, which are new fluorescent probes with great prospects for ultrasensitive in vivo imaging. ...

A method for creating 3D texture coordinates for a sequence of polygon meshes with changing topology and vertex motion vectors. Keywords— texture, coordinate, uv, uvw, sequence, polygon, mesh, motion, marching, cube, changing, topology, empolygonizer, emtopolizer

We discuss the performance of three numerical methods for the fully nonlinear Monge-Ampère equation. The first two are pseudo time continuation methods while the third is a pure pseudo time marching algorithm. The pseudo time continuation methods are shown to converge for smooth data on a uniformly convex domain. We give numerical evidence that they perform well for the nondegenerate Monge-Ampè...