Dart throwing on surfaces

ABSTRACT

In this paper we present dart throwing algorithms to generate maximal Poisson disk point sets directly on 3D surfaces. We optimize dart throwing by efficiently excluding areas of the domain that are already covered by existing darts. In the case of triangle meshes, our algorithm shows dramatic speed improvement over comparable sampling methods. The simplicity of our basic algorithm naturally extends to the sampling of other surface types, including spheres, NURBS, subdivision surfaces, and implicits. We further extend the method to handle variable density points, and the placement of arbitrary ellipsoids without overlap. Finally, we demonstrate how to adapt our algorithm to work with geodesic instead of Euclidean distance. Applications for our method include fur modeling, the placement of mosaic tiles and polygon remeshing.

References

1. ALLIEZ P., ÉRIC COLIN DE VERDIÈRE, DEVILLERS O., ISENBURG M.: Isotropic surface remeshing. In Shape Modeling Intl. 2003 (2003), p. 49. 2
2. BRIDSON R.: Fast Poisson disk sampling in arbitrary dimensions. ACM SIGGRAPH 2007 sketches (2007). 2
3. COOK R. L.: Stochastic sampling in computer graphics. ACM Trans. Graph. 5, 1 (1986), 51-72. 1
4. COHEN M. F., SHADE J., HILLER S., DEUSSEN O.: Wang tiles for image and texture generation. ACM Trans. Graph. (SIGGRAPH 2003) 22, 3 (2003), 287-294. 1
5. DEY T. K., GOSWAMI S.: Tight cocone: a watertight surface reconstructor. In ACM symposium on Solid modeling and applications (2003), pp. 127-134. 10
6. DUNBAR D., HUMPHREYS G.: A spatial data structure for fast poisson-disk sample generation. ACM Trans. Graph. (SIGGRAPH 2006) 25, 3 (2006), 503-508. 2
7. FENG L., HOTZ I., HAMANN B., JOY K.: Anisotropic noise samples. IEEE Trans. on Visualization and Computer Graphics 14, 2 (2008), 342-354. 2
8. FU Y., ZHOU B.: Direct sampling on surfaces for high quality remeshing. In ACM symposium on solid and physical modeling (2008), pp. 115-124. 2, 8, 9
9. JONES T. R.: Efficient generation of poisson-disk sampling patterns. J. of Graphics Tools 11, 2 (2006), 27-36. 2
10. KOPF J., COHEN-OR D., DEUSSEN O., LISCHINSKI D.: Recursive wang tiles for real-time blue noise. ACM Trans. Graph. (SIGGRAPH 2006) 25, 3 (2006), 509-518. 2
11. KIMMEL R., SETHIAN J.: Computing geodesic paths on manifolds. Proceedings of National Academy of Sciences, USA, 95(15): 8431-8435. (1998). 2
12. LI H., LO K.-Y., LEUNG M.-K., FU C.-W.: Dual poisson-disk tiling: An efficient method for distributing features on arbitrary surfaces. IEEE Trans. on Visualization and Computer Graphics 14, 5 (2008), 982-998. 2, 8
13. LLOYD S. P.: Least squares quantization in pcm. IEEE Trans. on Information Theory, 2 (1987), 129-137. 1
14. LEE C. H., VARSHNEY A., JACOBS D. W.: Mesh saliency. In ACM Trans. Graph. (SIGGRAPH 2005) (2005), vol. 24(3), pp. 659-666. 9
15. MITCHELL D. P.: Spectrally optimal sampling for distribution ray tracing. Computer Graphics (Proceedings of SIGGRAPH '91) 25, 4 (1991), 157-164. 1
16. MITCHELL J. S. B., MOUNT D. M., PAPADIMITRIOU C. H.: The discrete geodesic problem. SIAM J. Comput. 16, 4 (1987), 647-668. 2
17. NEHAB D., SHILANE P.: Stratified point sampling of 3D models. In Eurographics Symposium on Point-Based Graphics (June 2004), pp. 49-56. 2, 3
18. OSTROMOUKHOV V., DONOHUE C., JODOIN P.-M.: Fast hierarchical importance sampling with blue noise properties. ACM Trans. Graph. 23, 3 (2004), 488-495. 2
19. OSTROMOUKHOV V.: Sampling with polyominoes. ACM Trans. Graph. (SIGGRAPH 2007) 26, 3 (2007), 78-83. 2
20. PEYRÉ G., COHEN L.: Geodesic remeshing using front propagation. Int. J. Comput. Vision 69, 1 (2006), 145-156. 2
21. ROVIRA J., WONKA P., CASTRO F., SBERT M.: Point sampling with uniformly distributed lines. In Eurographics Symposium on Point-Based Graphics (2005), pp. 109-118. 2
22. SURAZHSKY V., ALLIEZ P., GOTSMAN C.: Isotropic remeshing of surfaces: a local parameterization approach. In Meshing Roundtable (2003), pp. 215-224. 2
23. SETHIAN J. A.: A fast marching level set method for monotonically advancing fronts. In Proc. Nat. Acad. Sci (1996), pp. 1591-1595. 2, 7
24. SURAZHSKY V., SURAZHSKY T., KIRSANOV D., GORTLER S. J., HOPPE H.: Fast exact and approximate geodesics on meshes. In ACM Trans. Graph. (SIGGRAPH 2005) (2005), pp. 553-560. 2
25. SETHIAN J., VLADIMIRSKY A.: Ordered Upwind Methods for Static Hamiltonian-Jacobi Equations. Proceedings of the National Academy of Sciences of the United States of America 98, 20 (2001), 11069-11074. 2
26. TURK G.: Re-tiling polygonal surfaces. Computer Graphics (Proceedings of SIGGRAPH '92) 26, 2 (1992), 55-64. 1, 2, 3, 9
27. WANG W., CHOI Y.-K., CHAN B., KIM M.-S., WANG J.: Efficient collision detection for moving ellipsoids using separating planes. Computing 72, 1-2 (2004), 235-246. 5
28. WHITE K. B., CLINE D., EGBERT P. K.: Poisson disk point sets by hierarchical dart throwing. In IEEE / EG Symposium on Interactive Ray Tracing 2007 (2007), pp. 129-132. 2, 3, 5
29. WEBER O., DEVIR Y. S., BRONSTEIN A. M., BRONSTEIN M. M., KIMMEL R.: Parallel algorithms for approximation of distance maps on parametric surfaces. ACM Trans. Graph. 27, 4 (2008), 1-16. 2, 7
30. WEI L.-Y.: Parallel poisson disk sampling. In ACM Trans. Graph. (SIGGRAPH 2008) (2008), pp. 1-9. 2
31. WITKIN A., HECKBERT P.: Using particles to sample and control implicit surfaces. In Int. Conf. on Computer Graphics and Interactive Techniques (2005), pp. 269-277. 2
32. WU X., PETERS J.: Interference detection for subdivision surfaces. Computer Graphics Forum: Proceedings of Eurographics 2004 23, 3 (2004), 577-584. 5
33. WANG W., WANG J., KIM M.-S.: An algebraic condition for the separation of two ellipsoids. Comput. Aided Geom. Des. 18, 6 (2001), 531-539. 5, 6

Index Terms

• Computing methodologies

  • Computer graphics

    • Shape modeling

      • Parametric curve and surface models

      • Volumetric models

• Theory of computation

  • Randomness, geometry and discrete structures