Comparing Data Structures Used in Divide-and-Conquer Three-Dimensional Voronoi Diagrams

被引：0
|
作者：
Dietsche, Dan [1 ]
Dettling, T. Elise [1 ]
Trefftz, Christian [1 ]
DeVries, Byron [1 ]
机构：
[1] Grand Valley State Univ, Sch Comp, Allendale, MI 49401 USA
来源：
2024 IEEE INTERNATIONAL CONFERENCE ON ELECTRO INFORMATION TECHNOLOGY, EIT 2024 | 2024年
关键词：
Voronoi Diagrams; Divide-and-Conquer; Algorithms;
D O I：
10.1109/eIT60633.2024.10609892
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Voronoi diagrams are used in a wide range of applications, and many of those applications are in three dimensional space. Two important benchmarks you can measure for Voronoi solver algorithms are run time and memory usage. Run time is important due to the potential costs of computation, and memory usage allows for larger areas to be analyzed. Run time can be addressed via parallelization, but memory usage is dependent on data structure. In this paper we compare the run time and memory usage of a previously published 3D Voronoi solver implementation that utilized an array data structure with a new novel implementation that utilizes an oct-tree data structure.
引用
收藏
页码：354 / 358
页数：5
相关论文
共 50 条
  • [1] Divide-and-Conquer for Voronoi Diagrams Revisited
    Aichholzer, Oswin
    Aigner, Wolfgang
    Aurenhammer, Franz
    Hackl, Thomas
    Juettler, Bert
    Pilgerstorfer, Elisabeth
    Rabl, Margot
    PROCEEDINGS OF THE TWENTY-FIFTH ANNUAL SYMPOSIUM ON COMPUTATIONAL GEOMETRY (SCG'09), 2009, : 189 - 197
  • [2] Divide-and-conquer for Voronoi diagrams revisited
    Aichholzer, Oswin
    Aigner, Wolfgang
    Aurenhammer, Franz
    Hackl, Thomas
    Juettler, Bert
    Pilgerstorfer, Elisabeth
    Rabl, Margot
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2010, 43 (08): : 688 - 699
  • [3] A Divide-and-Conquer Algorithm for Computing Voronoi Diagrams
    Smith, Elijah
    Trefftz, Christian
    DeVries, Byron
    2020 IEEE INTERNATIONAL CONFERENCE ON ELECTRO INFORMATION TECHNOLOGY (EIT), 2020, : 495 - 499
  • [4] TOPOLOGY-ORIENTED DIVIDE-AND-CONQUER ALGORITHM FOR VORONOI DIAGRAMS
    OISHI, Y
    SUGIHARA, K
    GRAPHICAL MODELS AND IMAGE PROCESSING, 1995, 57 (04): : 303 - 314
  • [5] Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space
    Setter, Ophir
    Sharir, Micha
    Halperin, Dan
    TRANSACTIONS ON COMPUTATIONAL SCIENCE IX, 2010, 6290 : 1 - 27
  • [6] Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space
    Setter, Ophir
    Sharir, Micha
    Halperin, Dan
    2009 6TH INTERNATIONAL SYMPOSIUM ON VORONOI DIAGRAMS (ISVD 2009), 2009, : 43 - 52
  • [7] Divide-and-conquer on three dimensional meshes
    Mou, Z.G.
    Constantinescu, C.
    Hickey, T.J.
    Proceedings of the European Workshops on Parallel Computing, 1992,
  • [8] A divide-and-conquer approach for analysing overlaid data structures
    Lee, Oukseh
    Yang, Hongseok
    Petersen, Rasmus
    FORMAL METHODS IN SYSTEM DESIGN, 2012, 41 (01) : 4 - 24
  • [9] A divide-and-conquer approach for analysing overlaid data structures
    Oukseh Lee
    Hongseok Yang
    Rasmus Petersen
    Formal Methods in System Design, 2012, 41 : 4 - 24
  • [10] A divide-and-conquer linear scaling three-dimensional fragment method for large scale electronic structure calculations
    Zhao, Zhengji
    Meza, Juan
    Wang, Lin-Wang
    JOURNAL OF PHYSICS-CONDENSED MATTER, 2008, 20 (29)
12345