Combinatorial and Asymptotical Results on the Neighborhood Grid

In various application fields, such as fluid-, cell-, or crowd-simulations, spatial data structures are very important. They answer nearest neighbor queries which are instrumental in performing necessary computations for, e.g., taking the next time step in the simulation. Correspondingly, various su...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2023-10
Main Authors: Skrodzki, Martin, Reitebuch, Ulrich, McDonough, Alex
Format: Article
Language:English
Subjects:
Algorithms
Combinatorial analysis
Data structures
Neighborhoods
Polynomials
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Skrodzki, Martin
Reitebuch, Ulrich
McDonough, Alex
description In various application fields, such as fluid-, cell-, or crowd-simulations, spatial data structures are very important. They answer nearest neighbor queries which are instrumental in performing necessary computations for, e.g., taking the next time step in the simulation. Correspondingly, various such data structures have been developed, one being the \emph{neighborhood grid}. In this paper, we consider combinatorial aspects of this data structure. Particularly, we show that an assumption on uniqueness, made in previous works, is not actually satisfied. We extend the notions of the neighborhood grid to arbitrary grid sizes and dimensions and provide two alternative, correct versions of the proof that was broken by the dissatisfied assumption. Furthermore, we explore both the uniqueness of certain states of the data structure as well as when the number of these states is maximized. We provide a partial classification by using the hook-length formula for rectangular Young tableaux. Finally, we conjecture how to extend this to all 2-dimensional cases.
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2071257263</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2071257263</sourcerecordid><originalsourceid>FETCH-proquest_journals_20712572633</originalsourceid><addsrcrecordid>eNqNirsKwjAUQIMgWLT_EHAupDdN6yZSfEwO4l5SG21Km1tz08G_t4Mf4HTgnLNgEUiZJrsMYMViok4IAXkBSsmI7Uscaut0QG91z7Vr-IE-wxgw2McsboamPhBHx0Nr-NXYV1ujbxEbfva22bDlU_dk4h_XbHs63stLMnp8T4ZC1eHk3ZwqEEUKqoBcyv-uLxPoOMk</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2071257263</pqid></control><display><type>article</type><title>Combinatorial and Asymptotical Results on the Neighborhood Grid</title><source>Publicly Available Content Database (Proquest) (PQ_SDU_P3)</source><creator>Skrodzki, Martin ; Reitebuch, Ulrich ; McDonough, Alex</creator><creatorcontrib>Skrodzki, Martin ; Reitebuch, Ulrich ; McDonough, Alex</creatorcontrib><description>In various application fields, such as fluid-, cell-, or crowd-simulations, spatial data structures are very important. They answer nearest neighbor queries which are instrumental in performing necessary computations for, e.g., taking the next time step in the simulation. Correspondingly, various such data structures have been developed, one being the \emph{neighborhood grid}. In this paper, we consider combinatorial aspects of this data structure. Particularly, we show that an assumption on uniqueness, made in previous works, is not actually satisfied. We extend the notions of the neighborhood grid to arbitrary grid sizes and dimensions and provide two alternative, correct versions of the proof that was broken by the dissatisfied assumption. Furthermore, we explore both the uniqueness of certain states of the data structure as well as when the number of these states is maximized. We provide a partial classification by using the hook-length formula for rectangular Young tableaux. Finally, we conjecture how to extend this to all 2-dimensional cases.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Combinatorial analysis ; Data structures ; Neighborhoods ; Polynomials</subject><ispartof>arXiv.org, 2023-10</ispartof><rights>2023. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2071257263?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>780,784,25751,37010,44588</link.rule.ids></links><search><creatorcontrib>Skrodzki, Martin</creatorcontrib><creatorcontrib>Reitebuch, Ulrich</creatorcontrib><creatorcontrib>McDonough, Alex</creatorcontrib><title>Combinatorial and Asymptotical Results on the Neighborhood Grid</title><title>arXiv.org</title><description>In various application fields, such as fluid-, cell-, or crowd-simulations, spatial data structures are very important. They answer nearest neighbor queries which are instrumental in performing necessary computations for, e.g., taking the next time step in the simulation. Correspondingly, various such data structures have been developed, one being the \emph{neighborhood grid}. In this paper, we consider combinatorial aspects of this data structure. Particularly, we show that an assumption on uniqueness, made in previous works, is not actually satisfied. We extend the notions of the neighborhood grid to arbitrary grid sizes and dimensions and provide two alternative, correct versions of the proof that was broken by the dissatisfied assumption. Furthermore, we explore both the uniqueness of certain states of the data structure as well as when the number of these states is maximized. We provide a partial classification by using the hook-length formula for rectangular Young tableaux. Finally, we conjecture how to extend this to all 2-dimensional cases.</description><subject>Algorithms</subject><subject>Combinatorial analysis</subject><subject>Data structures</subject><subject>Neighborhoods</subject><subject>Polynomials</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNqNirsKwjAUQIMgWLT_EHAupDdN6yZSfEwO4l5SG21Km1tz08G_t4Mf4HTgnLNgEUiZJrsMYMViok4IAXkBSsmI7Uscaut0QG91z7Vr-IE-wxgw2McsboamPhBHx0Nr-NXYV1ujbxEbfva22bDlU_dk4h_XbHs63stLMnp8T4ZC1eHk3ZwqEEUKqoBcyv-uLxPoOMk</recordid><startdate>20231031</startdate><enddate>20231031</enddate><creator>Skrodzki, Martin</creator><creator>Reitebuch, Ulrich</creator><creator>McDonough, Alex</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20231031</creationdate><title>Combinatorial and Asymptotical Results on the Neighborhood Grid</title><author>Skrodzki, Martin ; Reitebuch, Ulrich ; McDonough, Alex</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20712572633</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Combinatorial analysis</topic><topic>Data structures</topic><topic>Neighborhoods</topic><topic>Polynomials</topic><toplevel>online_resources</toplevel><creatorcontrib>Skrodzki, Martin</creatorcontrib><creatorcontrib>Reitebuch, Ulrich</creatorcontrib><creatorcontrib>McDonough, Alex</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>SciTech Premium Collection (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Skrodzki, Martin</au><au>Reitebuch, Ulrich</au><au>McDonough, Alex</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Combinatorial and Asymptotical Results on the Neighborhood Grid</atitle><jtitle>arXiv.org</jtitle><date>2023-10-31</date><risdate>2023</risdate><eissn>2331-8422</eissn><abstract>In various application fields, such as fluid-, cell-, or crowd-simulations, spatial data structures are very important. They answer nearest neighbor queries which are instrumental in performing necessary computations for, e.g., taking the next time step in the simulation. Correspondingly, various such data structures have been developed, one being the \emph{neighborhood grid}. In this paper, we consider combinatorial aspects of this data structure. Particularly, we show that an assumption on uniqueness, made in previous works, is not actually satisfied. We extend the notions of the neighborhood grid to arbitrary grid sizes and dimensions and provide two alternative, correct versions of the proof that was broken by the dissatisfied assumption. Furthermore, we explore both the uniqueness of certain states of the data structure as well as when the number of these states is maximized. We provide a partial classification by using the hook-length formula for rectangular Young tableaux. Finally, we conjecture how to extend this to all 2-dimensional cases.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2023-10
issn 2331-8422
language eng
recordid cdi_proquest_journals_2071257263
source Publicly Available Content Database (Proquest) (PQ_SDU_P3)
subjects Algorithms
Combinatorial analysis
Data structures
Neighborhoods
Polynomials
title Combinatorial and Asymptotical Results on the Neighborhood Grid
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T15%3A21%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Combinatorial%20and%20Asymptotical%20Results%20on%20the%20Neighborhood%20Grid&rft.jtitle=arXiv.org&rft.au=Skrodzki,%20Martin&rft.date=2023-10-31&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2071257263%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_20712572633%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2071257263&rft_id=info:pmid/&rfr_iscdi=true