306 research outputs found
www.elsevier.com/locate/cagd A local fitting algorithm for converting planar curves to B-splines
In this paper we present a local fitting algorithm for converting smooth planar curves to B-splines. For a smooth planar curve a set of points together with their tangent vectors are first sampled from the curve such that the connected polygon approximates the curve with high accuracy and inflexions are detected by the sampled data efficiently. Then, a G1 continuous BĂ©zier spline curve is obtained by fitting the sampled data with shape preservation as well as within a prescribed accuracy. Finally, the BĂ©zier spline is merged into a C2 continuous B-spline curve by subdivision and control points adjustment. The merging is guaranteed to be within another error bound and with no more inflexions than the BĂ©zier spline. In addition to shape preserving and error control, this conversion algorithm also benefits that the knots are selected automatically and adaptively according to local shape and error bound. A few experimental results are included to demonstrate the validity and efficiency of the algorithm
Multiple 2D self organising map network for surface reconstruction of 3D unstructured data
Surface reconstruction is a challenging task in reverse engineering because it must represent the surface which is similar to the original object based on the data obtained. The data obtained are mostly in unstructured type whereby there is not enough information and incorrect surface will be obtained. Therefore, the data should be reorganised by finding the correct topology with minimum surface error. Previous studies showed that Self Organising Map (SOM) model, the conventional surface approximation approach with Non Uniform Rational B-Splines (NURBS) surfaces, and optimisation methods such as Genetic Algorithm (GA), Differential Evolution (DE) and Particle Swarm Optimisation (PSO) methods are widely implemented in solving the surface reconstruction. However, the model, approach and optimisation methods are still suffer from the unstructured data and accuracy problems. Therefore, the aims of this research are to propose Cube SOM (CSOM) model with multiple 2D SOM network in organising the unstructured surface data, and to propose optimised surface approximation approach in generating the NURBS surfaces. GA, DE and PSO methods are implemented to minimise the surface error by adjusting the NURBS control points. In order to test and validate the proposed model and approach, four primitive objects data and one medical image data are used. As to evaluate the performance of the proposed model and approach, three performance measurements have been used: Average Quantisation Error (AQE) and Number Of Vertices (NOV) for the CSOM model while surface error for the proposed optimised surface approximation approach. The accuracy of AQE for CSOM model has been improved to 64% and 66% when compared to 2D and 3D SOM respectively. The NOV for CSOM model has been reduced from 8000 to 2168 as compared to 3D SOM. The accuracy of surface error for the optimised surface approximation approach has been improved to 7% compared to the conventional approach. The proposed CSOM model and optimised surface approximation approach have successfully reconstructed surface of all five data with better performance based on three performance measurements used in the evaluation
Efficient merging of multiple segments of B\'ezier curves
This paper deals with the merging problem of segments of a composite B\'ezier
curve, with the endpoints continuity constraints. We present a novel method
which is based on the idea of using constrained dual Bernstein polynomial basis
(P. Wo\'zny, S. Lewanowicz, Comput. Aided Geom. Design 26 (2009), 566--579) to
compute the control points of the merged curve. Thanks to using fast schemes of
evaluation of certain connections involving Bernstein and dual Bernstein
polynomials, the complexity of our algorithm is significantly less than
complexity of other merging methods
SimboliÄŤko spajanje B-splajn krivulja
We present an algorithm for stitching B-spline curves, which is different from the generally used least square method. Our aim is to find a symbolic solution for unifying the control polygons of arcs separately described as 4th degree B-spline curves. We show the effect of interpolation conditions and fairing functions as well.Predstavljamo algoritam za spajanje B-splajn krivulja, koji se razlikuje od općenito upotrebljavane metode najmanjih kvadrata. Naš cilj je naći simboličko rješenje za ujedinjavanje kontrolnih poligona lukova koji se svaki zasebno opisuju kao B-splajn krivulje 4. stupnja. Također pokazujemo utjecaj uvjeta interpolacije i postizanja glatkih funkcija
Simultaneous multicurve approximation with NURBS
info:eu-repo/semantics/publishe
Collision Detection and Merging of Deformable B-Spline Surfaces in Virtual Reality Environment
This thesis presents a computational framework for representing, manipulating and merging rigid and deformable freeform objects in virtual reality (VR) environment. The core algorithms for collision detection, merging, and physics-based modeling used within this framework assume that all 3D deformable objects are B-spline surfaces. The interactive design tool can be represented as a B-spline surface, an implicit surface or a point, to allow the user a variety of rigid or deformable tools. The collision detection system utilizes the fact that the blending matrices used to discretize the B-spline surface are independent of the position of the control points and, therefore, can be pre-calculated. Complex B-spline surfaces can be generated by merging various B-spline surface patches using the B-spline surface patches merging algorithm presented in this thesis. Finally, the physics-based modeling system uses the mass-spring representation to determine the deformation and the reaction force values provided to the user. This helps to simulate realistic material behaviour of the model and assist the user in validating the design before performing extensive product detailing or finite element analysis using commercially available CAD software. The novelty of the proposed method stems from the pre-calculated blending matrices used to generate the points for graphical rendering, collision detection, merging of B-spline patches, and nodes for the mass spring system. This approach reduces computational time by avoiding the need to solve complex equations for blending functions of B-splines and perform the inversion of large matrices. This alternative approach to the mechanical concept design will also help to do away with the need to build prototypes for conceptualization and preliminary validation of the idea thereby reducing the time and cost of concept design phase and the wastage of resources
Multi-scale active shape description in medical imaging
Shape description in medical imaging has become an increasingly important research field in recent years. Fast and high-resolution image acquisition methods like Magnetic Resonance (MR) imaging produce very detailed cross-sectional images of the human body - shape description is then a post-processing operation which abstracts quantitative descriptions of anatomically relevant object shapes. This task is usually performed by clinicians and other experts by first segmenting the shapes of interest, and then making volumetric and other quantitative measurements. High demand on expert time and inter- and intra-observer variability impose a clinical need of automating this process. Furthermore, recent studies in clinical neurology on the correspondence between disease status and degree of shape deformations necessitate the use of more sophisticated, higher-level shape description techniques. In this work a new hierarchical tool for shape description has been developed, combining two recently developed and powerful techniques in image processing: differential invariants in scale-space, and active contour models. This tool enables quantitative and qualitative shape studies at multiple levels of image detail, exploring the extra image scale degree of freedom. Using scale-space continuity, the global object shape can be detected at a coarse level of image detail, and finer shape characteristics can be found at higher levels of detail or scales. New methods for active shape evolution and focusing have been developed for the extraction of shapes at a large set of scales using an active contour model whose energy function is regularized with respect to scale and geometric differential image invariants. The resulting set of shapes is formulated as a multiscale shape stack which is analysed and described for each scale level with a large set of shape descriptors to obtain and analyse shape changes across scales. This shape stack leads naturally to several questions in regard to variable sampling and appropriate levels of detail to investigate an image. The relationship between active contour sampling precision and scale-space is addressed. After a thorough review of modem shape description, multi-scale image processing and active contour model techniques, the novel framework for multi-scale active shape description is presented and tested on synthetic images and medical images. An interesting result is the recovery of the fractal dimension of a known fractal boundary using this framework. Medical applications addressed are grey-matter deformations occurring for patients with epilepsy, spinal cord atrophy for patients with Multiple Sclerosis, and cortical impairment for neonates. Extensions to non-linear scale-spaces, comparisons to binary curve and curvature evolution schemes as well as other hierarchical shape descriptors are discussed
Computational Techniques to Predict Orthopaedic Implant Alignment and Fit in Bone
Among the broad palette of surgical techniques employed in the current orthopaedic practice, joint replacement represents one of the most difficult and costliest surgical procedures. While numerous recent advances suggest that computer assistance can dramatically improve the precision and long term outcomes of joint arthroplasty even in the hands of experienced surgeons, many of the joint replacement protocols continue to rely almost exclusively on an empirical basis that often entail a succession of trial and error maneuvers that can only be performed intraoperatively. Although the surgeon is generally unable to accurately and reliably predict a priori what the final malalignment will be or even what implant size should be used for a certain patient, the overarching goal of all arthroplastic procedures is to ensure that an appropriate match exists between the native and prosthetic axes of the articulation.
To address this relative lack of knowledge, the main objective of this thesis was to develop a comprehensive library of numerical techniques capable to: 1) accurately reconstruct the outer and inner geometry of the bone to be implanted; 2) determine the location of the native articular axis to be replicated by the implant; 3) assess the insertability of a certain implant within the endosteal canal of the bone to be implanted; 4) propose customized implant geometries capable to ensure minimal malalignments between native and prosthetic axes. The accuracy of the developed algorithms was validated through comparisons performed against conventional methods involving either contact-acquired data or navigated implantation approaches, while various customized implant designs proposed were tested with an original numerical implantation method.
It is anticipated that the proposed computer-based approaches will eliminate or at least diminish the need for undesirable trial and error implantation procedures in a sense that present error-prone intraoperative implant insertion decisions will be at least augmented if not even replaced by optimal computer-based solutions to offer reliable virtual “previews” of the future surgical procedure. While the entire thesis is focused on the elbow as the most challenging joint replacement surgery, many of the developed approaches are equally applicable to other upper or lower limb articulations
- …