Search results for "ComputingMethodologies_COMPUTERGRAPHICS"
showing 10 items of 306 documents
Entropy dissipation of moving mesh adaptation
2012
Non-uniform grids and mesh adaptation have been a growing part of numerical simulation over the past years. It has been experimentally noted that mesh adaptation leads not only to locally improved solution but also to numerical stability of the underlying method. There have been though only few results on the mathematical analysis of these schemes due to the lack of proper tools that incorporate both the time evolution and the mesh adaptation step of the overall algorithm. In this paper we provide a method to perform the analysis of the mesh adaptation method, including both the mesh reconstruction and evolution of the solution. We moreover employ this method to extract sufficient condition…
Extended constrained deformations: a new sculpturing tool
1999
Modelling tools tend to virtual sculpturing, in which a basic object is deformed by user supplied actions. The model we present aims to be generic: whatever the geometric description of the object, we can deform it to satisfy location constraints. Our model deforms the whole space, the image of a point is a blend of deformation functions with a projection matrix which allows the satisfaction of the constraints. The user can define the extent of the deformation (i.e. the part of the object to be deformed), the shape of the deformation function to create profiles and the displacement of the constraint points to be satisfied.
High Precision Conservative Surface Mesh Generation for Swept Volumes
2015
We present a novel, efficient, and flexible scheme to generate a high-quality mesh that approximates the outer boundary of a swept volume. Our approach comes with two guarantees. First, the approximation is conservative, i.e., the swept volume is enclosed by the generated mesh. Second, the one-sided Hausdorff distance of the generated mesh to the swept volume is upper bounded by a user defined tolerance. Exploiting this tolerance the algorithm generates a mesh that is adapted to the local complexity of the swept volume boundary, keeping the overall output complexity remarkably low. The algorithm is two-phased: the actual sweep and the mesh generation. In the sweeping phase, we introduce a g…
2D virtual texture on 3D real object with coded structured light
2008
Augmented reality is used to improve color segmentation on human body or on precious no touch artifacts. We propose a technique to project a synthesized texture on real object without contact. Our technique can be used in medical or archaeological application. By projecting a suitable set of light patterns onto the surface of a 3D real object and by capturing images with a camera, a large number of correspondences can be found and the 3D points can be reconstructed. We aim to determine these points of correspondence between cameras and projector from a scene without explicit points and normals. We then project an adjusted texture onto the real object surface. We propose a global and automat…
Iteratively Learning a Liver Segmentation Using Probabilistic Atlases: Preliminary Results
2016
This works deals with the concept of liver segmentation by using a priori information based on probabilistic atlases and segmentation learning based of previous steps. A probabilistic atlas is here understood as a probability or membership map that tells how likely is that a point belongs to a shape drawn from the shape distribution at hand. We devise a procedure to segment Perfusion Magnetic Resonance liver images that combines both: a probabilistic atlas of the liver and a segmentation algorithm based on global information of previous simpler segmentation steps, local information from close segmented slices and finally a mathematical morphology procedure, namely viscous reconstruction, to…
Efficient Implementation of Multiresolution Triangle Strips
2002
Triangle meshes are currently the most popular standard modelto represent polygonal surfaces. Drawing these meshes as a set of independent triangles involves sending a vast amount of information to the graphic engine. It has been shown that using drawing primitives, such as triangle fans or strips, dramatically reduces the amount of information. Multiresolution Triangle Strips (MTS) uses the connectivity information to represent a mesh as a set of multiresolution triangles strips. These strips are the basis of both the storage and rendering stages. They allow the efficient management of a wide range of levels of detail. In this paper, we have taken advantage of the coherence property betwee…
Fake Nodes approximation for Magnetic Particle Imaging
2020
Accurately reconstructing functions with discontinuities is the key tool in many bio-imaging applications as, for instance, in Magnetic Particle Imaging (MPI). In this paper, we apply a method for scattered data interpolation, named mapped bases or Fake Nodes approach, which incorporates discontinuities via a suitable mapping function. This technique naturally mitigates the Gibbs phenomenon, as numerical evidence for reconstructing MPI images confirms.
Area-Based Depth Estimation for Monochromatic Feature-Sparse Orthographic Capture
2018
With the rapid development of light field technology, depth estimation has been highlighted as one of the critical problems in the field, and a number of approaches have been proposed to extract the depth of the scene. However, depth estimation by stereo matching becomes difficult and unreliable when the captured images lack both color and feature information. In this paper, we propose a scheme that extracts robust depth from monochromatic, feature-sparse scenes recorded in orthographic sub-aperture images. Unlike approaches which rely on the rich color and texture information across the sub-aperture views, our approach is based on depth from focus techniques. First, we superimpose shifted …
Towards an Efficient Implementation of an Accurate SPH Method
2020
A modified version of the Smoothed Particle Hydrodynamics (SPH) method is considered in order to overcome the loss of accuracy of the standard formulation. The summation of Gaussian kernel functions is employed, using the Improved Fast Gauss Transform (IFGT) to reduce the computational cost, while tuning the desired accuracy in the SPH method. This technique, coupled with an algorithmic design for exploiting the performance of Graphics Processing Units (GPUs), makes the method promising, as shown by numerical experiments.
A survey on geometrical reconstruction as a core technology to sketch-based modeling
2005
In this work, the background and evolution of three-dimensional reconstruction of line drawings during the last 30 years is discussed. A new general taxonomy is proposed to make apparent and discuss the historical evolution of geometrical reconstruction and their challenges. The evolution of geometrical reconstruction from recovering know-how stored in engineering drawings to sketch-based modeling for helping in the first steps of conceptual design purposes, and the current challenges of geometrical reconstruction are discussed too.