Blue noise through optimal transport

ACM Transactions on Graphics

Volumn 31, Issue 6, 2012, Pages

  De Goes, Fernando ^a   Breeden, Katherine ^b   Ostromoukhov, Victor ^c   Desbrun, Mathieu ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b Stanford ^*  (United States)

^c UNIVERSITÉ LYON 1   (France)

Author keywords

Blue noise; Capacity constraints; Power diagram

Indexed keywords

BLUE NOISE; CAPACITY CONSTRAINTS; CONSTRAINED MINIMIZATION; HIGH QUALITY; OPTIMAL TRANSPORT; OPTIMIZATION TECHNIQUES; POINT SET; POWER DIAGRAMS; SCALABLE ALGORITHMS; SPATIAL PROPERTIES; VORONOI TESSELLATIONS;

ALGORITHMS;

CONSTRAINED OPTIMIZATION;

EID: 84870190254     PISSN: 07300301     EISSN: 15577368     Source Type: Journal    
DOI: 10.1145/2366145.2366190     Document Type: Conference Paper

References (55)

1. AURENHAMMER, F., HOFFMANN, F., AND ARONOV, B. 1998. Minkowski-type theorems and least-squares clustering. Algorithmica 20, 1, 61-76.
2. BALZER, M., AND HECK, D. 2008. Capacity-constrained Voronoi diagrams in finite spaces. In Int. Symp. on Voronoi Diag., 44-56.
3. BALZER, M., DEUSSEN, O., AND LEWERENTZ, C. 2005. Voronoi treemaps for the visualization of software metrics. In Symp. on Software Visualization, ACM, 165-172.
4. BALZER, M., SCHLÖMER, T., AND DEUSSEN, O. 2009. Capacityconstrained point distributions: A variant of Lloyd's method. ACM Trans. Graph. (SIGGRAPH) 28, 3, 86:1-8.
5. BALZER, M. 2009. Capacity-constrained Voronoi diagrams in continuous spaces. In Int. Symp. on Voronoi Diagrams, 79-88.
6. BONNEEL, N., VAN DE PANNE, M., PARIS, S., AND HEIDRICH, W. 2011. Displacement interpolation using Lagrangian mass transport. ACM Trans. Graph. (SIGGRAPH ASIA) 30, 6.
7. BOWERS, J., WANG, R., WEI, L.-Y., AND MALETZ, D. 2010. Parallel Poisson disk sampling with spectrum analysis on surfaces. ACM Trans. Graph. 29 (Dec.), 166:1-166:10.
8. BRIDSON, R. 2007. Fast Poisson disk sampling in arbitrary dimensions. In ACM SIGGRAPH sketches.
9. CGAL, 2010. Computational Geometry Algorithms Library (release 3.8). http://www.cgal.org.
10. CHEN, Z., YUAN, Z., CHOI, Y.-K., LIU, L., AND WANG, W. 2012. Variational blue noise sampling. IEEE Trans. Vis. Comput. Graphics 18, 10, 1784-1796.
11. COHEN, M. F., SHADE, J., HILLER, S., AND DEUSSEN, O. 2003. Wang tiles for image and texture generation. In ACM SIGGRAPH, 287-294.
12. COOK, R. L. 1986. Stochastic sampling in computer graphics. ACM Trans. Graph. 5, 1, 51-72.
13. CROW, F. C. 1977. The aliasing problem in computer-generated shaded images. Commun. ACM 20, 11, 799-805.
14. DAVIS, T. A. 2011. Algorithm 915, SuiteSparseQR: Multifrontal multithreaded rank-revealing sparse QR factorization. ACM Trans. Math. Softw. 38 (Dec.), 8:1-8:22.
15. DE GOES, F., COHEN-STEINER, D., ALLIEZ, P., AND DESBRUN, M. 2011. An optimal transport approach to robust reconstruction and simplification of 2d shapes. Computer Graphics Forum 30, 5, 1593-1602.
16. DEUSSEN, O., HILLER, S., OVERVELD, C., AND STROTHOTTE, T. 2000. Floating points: A method for computing stipple drawings. Computer Graphics Forum (EG'00) 19, 3, 40-51.
17. DIPPÉ, M. A. Z., AND WOLD, E. H. 1985. Antialiasing through stochastic sampling. In ACM SIGGRAPH, 69-78.
18. DU, Q., FABER, V., AND GUNZBURGER, M. 1999. Centroidal Voronoi Tessellations: Applications and algorithms. SIAM Rev. 41 (Dec.), 637-676.
19. DUNBAR, D., AND HUMPHREYS, G. 2006. A spatial data structure for fast Poisson-disk sample generation. ACM Trans. Graph. 25, 3 (July), 503-508.
20. EBEIDA, M. S., DAVIDSON, A. A., PATNEY, A., KNUPP, P. M., MITCHELL, S. A., AND OWENS, J. D. 2011. Efficient maximal Poisson-disk sampling. ACM Trans. Graph. 30 (Aug.), 49:1- 49:12.
21. FATTAL, R. 2011. Blue-noise point sampling using kernel density model. ACM Trans. Graph. (SIGGRAPH) 30, 3, 48:1-48:12.
22. FLOYD, R. W., AND STEINBERG, L. 1976. An adaptive algorithm for spatial grey scale. Proc. Soc. Inf. Display 17, 75-77.
23. GAMITO, M. N., AND MADDOCK, S. C. 2009. Accurate multidimensional Poisson-disk sampling. ACM Trans. Graph. 29, 8:1-8:19.
24. JONES, T. R. 2006. Efficient generation of Poisson-disk sampling patterns. Journal of Graphics, GPU, & Game Tools 11, 2, 27-36.
25. KOPF, J., COHEN-OR, D., DEUSSEN, O., AND LISCHINSKI, D. 2006. Recursive Wang tiles for real-time blue noise. ACM Trans. Graph. 25, 3, 509-518.
26. LAGAE, A., AND DUTRÉ, P. 2006. An Alternative for Wang Tiles: Colored Edges versus Colored Corners. ACM Trans. Graph., 25, 4, 1442-1459.
27. LAGAE, A., AND DUTRÉ, P. 2008. A comparison of methods for generating Poisson disk distributions. Computer Graphics Forum 27, 1, 114-129.
28. LECOT, G., AND LÉVY, B. 2006. ARDECO: Automatic Region DEtection and COnversion. In EG Symp. on Rendering, 349-360.
29. LEMIEUX, C. 2009. Monte Carlo and Quasi Monte Carlo Sampling. Springer.
30. LI, H., NEHAB, D., WEI, L.-Y., SANDER, P., AND FU, C.-W. 2010. Fast capacity constrained Voronoi tessellation. In Symp. on Interactive 3D Graphics & Games, 13:1-13:4.
31. LI, H., WEI, L.-Y., SANDER, P. V., AND FU, C.-W. 2010. Anisotropic blue noise sampling. ACM Trans. Graph. (SIGGRAPH Asia) 29 (Dec.), 167:1-167:12.
32. LIU, Y., WANG, W., LÉVY, B., SUN, F., YAN, D., LU, L., AND YANG, C. 2009. On Centroidal Voronoi Tessellation-energy smoothness and fast computation. ACM Trans. Graph. 28, 4.
33. LLOYD, S. 1982. Least squares quantization in PCM. Information Theory, IEEE Transactions on 28, 2 (Mar.), 129-137.
34. LUCARINI, V. 2009. Symmetry-break in Voronoi tessellations. Symmetry 1, 1, 21-54.
35. MCCOOL, M., AND FIUME, E. 1992. Hierarchical Poisson disk sampling distributions. In Proc. Graphics Interface '92, 94-105.
36. MITCHELL, D. P. 1987. Generating antialiased images at low sampling densities. In ACM SIGGRAPH, 65-72.
37. MULLEN, P., MEMARI, P., DE GOES, F., AND DESBRUN, M. 2011. HOT: Hodge Optimized Triangulations. ACM Trans. Graph. (SIGGRAPH) 30, 3.
38. NIEDERREITER, H. 1992. Random Number Generation and Quasi- Monte-Carlo Methods. SIAM.
39. NOCEDAL, J., AND WRIGHT, S. J. 1999. Numerical optimization. Springer Verlag.
40. OSTROMOUKHOV, V., DONOHUE, C., AND JODOIN, P.-M. 2004. Fast hierarchical importance sampling with blue noise properties. ACM Trans. Graph. 23, 3, 488-495.
41. OSTROMOUKHOV, V. 2007. Sampling with polyominoes. ACM Trans. Graph. 26, 3, 78:1-78:6.
42. SCHLÖMER, T., AND DEUSSEN, O. 2011. Accurate spectral analysis of two-dimensional point sets. Journal of Graphics, GPU, and Game Tools 15, 3, 152-160.
43. SCHLÖMER, T., HECK, D., AND DEUSSEN, O. 2011. Farthestpoint optimized point sets with maximized minimum distance. In Symp. on High Performance Graphics, 135-142.
44. SCHMALTZ, C., GWOSDEK, P., BRUHN, A., AND WEICKERT, J. 2010. Electrostatic halftoning. Comput. Graph. Forum 29, 8, 2313-2327.
45. SECORD, A. 2002. Weighted Voronoi stippling. In Symp. on Non-Photorealistic Animation and Rendering, 37-43.
46. ULICHNEY, R. 1987. Digital Halftoning. MIT Press.
47. VILLANI, C. 2009. Optimal Transport: Old and New. Fundamental Principles of Mathematical Sciences, 338. Springer-Verlag.
48. WEI, L.-Y., AND WANG, R. 2011. Differential domain analysis for non-uniform sampling. ACM Trans. Graph. 30 (Aug.), 50:1- 50:10.
49. WEI, L.-Y. 2008. Parallel Poisson disk sampling. ACM Trans. Graph. (SIGGRAPH) 27 (August), 20:1-20:9.
50. WEI, L.-Y. 2010. Multi-class blue noise sampling. ACM Trans. Graph. (SIGGRAPH) 29 (July), 79:1-79:8.
51. XIANG, Y., XIN, S.-Q., SUN, Q., AND HE, Y. 2011. Parallel and accurate Poisson disk sampling on arbitrary surfaces. In SIGGRAPH Asia Sketches, 18:1-18:2.
52. XU, Y., LIU, L., GOTSMAN, C., AND GORTLER, S. J. 2011. Capacity-constrained Delaunay triangulation for point distributions. Comput. Graph. 35, 510-516.
53. XU, Y., HU, R., GOTSMAN, C., AND LIU, L. 2012. Blue noise sampling of surfaces. Comput. Graph. 36, 232-240.
54. YELLOTT, J. I. J. 1983. Spectral consequences of photoreceptor sampling in the rhesus retina. Science 221, 382-385.
55. ZHOU, Y., HUANG, H., WEI, L.-Y., AND WANG, R. 2012. Point sampling with general noise spectrum. ACM Trans. Graph. (SIGGRAPH) 31, 4, 76:1-76:11.