10 research outputs found
Cissoid constructions of augmented rational ruled surfaces
J.R. Sendra is member of the Research Group ASYNACS (Ref.CT-CE2019/683)Given two real affine rational surfaces we derive a criterion for deciding the rationality of their cissoid. Furthermore, when one of the surfaces is augmented ruled and the other is either an augmented ruled or an augmented Steiner surface, we prove that the cissoid is rational. Furthermore, given rational parametrizations of the surfaces, we provide a rational parametrization of the cissoid.Ministerio de EconomĂa y CompetitividadEuropean Regional Development Fun
Semidefinite representation of convex hulls of rational varieties
Using elementary duality properties of positive semidefinite moment matrices
and polynomial sum-of-squares decompositions, we prove that the convex hull of
rationally parameterized algebraic varieties is semidefinite representable
(that is, it can be represented as a projection of an affine section of the
cone of positive semidefinite matrices) in the case of (a) curves; (b)
hypersurfaces parameterized by quadratics; and (c) hypersurfaces parameterized
by bivariate quartics; all in an ambient space of arbitrary dimension
Implicit equations of non-degenerate rational Bezier quadric triangles
In this paper we review the derivation of implicit equations for non-degenerate quadric patches in rational BĂ©zier triangular form. These are the case of Steiner surfaces of degree two. We derive the bilinear forms for such quadrics in a coordinate-free fashion in terms of their control net and their list of weights in a suitable form. Our construction relies on projective geometry and is grounded on the pencil of quadrics circumscribed to a tetrahedron formed by vertices of the control net and an additional point which is required for the Steiner surface to be a non-degenerate quadric
Surfaces of general type via Q-Gorenstein smoothing
[No abstract in thesis
Geometric algorithms for algebraic curves and surfaces
This work presents novel geometric algorithms dealing with algebraic curves and surfaces of arbitrary degree. These algorithms are exact and complete — they return the mathematically true result for all input instances. Efficiency is achieved by cutting back expensive symbolic computation and favoring combinatorial and adaptive numerical methods instead, without spoiling exactness in the overall result. We present an algorithm for computing planar arrangements induced by real algebraic curves. We show its efficiency both in theory by a complexity analysis, as well as in practice by experimental comparison with related methods. For the latter, our solution has been implemented in the context of the Cgal library. The results show that it constitutes the best current exact implementation available for arrangements as well as for the related problem of computing the topology of one algebraic curve. The algorithm is also applied to related problems, such as arrangements of rotated curves, and arrangments embedded on a parameterized surface. In R3, we propose a new method to compute an isotopic triangulation of an algebraic surface. This triangulation is based on a stratification of the surface, which reveals topological and geometric information. Our implementation is the first for this problem that makes consequent use of numerical methods, and still yields the exact topology of the surface.Diese Arbeit stellt neue Algorithmen für algebraische Kurven und Flächen von beliebigem Grad vor. Diese Algorithmen liefern für alle Eingaben das mathematisch korrekte Ergebnis. Wir erreichen Effizienz, indem wir aufwendige symbolische Berechnungen weitesgehend vermeiden, und stattdessen kombinatorische und adaptive numerische Methoden einsetzen, ohne die Exaktheit des Resultats zu zerstören. Der Hauptbeitrag ist ein Algorithmus zur Berechnung von planaren Arrangements, die durch reelle algebraische Kurven induziert sind. Wir weisen die Effizienz des Verfahrens sowohl theoretisch durch eine Komplexitätsanalyse, als auch praktisch durch experimentelle Vergleiche nach. Dazu haben wir unser Verfahren im Rahmen der Softwarebibliothek Cgal implementiert. Die Resultate belegen, dass wir die zur Zeit beste verfügbare exakte Software bereitstellen. Der Algorithmus wird zur Arrangementberechnung rotierter Kurven, oder für Arrangements auf parametrisierten Oberflächen eingesetzt. Im R3 geben wir ein neues Verfahren zur Berechnung einer isotopen Triangulierung einer algebraischen Oberfläche an. Diese Triangulierung basiert auf einer Stratifizierung der Oberfläche, die topologische und geometrische Informationen berechnet. Unsere Implementierung ist die erste für dieses Problem, welche numerische Methoden konsequent einsetzt, und dennoch die exakte Topologie der Oberfläche liefert
Large bichromatic point sets admit empty monochromatic 4-gons
We consider a variation of a problem stated by ErdËťos
and Szekeres in 1935 about the existence of a number
fES(k) such that any set S of at least fES(k) points in
general position in the plane has a subset of k points
that are the vertices of a convex k-gon. In our setting
the points of S are colored, and we say that a (not necessarily
convex) spanned polygon is monochromatic if
all its vertices have the same color. Moreover, a polygon
is called empty if it does not contain any points of
S in its interior. We show that any bichromatic set of
n ≥ 5044 points in R2 in general position determines
at least one empty, monochromatic quadrilateral (and
thus linearly many).Postprint (published version