$hp$-Adaptive Discretization Algorithm for Signed Distance Field Generation | IEEE Transactions on Visualization and Computer Graphics"/>
Nothing Special   »   [go: up one dir, main page]

skip to main content
research-article

An <inline-formula><tex-math notation="LaTeX">$hp$</tex-math><alternatives><inline-graphic xlink:href="koschier-ieq1-2730202.gif"/></alternatives></inline-formula>-Adaptive Discretization Algorithm for Signed Distance Field Generation

Published: 01 October 2017 Publication History

Abstract

In this paper we present an <inline-formula><tex-math notation="LaTeX">$hp$</tex-math><alternatives><inline-graphic xlink:href="koschier-ieq2-2730202.gif"/></alternatives></inline-formula>-adaptive algorithm to generate discrete higher-order polynomial Signed Distance Fields (SDFs) on axis-aligned hexahedral grids from manifold polygonal input meshes. Using an orthonormal polynomial basis, we efficiently fit the polynomials to the underlying signed distance function on each cell. The proposed error-driven construction algorithm is globally adaptive and iteratively refines the SDFs using either spatial subdivision (<inline-formula><tex-math notation="LaTeX">$h$</tex-math><alternatives><inline-graphic xlink:href="koschier-ieq3-2730202.gif"/></alternatives></inline-formula>-refinement) following an octree scheme or by cell-wise adaption of the polynomial approximation&#x0027;s degree (<inline-formula><tex-math notation="LaTeX">$p$</tex-math><alternatives><inline-graphic xlink:href="koschier-ieq4-2730202.gif"/></alternatives></inline-formula>-refinement). We further introduce a novel decision criterion based on an error-estimator in order to decide whether to apply <inline-formula><tex-math notation="LaTeX">$p$</tex-math><alternatives><inline-graphic xlink:href="koschier-ieq5-2730202.gif"/></alternatives></inline-formula>- or <inline-formula><tex-math notation="LaTeX">$h$</tex-math><alternatives><inline-graphic xlink:href="koschier-ieq6-2730202.gif"/></alternatives></inline-formula>-refinement. We demonstrate that our method is able to construct more accurate SDFs at significantly lower memory consumption compared to previous approaches. While the cell-wise polynomial approximation will result in highly accurate SDFs, it can not be guaranteed that the piecewise approximation is continuous over cell interfaces. Therefore, we propose an optimization-based post-processing step in order to weakly enforce continuity. Finally, we apply our generated SDFs as collision detector to the physically-based simulation of geometrically highly complex solid objects in order to demonstrate the practical relevance and applicability of our method.

References

[1]
F. Calakli and G. Taubin, “SSD: Smooth signed distance surface reconstruction,” Comput. Graph. Forum, vol. 30, no. 7, pp. 1993–2002, 2011.
[2]
O. Jamriška, “Interactive ray tracing of distance fields,” in Proc. Central Eur. Semin. Comput. Graph., 2010, pp. 1–7.
[3]
S. F. Frisken and R. N. Perry, “Designing with distance fields,” in Proc. ACM SIGGRAPH Courses, 2006, pp. 60–66.
[4]
N. Mitchell, M. Aanjaneya, R. Setaluri, and E. Sifakis, “Non-manifold level sets: A multivalued implicit surface representation with applications to self-collision processing,” ACM Trans. Graph., vol. 34, no. 6, pp. 247:1–247:9, 2015.
[5]
H. Xu and J. Barbič, “Signed distance fields for polygon soup meshes,” in Proc. Graph. Interface, 2014, pp. 1–7.
[6]
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,” ACM Trans. Graph., vol. 26, no. 3, pp. 249–254, 2000.
[7]
A. Rosenfeld and J. L. Pfaltz, “Sequential operations in digital picture processing,” J. ACM, vol. 13, no. 4, pp. 471–494, 1966.
[8]
M. Jones, J. Baerentzen, and M. Sramek,“3D distance fields: A survey of techniques and applications,” IEEE Trans. Vis. Comput. Graph., vol. 12, no. 4, pp. 581–599, Jul./Aug. 2006.
[9]
M. Sanchez, O. Fryazinov, and A. Pasko, “Efficient evaluation of continuous signed distance to a polygonal mesh,” in Proc. Spring Conf. Comput. Graph., 2012, pp. 101–108.
[10]
R. N. Perry and S. F. Frisken, “Kizamu: A system for sculpting digital characters,” in Proc. Comput. Graph. Interactive Techn., 2001, pp. 47–56.
[11]
J. A. Bærentzen, “Manipulation of volumetric solids with applications to sculpting,” PhD thesis, Dept. Informatics Math. Model., Technical Univ. Denmark, Kongens Lyngby, Denmark, 2002.
[12]
K. Erleben and H. Dohlmann, “Signed distance fields using single-pass GPU scan conversion of tetrahedra,” in GPU Gems 3. Boston, MA, USA: Addison-Wesley, 2008, ch. 34, pp. 741–763.
[13]
K. Museth, “VDB: High-resolution sparse volumes with dynamic topology,” ACM Trans. Graph., vol. 32, no. 3, pp. 27:1–27:22, 2013.
[14]
J. Huang, Y. Li, R. Crawfis, S. C. Lu, and S. Y. Liou, “A complete distance field representation,” in Proc. IEEE Vis., 2001, pp. 247–254.
[15]
T. Ju, F. Losasso, S. Schaefer, and J. Warren, “Dual contouring of hermite data,” ACM Trans. Graph., vol. 21, no. 3, pp. 339–346, 2002.
[16]
H. Qu, N. Zhang, R. Shao, A. Kaufman, and K. Mueller, “Feature preserving distance fields,” in Proc. IEEE Symp. Volume Vis. Graph., 2004, pp. 39–46.
[17]
A. J. Baerentzen, “Robust generation of signed distance fields from triangle meshes,” in Proc. Int. Workshop Volume Graph., 2005, pp. 167–239.
[18]
J. Wu and L. Kobbelt, “Piecewise linear approximation of signed distance fields,” in Proc. Vis. Model. Vis., 2003, pp. 513–520.
[19]
M. W. Jones, “Distance field compression,” J. WSCG, vol. 12, no. 2, pp. 199–204, 2004.
[20]
M. A. Otaduy, N. Jain, A. Sud, and M. C. Lin, “Haptic display of interaction between textured models,” in Proc. IEEE Vis., 2004, pp. 297–304.
[21]
K. Moustakas, D. Tzovaras, and M. G. Strintzis, “SQ-Map: Efficient layered collision detection and haptic rendering,” IEEE Trans. Vis. Comput. Graph., vol. 13, no. 1, pp. 80–93, Jan./Feb. 2007.
[22]
D. M. Kaufman, S. Sueda, and D. K. Pai, “Contact trees: Adaptive contact sampling for robust dynamics,” in Proc. ACM SIGGRAPH Sketches, 2007, Art. no.
[23]
L. Glondu, S. C. Schvartzman, M. Marchal, G. Dumont, and M. A. Otaduy, “Efficient collision detection for brittle fracture,” in Proc. ACM SIGGRAPH/Eurographics Symp. Comput. Animation, 2012, pp. 285–294.
[24]
H. Xu, Y. Zhao, and J. Barbič, “Implict multibody penalty-based distributed contact,” IEEE Trans. Vis. Comput. Graph., vol. 20, no. 9, pp. 1266–1279, Sep. 2014.
[25]
R. Bridson, S. Marino, and R. Fedkiw, “Simulation of clothing with folds and wrinkles,” in Proc. ACM SIGGRAPH / Eurographics Symp. Comput. Animation, 2003, pp. 28–36.
[26]
A. Fuhrmann, G. Sobottka, and C. Groß, “Distance fields for rapid collision detection in physically based modeling,” in Proc. Comput. Graph. Vis., 2003, pp. 1–8.
[27]
J. Barbič and D. L. James, “Six-DoF haptic rendering of contact between geometrically complex reduced deformable models,” IEEE Trans. Haptics, vol. 1, no. 1, pp. 39–52, Jan.–Jun. 2008.
[28]
F. Faure, S. Barbier, J. Allard, and F. Falipou, “Image-based collision detection and response between arbitrary volume objects,” in Proc. ACM SIGGRAPH / Eurographics Symp. Comput. Animation, 2008, pp. 155–162.
[29]
J. Allard, F. Faure, H. Courtecuisse, F. Falipou, C. Duriez, and P. G. Kry, “Volume contact constraints at arbitrary resolution,” ACM Trans. Graph., vol. 29, no. 4, pp. 82:1–82:10, 2010.
[30]
B. Wang, F. Faure, and D. K. Pai, “Adaptive image-based intersection volume,” ACM Trans. Graph., vol. 31, no. 4, pp. 97:1–97:9, 2012.
[31]
H. Xu and J. Barbič, “Continuous collision detection between points and signed distance fields,” in Proc. Virtual Reality Interactions Phys. Simul., 2014, pp. 1–7.
[32]
A. McAdams, et al., “Efficient elasticity for character skinning with contact and collisions,” ACM Trans. Graph., vol. 30, no. 4, pp. 37:1–37:12, 2011.
[33]
I. Babuška, B. A. Szabo, and I. N. Katz, “The p-version of the finite element method,” SIAM J. Numerical Anal., vol. 18, no. 3, pp. 515–545, 1981.
[34]
I. Babuška and M. Suri, “Error estimates for the combined h and p versions of finite element method,” Numerische Mathematik, vol. 37, pp. 252–277, 1981.
[35]
I. Babuska and M. Suri, “The $p$ and $h-p$ versions of the finite element method, basic principles and properties,” SIAM Rev., vol. 36, no. 4, pp. 578–632, 1994.
[36]
W. F. Mitchell and M. A. McClain, “A comparison of hp-adaptive strategies for elliptic partial differential equations,” ACM Trans. Math. Softw., vol. 41, no. 1, pp. 1–39, 2014.
[37]
A. Schmidt and K. G. Siebert, “A posteriori estimators for the h-p version of the finite element method in 1D,” Appl. Numerical Math., vol. 35, no. 1, pp. 43–66, 2000.
[38]
P. Houston, B. Senior, and E. Süli, “Sobolev regularity estimation for hp-adaptive finite element methods,” in Numerical Mathematics and Advanced Applications. Milan, Italy: Springer, 2003, pp. 631–656.
[39]
J. A. Bærentzen and H. Aanæs, “Signed distance computation using the angle weighted pseudonormal,” IEEE Trans. Vis. Comput. Graph., vol. 11, no. 3, pp. 243–253, May/Jun. 2005.
[40]
P. Di Stolfo, A. Schrder, N. Zander, and S. Kollmannsberger, “An easy treatment of hanging nodes in hp-finite elements,” Finite Elements Anal. Des., vol. 121, pp. 101–117, 2016.
[41]
J. Bender, D. Koschier, P. Charrier, and D. Weber, “Position-based simulation of continuous materials,” Comput. Graph., vol. 44, pp. 1–10, 2014.
[42]
C. Deul, P. Charrier, and J. Bender, “Position-based rigid-body dynamics,” Comput. Animation Virtual Worlds, vol. 27, pp. 103–112, 2014.
[43]
J. Bender, “PositionBasedDynamics library,” 2017. [Online]. Available: https://github.com/InteractiveComputerGraphics/PositionBasedDynamics

Cited By

View all
  • (2024)Robust and Artefact-Free Deformable Contact with Smooth Surface RepresentationsProceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation10.1111/cgf.15187(1-13)Online publication date: 21-Aug-2024
  • (2023)Shortest Path to Boundary for Self-Intersecting MeshesACM Transactions on Graphics10.1145/359213642:4(1-15)Online publication date: 26-Jul-2023
  • (2021)Fast Corotated Elastic SPH Solids with Implicit Zero-Energy Mode ControlProceedings of the ACM on Computer Graphics and Interactive Techniques10.1145/34801424:3(1-21)Online publication date: 27-Sep-2021
  • Show More Cited By

Index Terms

  1. An <inline-formula><tex-math notation="LaTeX">$hp$</tex-math><alternatives><inline-graphic xlink:href="koschier-ieq1-2730202.gif"/></alternatives></inline-formula>-Adaptive Discretization Algorithm for Signed Distance Field Generation
        Index terms have been assigned to the content through auto-classification.

        Recommendations

        Comments

        Please enable JavaScript to view thecomments powered by Disqus.

        Information & Contributors

        Information

        Published In

        Publisher

        IEEE Educational Activities Department

        United States

        Publication History

        Published: 01 October 2017

        Qualifiers

        • Research-article

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • Downloads (Last 12 months)0
        • Downloads (Last 6 weeks)0
        Reflects downloads up to 03 Oct 2024

        Other Metrics

        Citations

        Cited By

        View all
        • (2024)Robust and Artefact-Free Deformable Contact with Smooth Surface RepresentationsProceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation10.1111/cgf.15187(1-13)Online publication date: 21-Aug-2024
        • (2023)Shortest Path to Boundary for Self-Intersecting MeshesACM Transactions on Graphics10.1145/359213642:4(1-15)Online publication date: 26-Jul-2023
        • (2021)Fast Corotated Elastic SPH Solids with Implicit Zero-Energy Mode ControlProceedings of the ACM on Computer Graphics and Interactive Techniques10.1145/34801424:3(1-21)Online publication date: 27-Sep-2021
        • (2020)Incremental potential contactACM Transactions on Graphics10.1145/3386569.339242539:4(49:1-49:20)Online publication date: 12-Aug-2020
        • (2020)Efficient 2D simulation on moving 3D surfacesProceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation10.1111/cgf.14098(1-12)Online publication date: 6-Oct-2020
        • (2019)Volume Maps: An Implicit Boundary Representation for SPHProceedings of the 12th ACM SIGGRAPH Conference on Motion, Interaction and Games10.1145/3359566.3360077(1-10)Online publication date: 28-Oct-2019

        View Options

        View options

        Get Access

        Login options

        Media

        Figures

        Other

        Tables

        Share

        Share

        Share this Publication link

        Share on social media