
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Anders Brodersen, Ken Museth, Serban Porumbescu, Brian Budge, "Geometric Texturing Using Level Sets," IEEE Transactions on Visualization and Computer Graphics, vol. 14, no. 2, pp. 277288, March/April, 2008.  
BibTex  x  
@article{ 10.1109/TVCG.2007.70408, author = {Anders Brodersen and Ken Museth and Serban Porumbescu and Brian Budge}, title = {Geometric Texturing Using Level Sets}, journal ={IEEE Transactions on Visualization and Computer Graphics}, volume = {14}, number = {2}, issn = {10772626}, year = {2008}, pages = {277288}, doi = {http://doi.ieeecomputersociety.org/10.1109/TVCG.2007.70408}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Visualization and Computer Graphics TI  Geometric Texturing Using Level Sets IS  2 SN  10772626 SP277 EP288 EPD  277288 A1  Anders Brodersen, A1  Ken Museth, A1  Serban Porumbescu, A1  Brian Budge, PY  2008 KW  Geometric texture mapping KW  parameterization KW  implicit surfaces KW  volume texturing KW  geometric modeling VL  14 JA  IEEE Transactions on Visualization and Computer Graphics ER   
Abstract—We present techniques for warping and blending (or subtracting) geometric textures onto surfaces represented by high resolution level sets. The geometric texture itself can be represented either explicitly as a polygonal mesh or implicitly as a level set. Unlike previous approaches, we can produce topologically connected surfaces with smooth blending and low distortion. Specifically, we offer two different solutions to the problem of adding finescale geometric detail to surfaces. Both solutions assume a level set representation of the base surface which is easily achieved by means of a meshtolevelset scan conversion. To facilitate our mapping, we parameterize the embedding space of the base level set surface using fast particle advection. We can then warp explicit texture meshes onto this surface at nearly interactive speeds or blend level set representations of the texture to produce highquality surfaces with smooth transitions.
[1] J.F. Blinn and M.E. Newell, “Texture and Reflection in Computer Generated Images,” ACM Comm., vol. 19, no. 10, pp. 542547, 1976.
[2] J.F. Blinn, “Simulation of Wrinkled Surfaces,” Proc. ACM SIGGRAPH '78, pp. 286292, 1978.
[3] R.L. Cook, “Shade Trees,” Proc. ACM SIGGRAPH '84, pp. 223231, 1984.
[4] J.T. Kajiya and T.L. Kay, “Rendering Fur with Three Dimensional Textures,” Proc. ACM SIGGRAPH '89, vol. 23, no. 3, pp. 271280, July 1989.
[5] Y. Chen, X. Tong, J. Wang, S. Lin, B. Guo, and H.Y. Shum, “Shell Texture Functions,” ACM Trans. Graphics, vol. 23, no. 3, pp. 343353, Aug. 2004.
[6] X. Wang, X. Tong, S. Lin, S. Hu, B. Guo, and H.Y. Shum, “Generalized Displacement Maps,” Proc. Eurographics Symp. Rendering, pp. 227233, 2004.
[7] P. Bhat, S. Ingram, and G. Turk, “Geometric Texture Synthesis by Example,” Proc. Eurographics/ACM SIGGRAPH Symp. Geometry Processing (SGP '04), pp. 4144, 2004.
[8] S.D. Porumbescu, B.C. Budge, L. Feng, and K.I. Joy, “Shell Maps,” Proc. ACM SIGGRAPH '05, vol. 24, no. 3, pp. 626633, 2005.
[9] M.B. Nielsen and K. Museth, “Dynamic Tubular Grid: An Efficient Data Structure and Algorithms for High Resolution Level Sets,” J.Scientific Computing, vol. 26, no. 3, pp. 261299, 2006.
[10] S. Osher and J.A. Sethian, “Fronts Propagating with CurvatureDependent Speed: Algorithms Based on HamiltonJacobi Formulations,” J. Computational Physics, vol. 79, pp. 1249, 1988.
[11] J.A. Sethian, Level Set Methods and Fast Marching Methods, second ed. Cambridge Univ. Press, 1999.
[12] S. Osher and R. Fedkiw, Level Set Methods and Dynamic Implicit Surfaces. Springer, 2002.
[13] K. Museth, D. Breen, R. Whitaker, and A. Barr, “Level Set Surface Editing Operators,” Proc. ACM SIGGRAPH '02 (ACM Trans. Graphics), vol. 21, no. 3, pp. 330338, July 2002.
[14] S. Mauch, “Efficient Algorithms for Solving Static HamiltonJacobi Equations,” PhD dissertation, California Inst. of Tech nology, 2003.
[15] W.E. Lorensen and H.E. Cline, “Marching Cubes: A High Resolution 3D Surface Construction Algorithm,” Computer Graphics, vol. 21, no. 4, pp. 163168, July 1987.
[16] F. Losasso, F. Gibou, and R. Fedkiw, “Simulating Water and Smoke with an Octree Data Structure,” ACM Trans. Graphics, vol. 23, no. 3, Aug. 2004.
[17] B. Houston, M. Nielsen, C. Batty, O. Nilsson, and K. Museth, “Hierarchical RLE Level Set: A Compact and Versatile Deformable Surface Representation,” ACM Trans. Graphics, vol. 25, no. 1, pp. 124, 2006.
[18] S.F. Frisken, R.N. Perry, A.P. Rockwood, and T.R. Jones, “Adaptively Sampled Distance Fields: A General Representation of Shape for Computer Graphics,” Proc. ACM SIGGRAPH '00, pp.249254, 2000.
[19] G. Turk, “Texture Synthesis on Surfaces,” Proc. ACM SIGGRAPH '01, pp. 347354, 2001.
[20] M. Tarini, K. Hormann, P. Cignoni, and C. Montani, “PolycubeMaps,” ACM Trans. Graphics, vol. 23, no. 3, pp. 853860, 2004.
[21] R. Zonenschein, J. Gomes, L. Velho, L. de Figueiredo, M. Tigges, and B. Wyvill, “Texturing Composite Deformable Implicit Objects,” Proc. Int'l Symp. Computer Graphics, Image Processing, and Vision (SIBGRAPHI '98), p. 346, 1998.
[22] R. Zonenschein, J. Gomes, L. Velho, and L. de Figueiredo, “Controlling Texture Mapping onto Implicit Surfaces with Particle Systems,” Proc. Third Int'l Workshop Implicit Surfaces, pp. 131138, 1998.
[23] H.K. Pedersen, “Decorating Implicit Surfaces,” Proc. ACM SIGGRAPH '95, pp. 291300, 1995.
[24] R. Schmidt, C. Grimm, and B. Wyvill, “Interactive Decal Compositing with Discrete Exponential Maps,” ACM Trans. Graphics, vol. 25, no. 3, pp. 605613, 2006.
[25] F. Neyret, “Modeling, Animating, and Rendering Complex Scenes Using Volumetric Textures,” IEEE Trans. Visualization and Computer Graphics, vol. 4, no. 1, pp. 5570, Jan.Mar. 1998.
[26] J. Peng, D. Kristjansson, and D. Zorin, “Interactive Modeling of Topologically Complex Geometric Detail,” ACM Trans. Graphics, vol. 23, no. 3, pp. 635643, 2004.
[27] K.W. Fleischer, D.H. Laidlaw, B.L. Currin, and A.H. Barr, “Cellular Texture Generation,” Proc. ACM SIGGRAPH '95, pp.239248, 1995.
[28] X. Provot, “Deformation Constraints in a MassSpring Model to Describe Rigid Cloth Behavior,” Proc. Graphics Interface Conf. (GI'95), pp. 147154, 1995.
[29] S. Hadap, D. Eberle, P. Volino, M.C. Lin, S. Redon, and C. Ericson, “Collision Detection and Proximity Queries,” Proc. ACM SIGGRAPH '04, p. 15, 2004.
[30] H. Zhao, “Fast Sweeping Method for Eikonal Equations,” Math. of Computation, vol. 74, pp. 603627, 2004.
[31] T.W. Sederberg and S.R. Parry, “FreeForm Deformation of Solid Geometric Models,” Proc. ACM SIGGRAPH '86, vol. 20, no. 4, pp.151160, 1986.
[32] H.Q. Dinh, G. Turk, and G. Slabaugh, “Reconstructing Surfaces by Volumetric Regularization Using Radial Basis Functions,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 10, pp.13581371, Oct. 2002.
[33] S. Worley, “A Cellular Texture Basis Function,” Proc. ACM SIGGRAPH '96, pp. 291294, 1996.
[34] K. Zhou, X. Huang, X. Wang, Y. Tong, M. Desbrun, B. Guo, and H.Y. Shum, “Mesh Quilting for Geometric Texture Synthesis,” ACM Trans. Graphics, vol. 25, no. 3, pp. 690697, 2006.