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

Equivalence, Partial Order and Lattice of Neighborhood Sequences on the Triangular Grid

Author

Listed:
  • Benedek Nagy

    (Department of Mathematics, Faculty of Arts and Sciences, Eastern Mediterranean University, North Cyprus, Mersin-10, Famagusta 99450, Turkey
    Some parts of the paper were written during a research leave of absence at Faculty of Informatics, Eszterházy Károly Catholic University, 3300 Eger, Hungary.)

Abstract

In (digital) grids, neighbor relation is a crucial concept; digital distances are based on paths through neighbor points. Digital distances are significant, e.g., in digital image processing for giving an approximation of the Euclidean distance and allowing incremental algorithms on images. Neighborhood sequences (i.e., infinite sequences of the possible types of neighbors) are defining digital distances with a lower rotational dependency than the distances based only on a sole neighborhood. They allow one to change the used neighborhood condition in every step along a path. They are defined in various grids, and they can be periodic. Generalized neighborhood sequences do not need to be periodic. In this paper, the triangular grid is studied. An equivalence and two partial order relations on the set of generalized and periodic neighborhood sequences are shown on this grid. The first partial order, the “faster” relation, is based on distances defined by neighborhood sequences, and it does not provide a lattice but gives a relatively complex relation for neighborhood sequences with a short period. The other partial order, the relation “componentwise dominate”, defines a complete distributive lattice on the set of generalized neighborhood sequences. Finally, a relation of the above-mentioned relations is established. Important differences regarding the cases of the square and triangular grids are also highlighted.

Suggested Citation

  • Benedek Nagy, 2022. "Equivalence, Partial Order and Lattice of Neighborhood Sequences on the Triangular Grid," Mathematics, MDPI, vol. 10(23), pages 1-21, November.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:23:p:4514-:d:988187
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/23/4514/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/23/4514/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Nagy, B., 2002. "Metrics based on neighbourhood sequences in triangular grids," Pure Mathematics and Applications, Department of Mathematics, Corvinus University of Budapest, vol. 13(1-2), pages 259-274.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Benedek Nagy & Bashar Khassawneh, 2020. "On the Number of Shortest Weighted Paths in a Triangular Grid," Mathematics, MDPI, vol. 8(1), pages 1-16, January.

    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:10:y:2022:i:23:p:4514-:d:988187. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.