Search results for "Computer Graphics and Computer-Aided Design"
showing 10 items of 223 documents
A COMPARATIVE STUDY BETWEEN ´ BIHARMONIC BEZIER SURFACES AND BIHARMONIC EXTREMAL SURFACES
2009
AbstractGiven a prescribed boundary of a Bezier surface, we compare the Bezier surfaces generated by two different methods, i.e., the Bezier surface minimising the biharmonic functional and the unique Bezier surface solution of the biharmonic equation with prescribed boundary. Although often the two types of surfaces look visually the same, we show that they are indeed different. In this paper, we provide a theoretical argument showing why the two types of surfaces are not always the same.
Two -methods to generate Bézier surfaces from the boundary
2009
Two methods to generate tensor-product Bezier surface patches from their boundary curves and with tangent conditions along them are presented. The first one is based on the tetraharmonic equation: we show the existence and uniqueness of the solution of @D^4x->=0 with prescribed boundary and adjacent to the boundary control points of a nxn Bezier surface. The second one is based on the nonhomogeneous biharmonic equation @D^2x->=p, where p could be understood as a vectorial load adapted to the C^1-boundary conditions.
Bézier surfaces of minimal area: The Dirichlet approach
2004
The Plateau-Bezier problem consists in finding the Bezier surface with minimal area from among all Bezier surfaces with prescribed border. An approximation to the solution of the Plateau-Bezier problem is obtained by replacing the area functional with the Dirichlet functional. Some comparisons between Dirichlet extremals and Bezier surfaces obtained by the use of masks related with minimal surfaces are studied.
3D segmentation of abdominal aorta from CT-scan and MR images
2012
International audience; We designed a generic method for segmenting the aneurismal sac of an abdominal aortic aneurysm (AAA) both from multi-slice MR and CT-scan examinations. It is a semi-automatic method requiring little human intervention and based on graph cut theory to segment the lumen interface and the aortic wall of AAAs. Our segmentation method works independently on MRI and CT-scan volumes and has been tested on a 44 patient dataset and 10 synthetic images. Segmentation and maximum diameter estimation were compared to manual tracing from 4 experts. An inter-observer study was performed in order to measure the variability range of a human observer. Based on three metrics (the maxim…
A Robust and Simple Measure for Quality-Guided 2D Phase Unwrapping Algorithms
2016
Quality-based 2D phase unwrapping algorithms provide one of the best tradeoffs between speed and quality of results. Their robustness depends on a quality map, which is used to build a path that visits the most reliable pixels first. Unwrapping then proceeds along this path, delaying unwrapping of noisy and inconsistent areas until the end, so that the unwrapping errors remain local. We propose a novel quality measure that is consistent, technically sound, effective, fast to compute, and immune to the presence of a carrier signal. The new measure combines the benefits of both the quality-guided and the residue-based phase unwrapping approaches. The quality map is justified from the two diff…
A Formalism Supplementing Cognitive Semantics Based on Mereology
2007
ABSTRACT This paper is motivated by and aims to supplement Cognitive Semantics. Details of this latter prominent approach within contemporary linguistic research will not be discussed here. Rather, we focus on a formalization of the concept of Gestalt and provide a formal semantics that can be used to interpret a certain formal language (LM 0) with respect to a universe of structured wholes (Gestalts). Since a great deal of the analyses of linguistic organization that has been provided by Cognitive Semantics since the mid-1970s is based on the concept of Gestalt, the semantics unfolded in the following may be viewed as an attempt to provide a starting point for supplementing the yet informa…
Radical innovation by theoretical abstraction - a challenge for the user-centred designer
2016
AbstractIt is generally accepted that scientific disciplines such as psychology, sociology, and anthropology contribute beneficially to design by providing understanding of users’ needs, experiences, and desires. Arguably, however, these disciplines have more to contribute, because they include theories and models that can be applied as design frames and principles. More specifically, goal-setting, visualization, thematization, and conceptual reconfiguration are general mechanisms through which theories translate into design contributions. Actualizing radical design solutions via these mechanisms is discussed: theories provide appropriate means of abstraction, which allows ‘distance’ from u…
On embedding Boolean as a subtype of integer
1990
Efficient estimation of tuned liquid column damper inerter (TLCDI) parameters for seismic control of base‐isolated structures
2022
This paper presents an enhanced base-isolation (BI) system equipped with a novel passive control device composed of a tuned liquid damper and an inerter (TLCDI). With the aim of reducing the seismic response of BI systems, this contribution focuses on the design of the TLCDI providing analytical solutions for the optimal TLCDI parameters, easily implementable in the design phase. The effectiveness of the proposed approach in terms of seismic response reduction and computational gain is validated by comparison with classical numerical optimization techniques. The control performance of two different base-isolated TLCDI-controlled structures is assessed by employing real-ground motion records…
An optimized mass storage FFT for vector computers
1995
Abstract The performance of a segmented FFT algorithm which allows the out-of-core computation of the Fourier transform of a very large mass storage data array is presented. The code is particularly optimized for vector computers. Tests performed mainly on a CONVEX C210 vector computer showed that, for very long transforms, tuning of the main parameters involved leads to computation speed and global efficiency better than for FFTs performed in-core. The use of tunable parameters allows optimization of the algorithm on machines with different configurations.