Search results for "ComputingMethodologies_COMPUTERGRAPHICS"
showing 10 items of 306 documents
Documenting carved stones from 3D models. Part II - Ambient occlusion to reveal carved parts.
2021
10 pages; International audience; Revealing carved parts in rock art is of primary importance and remains a major challenge for archaeological documentation. Computational geometry applied to 3D imaging provides a unique opportunity to document rock art. This study evaluates five algorithms and derivatives used to compute ambient occlusion and sky visibility on 3D models of Mongolian stelae, also known as deer stones. By contrast with the previous companion work, models are processed directly in 3D, without preliminary projection. Volumetric obscurance gives the best results for the identification of carved figures. The effects of model resolution and parameters specific to ambient occlusio…
Architectural Perspectives in the Cathedral of Palermo: Image-Based Modelling for Cultural Heritage Understanding and Enhancement
2015
Palermo off ers a repertoire of both artistic and architectural solid perspective of great beauty and in large quantity. This paper addresses the problem of the 3D survey of these works and their related study through the use of image-based modelling (IBM) techniques. We propose, as case studies, the use of IBM techniques inside the Cathedral of Palermo. Indeed, the church houses a huge and rich sculptural repertoire, dating back to 16th century, which constitutes a valid field of IBM techniques application. The aim of this study is to demonstrate the e ffectiveness and potentiality of these techniques for geometric analysis of sculptured works. Indeed, usually the survey of these artworks …
Optimal Guard Placement Problem Under L-Visibility
2006
Two points a and b in the presence of polygonal obstacles are L-visible if the length of the shortest path avoiding obstacles is no more than L. For a given convex polygon Q, Gewali et al [4]. addressed the guard placement problem on the exterior boundary that will cover the maximum area exterior to the polygon under L-visibility. They proposed a linear time algorithm for some given value of L. When the length L is greater than half of the perimeter, they declared that problem as open. Here we address that open problem and present an algorithm whose time complexity is linear in number of vertices of the polygon.
High temperature solid-catalized transesterification for biodiesel production
2010
Biodiesel has become more attractive recently because of its environmental benefits and the fact that it is made from renewable resources. Biodiesel is a mixture of monoalkyl esters of long chain fatty acids derived from renewable feed stock like vegetable oils and animal fats, mainly made of fatty acid glycerides. It is produced by transesterification processes in which oil or fat are reacted with a monohydric alcohol in the presence of a catalyst. The transesterification process is affected by reaction conditions, alcohol to oil molar ratio, type of alcohol, type and amount of catalysts, temperature and purity of reactants. Heterogeneous acid catalysts are quite efficient in promoting the…
CUSHAW2-GPU: Empowering Faster Gapped Short-Read Alignment Using GPU Computing
2014
We present CUSHAW2-GPU to accelerate the CUSHAW2 algorithm using compute unified device architecture (CUDA)-enabled GPUs. Two critical GPU computing techniques, namely intertask hybrid CPU-GPU parallelism and tile-based Smith-Waterman map backtracking using CUDA, are investigated to facilitate fast alignments. By aligning both simulated and real reads to the human genome, our aligner yields comparable or better performance compared to BWA-SW, Bowtie2, and GEM. Furthermore, CUSHAW2-GPU with a Tesla K20c GPU achieves significant speedups over the multithreaded CUSHAW2, BWA-SW, Bowtie2, and GEM on the 12 cores of a high-end CPU for both single-end and paired-end alignment.
Reflectance-based surface saliency
2017
In this paper, we propose an original methodology allowing the computation of the saliency maps for high dimensional RTI data (Reflectance Transformation Imaging). Unlike most of the classical methods, our approach aims at devising an intrinsic visual saliency of the surface, independent of the sensor (image) and the geometry of the scene (light-object-camera). From RTI data, we use the DMD (Discrete Modal Decomposition) technique for the angular reflectance reconstruction, which we extend by a new transformation on the modal basis enabling a rotation-invariant representation of reconstructed reflectances. This orientation-invariance of the resulting reflectance shapes fosters a robust esti…
An efficient upper bound of the rotation distance of binary trees
2000
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons triangulations. Ordinal tools are used.
Non-periodic Polynomial Splines
2015
In this chapter, we outline the essentials of the splines theory. By themselves, they are of interest for signal processing research. We use the Zak transform to derive an integral representation of polynomial splines on uniform grids. The integral representation facilitated design of different generators of spline spaces and their duals. It provides explicit expressions for interpolating and smoothing splines of any order. In forthcoming chapters, the integral representation of splines will be used for the constructions of efficient subdivision schemes and so also for the design spline-based wavelets and wavelet frames.
A Geometric Algorithm for Ray/Bézier Surfaces Intersection Using Quasi-Interpolating Control Net
2008
In this paper, we present a new geometric algorithm to compute the intersection between a ray and a rectangular Bezier patch. The novelty of our approach resides in the use of bounds of the difference between a Bezier patch and its quasi-interpolating control net. The quasi-interpolating polygon of a Bezier surface of arbitrary degree approximates the limit surface within a precision that is function of the second order difference of the control points, which allows for very simple projections and 2D intersection tests to determine sub-patches containing a potential intersection. Our algorithm is simple, because it only determines a 2D parametric interval containing the solution, and effici…
Surface Reconstruction Based on a Descriptive Approach
2000
The design of complex surfaces is generally hard to achieve. A natural method consists in the subdivision of the global surface into basic surface elements. The different elements are independently designed and then assembled together to represent the final surface. This method requires a classification and a formal description of the basic elements. This chapter presents a general framework for surface description, based on a constructive tree approach. In this tree the leaves are surface primitives and the nodes are constructive operators.