IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v75y2007i5p251-262.html
   My bibliography  Save this article

Refinement based on longest-edge and self-similar four-triangle partitions

Author

Listed:
  • Padrón, Miguel A.
  • Suárez, José P.
  • Plaza, Ángel

Abstract

The triangle longest-edge bisection constitutes an efficient scheme for refining a mesh by reducing the obtuse triangles, since the largest interior angles are subdivided. One of these schemes is the four-triangle longest-edge (4T-LE) partition. Moreover, the four triangle self-similar (4T-SS) partition of an acute triangle yields four sub-triangles similar to the original one.

Suggested Citation

  • Padrón, Miguel A. & Suárez, José P. & Plaza, Ángel, 2007. "Refinement based on longest-edge and self-similar four-triangle partitions," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 75(5), pages 251-262.
  • Handle: RePEc:eee:matcom:v:75:y:2007:i:5:p:251-262
    DOI: 10.1016/j.matcom.2006.12.010
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475406003399
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2006.12.010?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Márquez, Alberto & Moreno-González, Auxiliadora & Plaza, Ángel & Suárez, José P., 2014. "There are simple and robust refinements (almost) as good as Delaunay," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 106(C), pages 84-94.
    2. Plaza, Ángel & Márquez, Alberto & Moreno-González, Auxiliadora & Suárez, José P., 2009. "Local refinement based on the 7-triangle longest-edge partition," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 79(8), pages 2444-2457.

    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:eee:matcom:v:75:y:2007:i:5:p:251-262. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.