SIAM Journal on Imaging Sciences · 2019 · 24 citations · 36 references
ComputingComputational EngineeringComputational GeometryPath PlanningRenderingCurve FittingCurve InterpolationCurve ModelingGeometry ProcessingPoint Cloud ProcessingSurface ReconstructionConvergenceCurve ReconstructionOptimal Transport
We propose a fast and scalable algorithm to project a given density on a set of structured measures defined over a compact 2D domain. The measures can be discrete or supported on curves, for instance. The proposed principle and algorithm are a natural generalization of previous results revolving around the generation of blue-noise point distributions, such as Lloyd's algorithm or more advanced techniques based on power diagrams. We analyze the convergence properties and propose new approaches to accelerate the generation of point distributions. We also design new algorithms to project curves onto spaces of curves with bounded length and curvature or speed and acceleration. We illustrate the algorithm's interest through applications in advanced sampling theory, nonphotorealistic rendering, and path planning.
36
Least squares quantization in PCM
Sheelagh Lloyd · IEEE Transactions on Information Theory · 1982 · 15.6K citations · Full text
A fast algorithm for particle simulations
Leslie Greengard, Vladimir Rokhlin · Journal of Computational Physics · 1987 · 4.9K citations
Centroidal Voronoi Tessellations: Applications and Algorithms
Qiang Du, Vance Faber, Max Gunzburger · SIAM Review · 1999 · 2.2K citations
Gradient methods for minimizing composite functions
Yu. Nesterov · Mathematical Programming · 2012 · 1.4K citations
Motion of level sets by mean curvature. I
L. C. Evans, Joel Spruck · Journal of Differential Geometry · 1991 · 1.2K citations · Full text