42 research outputs found
Arbitrary topology meshes in geometric design and vector graphics
Meshes are a powerful means to represent objects and shapes both in 2D and 3D, but the techniques based on meshes can only be used in certain regular settings and restrict their usage. Meshes with an arbitrary topology have many interesting applications in geometric design and (vector) graphics, and can give designers more freedom in designing complex objects. In the first part of the thesis we look at how these meshes can be used in computer aided design to represent objects that consist of multiple regular meshes that are constructed together. Then we extend the B-spline surface technique from the regular setting to work on extraordinary regions in meshes so that multisided B-spline patches are created. In addition, we show how to render multisided objects efficiently, through using the GPU and tessellation. In the second part of the thesis we look at how the gradient mesh vector graphics primitives can be combined with procedural noise functions to create expressive but sparsely defined vector graphic images. We also look at how the gradient mesh can be extended to arbitrary topology variants. Here, we compare existing work with two new formulations of a polygonal gradient mesh. Finally we show how we can turn any image into a vector graphics image in an efficient manner. This vectorisation process automatically extracts important image features and constructs a mesh around it. This automatic pipeline is very efficient and even facilitates interactive image vectorisation
A new surface joining technique for the design of shoe lasts
The footwear industry is a traditional craft sector, where technological advances are difficult to implement owing to the complexity of the processes being carried out, and the level of precision demanded by most of them. The shoe last joining operation is one clear example, where two halves from different lasts are put together, following a specifically traditional process, to create a new one. Existing surface joining techniques analysed in this paper are not well adapted to shoe last design and production processes, which makes their implementation in the industry difficult. This paper presents an alternative surface joining technique, inspired by the traditional work of lastmakers. This way, lastmakers will be able to easily adapt to the new tool and make the most out of their know-how. The technique is based on the use of curve networks that are created on the surfaces to be joined, instead of using discrete data. Finally, a series of joining tests are presented, in which real lasts were successfully joined using a commercial last design software. The method has shown to be valid, efficient, and feasible within the sector
Changing representation of curves and surfaces: exact and approximate methods
Το κύριο αντικείμενο μελέτης στην παρούσα διατριβή είναι η αλλαγή αναπαράστασης
γεωμετρικών αντικειμένων από παραμετρική σε αλγεβρική (ή πεπλεγμένη) μορφή.
Υπολογίζουμε την αλγεβρική εξίσωση παρεμβάλλοντας τους άγνωστους συντελεστές
του πολυωνύμου δεδομένου ενός υπερσυνόλου των μονωνύμων του. Το τελευταίο
υπολογίζεται απο το Newton πολύτοπο της αλγεβρικής εξίσωσης που υπολογίζεται
από μια πρόσφατη μέθοδο πρόβλεψης του συνόλου στήριξης της εξίσωσης. H μέθοδος
πρόβλεψης του συνόλου στήριξης βασίζεται στην αραιή (ή τορική) απαλοιφή: το
πολύτοπο υπολογίζεται από
το Newton πολύτοπο της αραιής απαλοίφουσας αν θεωρίσουμε την παραμετροποίηση ως
πολυωνυμικό σύστημα. Στα μονώνυμα που αντιστοιχούν στα ακέραια σημεία του
Newton πολυτόπου δίνονται τιμές ώστε να σχηματίσουν έναν αριθμητικό πίνακα. Ο
πυρήνα του πίνακα αυτού, διάστασης 1 σε ιδανική περίπτωση, περιέχει τους
συντελεστές των
μονωνύμων στην αλγεβρική εξίσωση. Υπολογίζουμε τον πυρήνα του πίνακα είτε
συμβολικά είτε αριθμητικά εφαρμόζοντας την μέθοδο του singular value
decomposition (SVD). Προτείνουμε τεχνικές για να διαχειριστούμε την περίπτωση
ενός πολυδιάστατου πυρήνα το οποίο εμφανίζεται όταν το προβλεπόμενο σύνολο
στήριξης είναι ένα υπερσύνολο του
πραγματικού. Αυτό δίνει έναν αποτελεσματικό ευαίσθητο-εξόδου αλγόριθμο
υπολογισμού της αλγεβρικής εξίσωσης. Συγκρίνουμε διαφορετικές προσεγγίσεις
κατασκευής του πίνακα μέσω των λογισμικών Maple και SAGE. Στα πειράματά μας
χρησιμοποιήθηκαν ρητές
καμπύλες και επιφάνειες καθώς και NURBS. Η μέθοδός μας μπορεί να εφαρμοστεί σε
πολυώνυμα ή ρητές παραμετροποιήσεις επίπεδων καμπυλών ή (υπερ)επιφανειών
οποιασδήποτε διάστασης συμπεριλαμβανομένων και των περιπτώσεων με
παραμετροποίηση σεσημεία βάσης που εγείρουν σημαντικά ζητήματα για άλλες
μεθόδους αλγεβρικοποίησης.
Η μέθοδος έχει τον εξής περιορισμό: τα γεωμετρικά αντικείμενα πρέπει να
αναπαριστώνται από βάσεις μονωνύμων που στην περίπτωση τριγωνομετρικών
παραμετροποιήσεων θα πρέπει να μπορούν να μετασχηματιστούν σε ρητές
συναρτήσεις. Επιπλέον η τεχνική που
προτείνουμε μπορεί να εφαρμοστεί σε μη γεωμετρικά προβλήματα όπως ο
υπολογισμόςτης διακρίνουσας ενός πολυωνύμου με πολλές μεταβλητές ή της
απαλοίφουσας ενός συστήματος πολυωνύμων με πολλές μεταβλητές.The main object of study in our dissertation is the representation change of
the geometric objects
from the parametric form to implicit. We compute the implicit equation
interpolating the
unknown coefficients of the implicit polynomial given a superset of its
monomials. The latter is
derived from the Newton polytope of the implicit equation obtained by the
recently developed
method for support prediction. The support prediction method we use relies on
sparse (or
toric) elimination: the implicit polytope is obtained from the Newton polytope
of the sparse
resultant of the system in parametrization, represented as polynomials. The
monomials that
correspond to the lattice points of the Newton polytope are suitably evaluated
to build a numeric
matrix, ideally of corank 1. Its kernel contains their coefficients in the
implicit equation.
We compute kernel of the matrix either symbolically, or numerically, applying
singular value
decomposition (SVD). We propose techniques for handling the case of the
multidimensional
kernel space, caused by the predicted support being a superset of the actual.
This yields an
efficient, output-sensitive algorithm for computing the implicit equation. We
compare different
approaches for constructing the matrix in Maple and SAGE software. In our
experiments we
have used classical algebraic curves and surfaces as well as NURBS. Our method
can be
applied to polynomial or rational parametrizations of planar curves or
(hyper)surfaces of any
dimension including cases of parameterizations with base points which raise
important issues
for other implicitization methods. The method has its limits: geometric objects
have to be presented
using monomial basis; in the case of trigonometric parametrizations they have
to be
convertible to rational functions. Moreover, the proposed technique can be
applied for nongeometric
problems such as the computation of the discriminant of a multivariate
polynomial
or the resultant of a system of multivariate polynomials
Fast Isogeometric Boundary Element Method based on Independent Field Approximation
An isogeometric boundary element method for problems in elasticity is
presented, which is based on an independent approximation for the geometry,
traction and displacement field. This enables a flexible choice of refinement
strategies, permits an efficient evaluation of geometry related information, a
mixed collocation scheme which deals with discontinuous tractions along
non-smooth boundaries and a significant reduction of the right hand side of the
system of equations for common boundary conditions. All these benefits are
achieved without any loss of accuracy compared to conventional isogeometric
formulations. The system matrices are approximated by means of hierarchical
matrices to reduce the computational complexity for large scale analysis. For
the required geometrical bisection of the domain, a strategy for the evaluation
of bounding boxes containing the supports of NURBS basis functions is
presented. The versatility and accuracy of the proposed methodology is
demonstrated by convergence studies showing optimal rates and real world
examples in two and three dimensions.Comment: 32 pages, 27 figure
A code for surface modeling and grid generation coupled to a panel method for aerodynamic configuration design
An integrated platform has been developed which features a geometric, a grid generation and an aerodynamic analysis module. The main intent is to execute a quick though reliable preliminary aerodynamic analysis on a generic complex aerodynamic configuration and, at the same time, provide a mean of exporting the defined geometry or grid to leading CAE/CAD, meshing and analysis softwares, for deep detail modifications or more accurate, although time consuming, analysis.
In the geometric module, the process of shape definition is easily and intuitively achieved with the aid of specific features and tools. The geometric description relies on NURBS, a flexible, accurate and efficient parametric form.
Once the configuration has been defined, the user is ready to move on the grid generation module, or to export it to IGES standard format in order to use CAE/CAD, meshing or aerodynamic analysis programs.
The grid generation module is capable to build structured or unstructured meshes. Both of the processes are automatized, even if the user can easily set and control grid parameters. The structured grid generator is oriented to LaWGS description standard, while the unstructured grid can be exported to different formats.
The user is now ready to launch Pan Air, a panel method, as the aerodynamic solver. The preprocessor and postprocessor aid to the definition of the flow parameters and to the graphical visualization of the results.
One of the strength of this code is the user friendly GUI organization of each module: the user is aided throughout all the steps. Besides this, every module relies on fast computational algorithms to speed up the overall process.
For all these reasons, this code has a natural lean to be used in pair with an optimization tool
Doctor of Philosophy
dissertationVolumetric parameterization is an emerging field in computer graphics, where volumetric representations that have a semi-regular tensor-product structure are desired in applications such as three-dimensional (3D) texture mapping and physically-based simulation. At the same time, volumetric parameterization is also needed in the Isogeometric Analysis (IA) paradigm, which uses the same parametric space for representing geometry, simulation attributes and solutions. One of the main advantages of the IA framework is that the user gets feedback directly as attributes of the NURBS model representation, which can represent geometry exactly, avoiding both the need to generate a finite element mesh and the need to reverse engineer the simulation results from the finite element mesh back into the model. Research in this area has largely been concerned with issues of the quality of the analysis and simulation results assuming the existence of a high quality volumetric NURBS model that is appropriate for simulation. However, there are currently no generally applicable approaches to generating such a model or visualizing the higher order smooth isosurfaces of the simulation attributes, either as a part of current Computer Aided Design or Reverse Engineering systems and methodologies. Furthermore, even though the mesh generation pipeline is circumvented in the concept of IA, the quality of the model still significantly influences the analysis result. This work presents a pipeline to create, analyze and visualize NURBS geometries. Based on the concept of analysis-aware modeling, this work focusses in particular on methodologies to decompose a volumetric domain into simpler pieces based on appropriate midstructures by respecting other relevant interior material attributes. The domain is decomposed such that a tensor-product style parameterization can be established on the subvolumes, where the parameterization matches along subvolume boundaries. The volumetric parameterization is optimized using gradient-based nonlinear optimization algorithms and datafitting methods are introduced to fit trivariate B-splines to the parameterized subvolumes with guaranteed order of accuracy. Then, a visualization method is proposed allowing to directly inspect isosurfaces of attributes, such as the results of analysis, embedded in the NURBS geometry. Finally, the various methodologies proposed in this work are demonstrated on complex representations arising in practice and research
Bicubic B-Spline And Thin Plate Spline On Surface Appoximation
In real life, the available data points which are either 2D or 3D are normally scattered and contaminated with noise. The noise is defined as the variation in a set of data points. To fit these data points, the approximation methods are considered as a suitable mean compared to the interpolation methods. It is important for the approximation methods to preserve the shape and features of the model in the presence of any noise. B-spline and thin plate spline approximation are being studied in this thesis. The effectiveness of the modified B-spline approximation algorithm is investigated in approximating the bicubic B-spline surface from the samples of scattered data points taken from the point set model
New strategies for curve and arbitrary-topology surface constructions for design
This dissertation presents some novel constructions for curves and surfaces with arbitrary topology in the context of geometric modeling.
In particular, it deals mainly with three intimately connected topics that are of interest in both theoretical and applied research: subdivision surfaces, non-uniform local interpolation (in both univariate and bivariate cases), and spaces of generalized splines.
Specifically, we describe a strategy for the integration of subdivision surfaces in computer-aided design systems and provide examples to show the effectiveness of its implementation.
Moreover, we present a construction of locally supported, non-uniform, piecewise polynomial univariate interpolants of minimum degree with respect to other prescribed design parameters (such as support width, order of continuity and order of approximation).
Still in the setting of non-uniform local interpolation, but in the case of surfaces, we devise a novel parameterization strategy that, together with a suitable patching technique, allows us to define composite surfaces that interpolate given arbitrary-topology meshes or curve networks and satisfy both requirements of regularity and aesthetic shape quality usually needed in the CAD modeling framework.
Finally, in the context of generalized splines, we propose an approach for the construction of the optimal normalized totally positive (B-spline) basis, acknowledged as the best basis of representation for design purposes, as well as a numerical procedure for checking the existence of such a basis in a given generalized spline space.
All the constructions presented here have been devised keeping in mind also the importance of application and implementation, and of the related requirements that numerical procedures must satisfy, in particular in the CAD context