IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i12p1447-d578796.html
   My bibliography  Save this article

Computing the Exact Number of Similarity Classes in the Longest Edge Bisection of Tetrahedra

Author

Listed:
  • Jose P. Suárez

    (IUMA Information and Communications System, University of Las Palmas de Gran Canaria, 35017 Canary Islands, Spain)

  • Agustín Trujillo

    (Imaging Technology Center (CTIM), University of Las Palmas de Gran Canaria, 35017 Canary Islands, Spain)

  • Tania Moreno

    (Facultad de Informática y Matemática, Universidad de Holguín, Holguín 80100, Cuba)

Abstract

Showing whether the longest-edge (LE) bisection of tetrahedra meshes degenerates the stability condition or not is still an open problem. Some reasons, in part, are due to the cost for achieving the computation of similarity classes of millions of tetrahedra. We prove the existence of tetrahedra where the LE bisection introduces, at most, 37 similarity classes. This family of new tetrahedra was roughly pointed out by Adler in 1983. However, as far as we know, there has been no evidence confirming its existence. We also introduce a new data structure and algorithm for computing the number of similarity tetrahedral classes based on integer arithmetic, storing only the square of edges. The algorithm lets us perform compact and efficient high-level similarity class computations with a cost that is only dependent on the number of similarity classes.

Suggested Citation

  • Jose P. Suárez & Agustín Trujillo & Tania Moreno, 2021. "Computing the Exact Number of Similarity Classes in the Longest Edge Bisection of Tetrahedra," Mathematics, MDPI, vol. 9(12), pages 1-13, June.
  • Handle: RePEc:gam:jmathe:v:9:y:2021:i:12:p:1447-:d:578796
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/12/1447/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/9/12/1447/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2021:i:12:p:1447-:d:578796. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.