Exact Convex Hull Computation for Plane and Space Parametric Curves - Inria - Institut national de recherche en sciences et technologies du numérique
Preprints, Working Papers, ... Year : 2023

Exact Convex Hull Computation for Plane and Space Parametric Curves

Abstract

We consider the problem of the computing the boundary of the convex hull of rational parametric curves in \mathbb{R}ˆ2 and in \mathbb{R}ˆ3. The boundary of the convex hull is a semi-algebraic set and an exact representation of it breaks it down to a combination of line segments and arcs of the curve for the 2D case, and of triangles and surface patches for the 3D case. For both plane and space curves, we provide an algorithmic solution together with bit-complexity estimates. We show that the computation of the convex hull's boundary reduces in both cases to univariate and bivariate solving and to isolating roots of a univariate polynomial with coefficients in a multiple field extension. We express the bit-complexity with respect to the bit-complexity of the latter operation. Leveraging the results of Katsamaki and Rouillier [ISSAC '23], offers asymptotic upper bounds on the total bit-complexity.
Fichier principal
Vignette du fichier
Exact_Convex_Hull_Computation_for_Plane_and_Space_Parametric_Curves.pdf (1.47 Mo) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04345541 , version 1 (14-12-2023)

Licence

Identifiers

  • HAL Id : hal-04345541 , version 1

Cite

Christina Katsamaki, Fabrice Rouillier, Elias Tsigaridas. Exact Convex Hull Computation for Plane and Space Parametric Curves. 2023. ⟨hal-04345541⟩
50 View
67 Download

Share

More