Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 13 of 13 for “"Implicitization"”.
-
Implicitization, Interpolation, and Syzygies
Η αλγεβρικοποίηση καμπυλών και επιφανειών είναι μία θεμελιώδης μετατροπή στην αναπαράσταση γεωμετρικών αντικειμένων από παραμετρική μορφή ή αναπαράσταση νέφους σημείων σε μία αλγεβρική αναπαράσταση, και ειδικότερα ως το μηδενοσύνολο ενός (ή περισσότερων) πολυωνυμικών εξισώσεων. Αυτή η διπλωματική …
-
Topics in resultants and implicitization
… and sparse resultants in geometric modeling is implicitization. Implicitization is the process of converting surfaces from parametric form into algebraic form. Classical resultant methods fail when a rational surface has base points. The method of moving quadrics, first introduced by Professor …
-
Examples Of Implicitization Of Hypersurfaces Through Syzygies
… equation P(x), called the implicit equation. The implicitization problem asks for techniques for finding the implicit equation. This is an old problem in algebraic geometry, and can be solved effectively through elimination using Gr¨ bner bases. However, this solution represents a black box in …
-
Syzygies and implicitization of tensor product surfaces
… λ allows us to formulate faster algorithms for implicitization of these surfaces and also to understand their singularities. We show that for tensor product surfaces without basepoints, the existence of a linear syzygy imposes strong conditions on the structure of the syzygies that determine the …
-
Equations of parametric surfaces with base points via syzygies
… mathbf{P}^1 imes mathbf{P}^1 o mathbf{P}^3$. The implicitization problem is to compute an implicit equation $F=0$ of $S$ using the parametrization $phi$. An algorithm using syzygies exists for computing $F$ if $phi$ has no base points, i.e. $phi$ is everywhere defined. This work is an extension of …
-
Mu -bases and their applications in geometric modeling
… discussed. μ-bases are then applied to solve implicitization, inversion and intersection problems for rational space curves. Next, a natural one to one correspondence is derived between the singular points of rational planar curves and the axial moving lines that follow these curves. This …
-
Model testing for causal models
… For equality constraints, we formulate an implicitization problem and show how we may reduce the complexity of the problem. We also study the algebraic structure of the equality constraints. For inequality constraints, we present a class of inequality constraints on both nonexperimental and …
-
Compact and efficient implicit representations
… As there is not one implicit representation or implicitization algorithm that would be the best in any situation, we develop methods that fit to different kinds of informations known about the object we want to represent. As we show, objects constructed by sweeping a rigid body can be …
-
Changing representation of curves and surfaces: exact and approximate methods
… 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 …
-
Sparse polynomial systems in optimization
… geometric information of the variety. Tropical implicitization means computing the tropicalization of a unirational variety from its parametrization. In the case of a hypersurface, this amounts to finding the Newton polytope of the implicit equation, without computing its coefficients. We use …
-
Algebraic level sets for CAD/CAE integration and moving boundary problems
… the NURBS geometry and algebraic tools of implicitization. Such a signed distance measure, also referred to as the Algebraic Level Sets, gives a volumetric representation of the B-rep geometry constructed by purely non-iterative algebraic operations on the geometry. This in turn enables …
-
Intersection Algorithms Based On Geometric Intervals
This thesis introduces new algorithms for solving curve/curve and ray/surface intersections. These algorithms introduce the concept of a geometric interval to extend the technique of Bézier clipping. A geometric interval is used to tightly bound a curve or surface or to contain a point on a curve …
-
Αλγεβρικοί αλγόριθμοι για την επίλυση πολυωνυμικών συστημάτων και εφαρμογές
The main object of study in this dissertation is the sparse resultant. Resultants are defined in the sparse (or toric) context in order to exploit the structure of the polynomials as expressed by their Newton polytopes. We consider sparse elimination theory in order to describe the Newton polytope …