A semi-automatic computer-aided method for surgical template design

This paper presents a generalized integrated framework of semi-automatic surgical template design. Several algorithms were implemented including the mesh segmentation, offset surface generation, collision detection, ruled surface generation, etc., and a special software named TemDesigner was developed. With a simple user interface, a customized template can be semi- automatically designed according to the preoperative plan. Firstly, mesh segmentation with signed scalar of vertex is utilized to partition the inner surface from the input surface mesh based on the indicated point loop. Then, the offset surface of the inner surface is obtained through contouring the distance field of the inner surface, and segmented to generate the outer surface. Ruled surface is employed to connect inner and outer surfaces. Finally, drilling tubes are generated according to the preoperative plan through collision detection and merging. It has been applied to the template design for various kinds of surgeries, including oral implantology, cervical pedicle screw insertion, iliosacral screw insertion and osteotomy, demonstrating the efficiency, functionality and generality of our method.Comment: 18 pages, 16 figures, 2 tables, 36 reference

Morphing arquitectónico: transformaciones entre las casas usonianas de Frank Lloyd Wright

Esta tesis investiga sobre el proceso de transformación de la forma arquitectónica, analizando una técnica específica denominada morphing. La técnica del morphing se utiliza en los gráficos por ordenador para la transformación de la forma entre dos o más objetos dados. Desde un punto de vista técnico, se revisan y actualizan las metodologías y aplicaciones existentes, sus características específicas y sus incidencias sobre la arquitectura. Desde un punto de vista práctico, se utilizan una serie de modelos de las casas Usonianas de Frank Lloyd Wright, con el fin de experimentar la técnica y ver qué utilidades se pueden obtener a partir de su lógica de diseño. Como resultado de este análisis se obtiene una metodología genérica para el procedimiento de un morphing arquitectónico.This thesis investigates the transformation of architectural form, analyzing a specific technique called morphing. Morphing is a technique used in computer graphics to transform a form between two or more given objects. From a technical point of view, the existing techniques are reviewed and updated, as well as their specific characteristics and impact on architecture. From a practical point of view, some models of Usonian houses of Frank Lloyd Wright are used to experience the technique and see which utilities are available from his design logic. As a result of this analysis a generic methodology for the process of architectural morphing is obtained.Postprint (published version

Development and Integration of Geometric and Optimization Algorithms for Packing and Layout Design

The research work presented in this dissertation focuses on the development and application of optimization and geometric algorithms to packing and layout optimization problems. As part of this research work, a compact packing algorithm, a physically-based shape morphing algorithm, and a general purpose constrained multi-objective optimization algorithm are proposed. The compact packing algorithm is designed to pack three-dimensional free-form objects with full rotational freedom inside an arbitrary enclosure such that the packing efficiency is maximized. The proposed compact packing algorithm can handle objects with holes or cavities and its performance does not degrade significantly with the increase in the complexity of the enclosure or the objects. It outputs the location and orientation of all the objects, the packing sequence, and the packed configuration at the end of the packing operation. An improved layout algorithm that works with arbitrary enclosure geometry is also proposed. Different layout algorithms for the SAE and ISO luggage are proposed that exploit the unique characteristics of the problem under consideration. Several heuristics to improve the performance of the packing algorithm are also proposed. The proposed compact packing algorithm is benchmarked on a wide variety of synthetic and hypothetical problems and is shown to outperform other similar approaches. The physically-based shape morphing algorithm proposed in this dissertation is specifically designed for packing and layout applications, and thus it augments the compact packing algorithm. The proposed shape morphing algorithm is based on a modified mass-spring system which is used to model the morphable object. The shape morphing algorithm mimics a quasi-physical process similar to the inflation/deflation of a balloon filled with air. The morphing algorithm starts with an initial manifold geometry and morphs it to obtain a desired volume such that the obtained geometry does not interfere with the objects surrounding it. Several modifications to the original mass-spring system and to the underlying physics that governs it are proposed to significantly speed-up the shape morphing process. Since the geometry of a morphable object continuously changes during the morphing process, most collision detection algorithms that assume the colliding objects to be rigid cannot be used efficiently. And therefore, a general-purpose surface collision detection algorithm is also proposed that works with deformable objects and does not require any preprocessing. Many industrial design problems such as packing and layout optimization are computationally expensive, and a faster optimization algorithm can reduce the number of iterations (function evaluations) required to find the satisfycing solutions. A new multi-objective optimization algorithm namely Archive-based Micro Genetic Algorithm (AMGA2) is presented in this dissertation. Improved formulation for various operators used by the AMGA2 such as diversity preservation techniques, genetic variation operators, and the selection mechanism are also proposed. The AMGA2 also borrows several concepts from mathematical sciences to improve its performance and benefits from the existing literature in evolutionary optimization. A comprehensive benchmarking and comparison of AMGA2 with other state-of-the-art optimization algorithms on a wide variety of mathematical problems gleaned from literature demonstrates the superior performance of AMGA2. Thus, the research work presented in this dissertation makes contributions to the development and application of optimization and geometric algorithms

Some Basis Function Methods for Surface Approximation

This thesis considers issues in surface reconstruction such as identifying approximation methods that work well for certain applications and developing efficient methods to compute and manipulate these approximations. The first part of the thesis illustrates a new fast evaluation scheme to efficiently calculate thin-plate splines in two dimensions. In the fast multipole method scheme, exponential expansions/approximations are used as an intermediate step in converting far field series to local polynomial approximations. The contributions here are extending the scheme to the thin-plate spline and a new error analysis. The error analysis covers the practically important case where truncated series are used throughout, and through off line computation of error constants gives sharp error bounds. In the second part of this thesis, we investigates fitting a surface to an object using blobby models as a coarse level approximation. The aim is to achieve a given quality of approximation with relatively few parameters. This process involves an optimization procedure where a number of blobs (ellipses or ellipsoids) are separately fitted to a cloud of points. Then the optimized blobs are combined to yield an implicit surface approximating the cloud of points. The results for our test cases in 2 and 3 dimensions are very encouraging. For many applications, the coarse level blobby model itself will be sufficient. For example adding texture on top of the blobby surface can give a surprisingly realistic image. The last part of the thesis describes a method to reconstruct surfaces with known discontinuities. We fit a surface to the data points by performing a scattered data interpolation using compactly supported RBFs with respect to a geodesic distance. Techniques from computational geometry such as the visibility graph are used to compute the shortest Euclidean distance between two points, avoiding any obstacles. Results have shown that discontinuities on the surface were clearly reconstructed, and th

Métamorphose de maillage 3D

Cette thèse de doctorat aborde spécifiquement le problème de la métamorphose entre différents maillages 3D, qui peut assurer un niveau élevé de qualité pour la séquence de transition, qui devrait être aussi lisse et progressive que possible, cohérente par rapport à la géométrie et la topologie, et visuellement agréable. Les différentes étapes impliquées dans le processus de transformation sont développées dans cette thèse. Nos premières contributions concernent deux approches différentes des paramétrisations: un algorithme de mappage barycentrique basé sur la préservation des rapports de longueur et une technique de paramétrisation sphérique, exploitant la courbure Gaussien. L'évaluation expérimentale, effectuées sur des modèles 3D de formes variées, démontré une amélioration considérable en termes de distorsion maillage pour les deux méthodes. Afin d aligner les caractéristiques des deux modèles d'entrée, nous avons considéré une technique de déformation basée sur la fonction radial CTPS C2a approprié pour déformer le mappage dans le domaine paramétrique et maintenir un mappage valide a travers le processus de mouvement. La dernière contribution consiste d une une nouvelle méthode qui construit un pseudo metamaillage qui évite l'exécution et le suivi des intersections d arêtes comme rencontrées dans l'état-of-the-art. En outre, notre méthode permet de réduire de manière drastique le nombre de sommets normalement nécessaires dans une structure supermesh. Le cadre générale de métamorphose a été intégré dans une application prototype de morphing qui permet à l'utilisateur d'opérer de façon interactive avec des modèles 3D et de contrôler chaque étape du processusThis Ph.D. thesis specifically deals with the issue of metamorphosis of 3D objects represented as 3D triangular meshes. The objective is to elaborate a complete 3D mesh morphing methodology which ensures high quality transition sequences, smooth and gradual, consistent with respect to both geometry and topology, and visually pleasant. Our first contributions concern the two different approaches of parameterization: a new barycentric mapping algorithm based on the preservation of the mesh length ratios, and a spherical parameterization technique, exploiting a Gaussian curvature criterion. The experimental evaluation, carried out on 3D models of various shapes, demonstrated a considerably improvement in terms of mesh distortion for both methods. In order to align the features of the two input models, we have considered a warping technique based on the CTPS C2a radial basis function suitable to deform the models embeddings in the parametric domain maintaining a valid mapping through the entire movement process. We show how this technique has to be adapted in order to warp meshes specified in the parametric domains. A final contribution consists of a novel algorithm for constructing a pseudo-metamesh that avoids the complex process of edge intersections encountered in the state-of-the-art. The obtained mesh structure is characterized by a small number of vertices and it is able to approximate both the source and target shapes. The entire mesh morphing framework has been integrated in an interactive application that allows the user to control and visualize all the stages of the morphing processEVRY-INT (912282302) / SudocSudocFranceF