Towards uniform online spherical tessellations
DOI10.1007/s00454-022-00384-xOpenAlexW2894754392MaRDI QIDQ5918678
Publication date: 16 May 2022
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-022-00384-x
online algorithmsdiscrepancy theorycomputational geometryspherical trigonometryuniform point placement
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Irregularities of distribution, discrepancy (11K38) Online algorithms; streaming algorithms (68W27) Combinatorial complexity of geometric structures (52C45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of the covering radius problem
- Reachability problems in quaternion matrix and rotation semigroups
- Online uniformity of integer points on a line
- On a new method for constructing good point sets on spheres
- Distributing many points on a sphere
- Mathematical problems for the next century
- Minimal discrete energy on the sphere
- Minimal-energy clusters of hard spheres
- Uniformly inserting points on square grid
- Online uniformly inserting points on the sphere
- Distributing many points on spheres: minimal energy and designs
- Spherical basis functions and uniform distribution of points on spheres
- Mesh ratios for best-packing and limits of minimal energy configurations
- Spherical cap discrepancy of the diamond ensemble
- Online Inserting Points Uniformly on the Sphere
- Hecke operators and distributing points on the sphere I
- Geometric discrepancy. An illustrated guide
- Towards uniform online spherical tessellations
This page was built for publication: Towards uniform online spherical tessellations
