Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3307363.3307407acmotherconferencesArticle/Chapter ViewAbstractPublication PagesiccmsConference Proceedingsconference-collections
research-article

A Hybrid Point Indexing Structure Based on Orthogonal and Hexagonal Grids

Published: 16 January 2019 Publication History

Abstract

Multidimensional point indexing is an important task in many scientific areas such as computer graphics, image processing, geographic information systems, machine learning and pattern recognition. This paper proposes a novel 2D structure for efficient Fixed-Radius Nearest Neighbors queries. The standard methods are based on the recursive passage of a spatial tree or direct addressing of uniform grid cells with constant size. Each method is good for different type of data. Our algorithm uses space-filling curves to combine the principles of linear uniform grids and hierarchical recursion. Most of the preferred methods are based on the orthogonal grids. We introduce a novel hexagonal hierarchical structure and provide a comparison of both approaches.

References

[1]
Middleton L. and Sivaswamy J. 2006. Hexagonal image processing: A practical approach, ser. Advances in Computer Vision and Pattern Recognition. Springer London.
[2]
Pharr M., Jakob W., and G. Humphreys 2016. Physically based rendering: From theory to implementation. Morgan Kaufmann.
[3]
Sahr K. 2013. On the optimal representation of vector location using fixed-width multi-precision quantizers. ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, XL-4/W2, (2013), 1--8.
[4]
Samet, H. 2005. Foundations of multidimensional and metric data structures. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA.
[5]
Sonka M., Hlavác V., and Boyle R. 2014. Image processing, analysis, and machine vision. Cengage Learning.
[6]
Zhu Y., Wang Z., and Gao D. 2015. Gravitational fixed radius nearest neighbor for imbalanced problem. Knowledge-Based Systems, 90, (2015), 224--238.
[7]
Gargantini I. 1982. An effective way to represent quadtrees. Commun. ACM, 25, 12, (Dec. 1982), 905--910.
[8]
Franklin W. R. 2005. Nearest point query on 184m points in E3 with a uniform grid. In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), (Canada, 2005), 239--242.
[9]
Bader M. 2012. Space-Filling Curves: An introduction with applications in scientific computing. Springer Publishing Company, Incorporated.
[10]
Uher V., Gajdoš P., and Snášel V. 2016. Searching of circular neighborhoods in the square and hexagonal regular grids. In The Euro-China Conference on Intelligent Data Analysis and Applications, (2016), Springer, 121--129.
[11]
Hales T. C. 2001. The Honeycomb conjecture. Discrete & Computational Geometry, 25, 1, (2001), 1--22.
[12]
Haverkort H. J. 2011. Recursive tilings and space-filling curves with little fragmentation. Journal of Computational Geometry, 2, 1, (2011), 92--127.
[13]
Uher V., Gajdoš P., and Snášel V. 2017. Towards the Gosper space filling curve implementation. In 2017 3rd IEEE International Conference on Cybernetics (CYBCONF) (June 2017), IEEE, 1--8.
[14]
Burt P. J. 1980. Tree and pyramid structures for coding hexagonally sampled binary images. Computer Graphics and Image Processing, 14, 3, (1980), 271--280.
[15]
Gibson L. and Lucas D. 1982. Vectorization of raster images using hierarchical methods. Computer Graphics and Image Processing, 20, 1, (1982), 82--89.
[16]
Gardner M. 1976. Mathematical games - In which "monster" curves force redefinition of the word "curve". Scientific American, 235, 6, (1976), 124--133.
[17]
Fränti P. 2018. Clustering basic benchmark. Online, (Sep 2018), URL= https://cs.joensuu.fi/sipu/datasets/.
[18]
Rusu R. B. and Cousins S. 2011. 3D is here: Point Cloud Library (PCL). In 2011 IEEE International Conference on Robotics and Automation (May 2011), IEEE, 1--4.
[19]
Muja M. and Lowe D. G. 2014. Scalable nearest neighbor algorithms for high dimensional data. IEEE Transactions on Pattern Analysis and Machine Intelligence, 36, 11, (2014), 2227--2240.

Cited By

View all
  • (2024)A Study on Cell-Based Algorithms for Nearest-Neighbor Search between Hexagonal ClustersJournal of Advances in Information Technology10.12720/jait.15.12.1339-135415:12(1339-1354)Online publication date: 2024

Index Terms

  1. A Hybrid Point Indexing Structure Based on Orthogonal and Hexagonal Grids

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    ICCMS '19: Proceedings of the 11th International Conference on Computer Modeling and Simulation
    January 2019
    253 pages
    ISBN:9781450366199
    DOI:10.1145/3307363
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    In-Cooperation

    • University of Wollongong, Australia
    • College of Technology Management, National Tsing Hua University, Taiwan
    • Swinburne University of Technology
    • University of Technology Sydney

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 16 January 2019

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. FRNN
    2. Node-Gosper
    3. Space-filling curve
    4. Z-order
    5. hexagonal tree
    6. point clustering
    7. regular grid

    Qualifiers

    • Research-article
    • Research
    • Refereed limited

    Conference

    ICCMS 2019
    ICCMS 2019: The 11th International Conference on Computer Modeling and Simulation
    January 16 - 19, 2019
    QLD, North Rockhampton, Australia

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)8
    • Downloads (Last 6 weeks)2
    Reflects downloads up to 15 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)A Study on Cell-Based Algorithms for Nearest-Neighbor Search between Hexagonal ClustersJournal of Advances in Information Technology10.12720/jait.15.12.1339-135415:12(1339-1354)Online publication date: 2024

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media