Stümmel, MarvinBrüll, FelixGrosch, ThorstenBender, JanBotsch, MarioKeim, Daniel A.2022-09-262022-09-262022978-3-03868-189-2https://doi.org/10.2312/vmv.20221202https://diglib.eg.org:443/handle/10.2312/vmv20221202We propose a novel implementation of a parallel priority queue in the context of multithreaded mesh decimation. Previous parallel priority queues either have a major bottleneck when extracting nodes, cannot guarantee reasonable node quality for the extracted nodes, or cannot be used for mesh decimation. Our data structure allows the extraction of multiple high-priority elements at the same time. For this, we relax the requirement of returning the highest priority element to returning an element that belongs to the top k elements. We demonstrate its use in the context of parallel mesh decimation and show that our decimated mesh is almost indistinguishable from an optimally decimated mesh while being 2 to 2.6 times faster than a naive parallel priority queue implementation.Attribution 4.0 International LicenseCCS Concepts: Computing methodologies --> Mesh models; Parallel algorithmsComputing methodologiesMesh modelsParallel algorithms10.2312/vmv.2022120241-488 pages