Voronoi-guided greedy packing generates point sets on arbitrary triangles with mesh ratio bounded by the optimal value 2 and proves uniform boundedness for two existing low-discrepancy sets.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Constructive quasi-uniform sequences over triangles
Voronoi-guided greedy packing generates point sets on arbitrary triangles with mesh ratio bounded by the optimal value 2 and proves uniform boundedness for two existing low-discrepancy sets.