Solving the pentahedron problem

Hichem Barki, Jean Marc Cane, Lionel Garnier, Dominique Michelucci, Sebti Foufou

    Research output: Contribution to journalArticle

    Abstract

    Nowadays, all geometric modelers provide some tools for specifying geometric constraints. The 3D pentahedron problem is an example of a 3D Geometric Constraint Solving Problem (GCSP), composed of six vertices, nine edges, five faces (two triangles and three quadrilaterals), and defined by the lengths of its edges and the planarity of its quadrilateral faces. This problem seems to be the simplest non-trivial problem, as the methods used to solve the Stewart platform or octahedron problem fail to solve it. The naive algebraic formulation of the pentahedron yields an under-constrained system of twelve equations in eighteen unknowns. Even if the use of placement rules transforms the pentahedron into a well-constrained problem of twelve equations in twelve unknowns, the resulting system is still hard to solve for interval solvers. In this work, we focus on solving the pentahedron problem in a more efficient and robust way, by reducing it to a well-constrained system of three equations in three unknowns, which can be solved by any interval solver, avoiding by the way the use of placement rules since the new formulation is already well-constrained. Several experiments showing a considerable performance enhancement (x 42) are reported in this paper to consolidate our theoretical findings. Throughout this paper, we also emphasize some interesting properties of the solution set, by showing that for a generic set of parameters, solutions in the form of 3D parallel edge pentahedra do exist almost all the time, and by providing a geometric construction for these solutions. The pentahedron problem also admits degenerate 2D solutions in finite number. This work also studies how these interesting properties generalize for other polyhedra.

    Original languageEnglish (US)
    Pages (from-to)200-209
    Number of pages10
    JournalCAD Computer Aided Design
    Volume58
    DOIs
    StatePublished - Jan 1 2015

    Fingerprint

    Experiments

    Keywords

    • Al-Kashi theorem
    • Desargues' theorem
    • Geometric constraint solving problems
    • Geometric modeling with constraints
    • Interval solver
    • Pentahedron

    ASJC Scopus subject areas

    • Computer Graphics and Computer-Aided Design
    • Computer Science Applications
    • Industrial and Manufacturing Engineering

    Cite this

    Barki, H., Cane, J. M., Garnier, L., Michelucci, D., & Foufou, S. (2015). Solving the pentahedron problem. CAD Computer Aided Design, 58, 200-209. https://doi.org/10.1016/j.cad.2014.08.027

    Solving the pentahedron problem. / Barki, Hichem; Cane, Jean Marc; Garnier, Lionel; Michelucci, Dominique; Foufou, Sebti.

    In: CAD Computer Aided Design, Vol. 58, 01.01.2015, p. 200-209.

    Research output: Contribution to journalArticle

    Barki, H, Cane, JM, Garnier, L, Michelucci, D & Foufou, S 2015, 'Solving the pentahedron problem', CAD Computer Aided Design, vol. 58, pp. 200-209. https://doi.org/10.1016/j.cad.2014.08.027
    Barki H, Cane JM, Garnier L, Michelucci D, Foufou S. Solving the pentahedron problem. CAD Computer Aided Design. 2015 Jan 1;58:200-209. https://doi.org/10.1016/j.cad.2014.08.027
    Barki, Hichem ; Cane, Jean Marc ; Garnier, Lionel ; Michelucci, Dominique ; Foufou, Sebti. / Solving the pentahedron problem. In: CAD Computer Aided Design. 2015 ; Vol. 58. pp. 200-209.
    @article{1a8518736ecf4ed690ecb60d052aa664,
    title = "Solving the pentahedron problem",
    abstract = "Nowadays, all geometric modelers provide some tools for specifying geometric constraints. The 3D pentahedron problem is an example of a 3D Geometric Constraint Solving Problem (GCSP), composed of six vertices, nine edges, five faces (two triangles and three quadrilaterals), and defined by the lengths of its edges and the planarity of its quadrilateral faces. This problem seems to be the simplest non-trivial problem, as the methods used to solve the Stewart platform or octahedron problem fail to solve it. The naive algebraic formulation of the pentahedron yields an under-constrained system of twelve equations in eighteen unknowns. Even if the use of placement rules transforms the pentahedron into a well-constrained problem of twelve equations in twelve unknowns, the resulting system is still hard to solve for interval solvers. In this work, we focus on solving the pentahedron problem in a more efficient and robust way, by reducing it to a well-constrained system of three equations in three unknowns, which can be solved by any interval solver, avoiding by the way the use of placement rules since the new formulation is already well-constrained. Several experiments showing a considerable performance enhancement (x 42) are reported in this paper to consolidate our theoretical findings. Throughout this paper, we also emphasize some interesting properties of the solution set, by showing that for a generic set of parameters, solutions in the form of 3D parallel edge pentahedra do exist almost all the time, and by providing a geometric construction for these solutions. The pentahedron problem also admits degenerate 2D solutions in finite number. This work also studies how these interesting properties generalize for other polyhedra.",
    keywords = "Al-Kashi theorem, Desargues' theorem, Geometric constraint solving problems, Geometric modeling with constraints, Interval solver, Pentahedron",
    author = "Hichem Barki and Cane, {Jean Marc} and Lionel Garnier and Dominique Michelucci and Sebti Foufou",
    year = "2015",
    month = "1",
    day = "1",
    doi = "10.1016/j.cad.2014.08.027",
    language = "English (US)",
    volume = "58",
    pages = "200--209",
    journal = "CAD Computer Aided Design",
    issn = "0010-4485",
    publisher = "Elsevier Limited",

    }

    TY - JOUR

    T1 - Solving the pentahedron problem

    AU - Barki, Hichem

    AU - Cane, Jean Marc

    AU - Garnier, Lionel

    AU - Michelucci, Dominique

    AU - Foufou, Sebti

    PY - 2015/1/1

    Y1 - 2015/1/1

    N2 - Nowadays, all geometric modelers provide some tools for specifying geometric constraints. The 3D pentahedron problem is an example of a 3D Geometric Constraint Solving Problem (GCSP), composed of six vertices, nine edges, five faces (two triangles and three quadrilaterals), and defined by the lengths of its edges and the planarity of its quadrilateral faces. This problem seems to be the simplest non-trivial problem, as the methods used to solve the Stewart platform or octahedron problem fail to solve it. The naive algebraic formulation of the pentahedron yields an under-constrained system of twelve equations in eighteen unknowns. Even if the use of placement rules transforms the pentahedron into a well-constrained problem of twelve equations in twelve unknowns, the resulting system is still hard to solve for interval solvers. In this work, we focus on solving the pentahedron problem in a more efficient and robust way, by reducing it to a well-constrained system of three equations in three unknowns, which can be solved by any interval solver, avoiding by the way the use of placement rules since the new formulation is already well-constrained. Several experiments showing a considerable performance enhancement (x 42) are reported in this paper to consolidate our theoretical findings. Throughout this paper, we also emphasize some interesting properties of the solution set, by showing that for a generic set of parameters, solutions in the form of 3D parallel edge pentahedra do exist almost all the time, and by providing a geometric construction for these solutions. The pentahedron problem also admits degenerate 2D solutions in finite number. This work also studies how these interesting properties generalize for other polyhedra.

    AB - Nowadays, all geometric modelers provide some tools for specifying geometric constraints. The 3D pentahedron problem is an example of a 3D Geometric Constraint Solving Problem (GCSP), composed of six vertices, nine edges, five faces (two triangles and three quadrilaterals), and defined by the lengths of its edges and the planarity of its quadrilateral faces. This problem seems to be the simplest non-trivial problem, as the methods used to solve the Stewart platform or octahedron problem fail to solve it. The naive algebraic formulation of the pentahedron yields an under-constrained system of twelve equations in eighteen unknowns. Even if the use of placement rules transforms the pentahedron into a well-constrained problem of twelve equations in twelve unknowns, the resulting system is still hard to solve for interval solvers. In this work, we focus on solving the pentahedron problem in a more efficient and robust way, by reducing it to a well-constrained system of three equations in three unknowns, which can be solved by any interval solver, avoiding by the way the use of placement rules since the new formulation is already well-constrained. Several experiments showing a considerable performance enhancement (x 42) are reported in this paper to consolidate our theoretical findings. Throughout this paper, we also emphasize some interesting properties of the solution set, by showing that for a generic set of parameters, solutions in the form of 3D parallel edge pentahedra do exist almost all the time, and by providing a geometric construction for these solutions. The pentahedron problem also admits degenerate 2D solutions in finite number. This work also studies how these interesting properties generalize for other polyhedra.

    KW - Al-Kashi theorem

    KW - Desargues' theorem

    KW - Geometric constraint solving problems

    KW - Geometric modeling with constraints

    KW - Interval solver

    KW - Pentahedron

    UR - http://www.scopus.com/inward/record.url?scp=84920716701&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84920716701&partnerID=8YFLogxK

    U2 - 10.1016/j.cad.2014.08.027

    DO - 10.1016/j.cad.2014.08.027

    M3 - Article

    VL - 58

    SP - 200

    EP - 209

    JO - CAD Computer Aided Design

    JF - CAD Computer Aided Design

    SN - 0010-4485

    ER -