Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

A Closest Point Method for PDEs on Manifolds with Interior Boundary Conditions for Geometry Processing

Published: 09 August 2024 Publication History

Abstract

Many geometry processing techniques require the solution of partial differential equations (PDEs) on manifolds embedded in ℝ2 or ℝ3, such as curves or surfaces. Such manifold PDEs often involve boundary conditions (e.g., Dirichlet or Neumann) prescribed at points or curves on the manifold’s interior or along the geometric (exterior) boundary of an open manifold. However, input manifolds can take many forms (e.g., triangle meshes, parametrizations, point clouds, implicit functions, etc.). Typically, one must generate a mesh to apply finite element-type techniques or derive specialized discretization procedures for each distinct manifold representation. We propose instead to address such problems in a unified manner through a novel extension of the closest point method (CPM) to handle interior boundary conditions. CPM solves the manifold PDE by solving a volumetric PDE defined over the Cartesian embedding space containing the manifold and requires only a closest point representation of the manifold. Hence, CPM supports objects that are open or closed, orientable or not, and of any codimension. To enable support for interior boundary conditions, we derive a method that implicitly partitions the embedding space across interior boundaries. CPM’s finite difference and interpolation stencils are adapted to respect this partition while preserving second-order accuracy. Additionally, we develop an efficient sparse-grid implementation and numerical solver that can scale to tens of millions of degrees of freedom, allowing PDEs to be solved on more complex manifolds. We demonstrate our method’s convergence behavior on selected model PDEs and explore several geometry processing problems: diffusion curves on surfaces, geodesic distance, tangent vector field design, harmonic map construction, and reaction-diffusion textures. Our proposed approach thus offers a powerful and flexible new tool for a range of geometry processing tasks on general manifold representations.

Supplementary Material

CPM-IBC-GP-Movie (cpm-ibc-gp-movie.mp4)
Supplementary material

References

[1]
Eddie Aamari, Jisu Kim, Frédéric Chazal, Bertrand Michel, Alessandro Rinaldo, and Larry Wasserman. 2019. Estimating the reach of a manifold. Electron. J. Stat. 13, 1 (2019), 1359–1399.
[2]
David Adalsteinsson and James A. Sethian. 1995. A fast level set method for propagating interfaces. J. Comput. Phys. 118, 2 (1995), 269–277.
[3]
Nora Al-Badri and Jan Nikolai Nelles. 2024. Nefertiti. Retrieved from: https://cs.cmu.edu/ kmcrane/Projects/ModelRepository, original source https://nefertitihack.alloversky.com/
[4]
Reynaldo J. Arteaga and Steven J. Ruuth. 2015. Laplace-Beltrami spectra for shape comparison of surfaces in 3D using the closest point method. In IEEE International Conference on Image Processing (ICIP’15). IEEE, 4511–4515.
[5]
Stefan Auer, Colin B. Macdonald, Marc Treib, Jens Schneider, and Rüdiger Westermann. 2012. Real-time fluid effects on surfaces using the closest point method. In Computer Graphics Forum, Vol. 31. Wiley Online Library, 1909–1923.
[6]
Stefan Auer and Rüdiger Westermann. 2013. A semi-Lagrangian closest point method for deforming surfaces. In Computer Graphics Forum, Vol. 32. Wiley Online Library, 207–214.
[7]
Vinicius C. Azevedo, Christopher Batty, and Manuel M. Oliveira. 2016. Preserving geometry and topology for fluid flows with thin obstacles and narrow gaps. ACM Trans. Graph. 35, 4 (2016), 1–12.
[8]
Gavin Barill, Neil G. Dickson, Ryan Schmidt, David I. Levin, and Alec Jacobson. 2018. Fast winding numbers for soups and clouds. ACM Trans. Graph. 37, 4 (2018), 1–12.
[9]
Sören Bartels. 2005. Stability and convergence of finite-element approximation schemes for harmonic maps. SIAM J. Numer. Anal. 43, 1 (2005), 220–238.
[10]
Jacob Bedrossian, James H. Von Brecht, Siwei Zhu, Eftychios Sifakis, and Joseph M. Teran. 2010. A second order virtual node method for elliptic problems with interfaces and irregular domains. J. Comput. Phys. 229, 18 (2010), 6405–6426.
[11]
Alexander G. Belyaev and Pierre-Alain Fayolle. 2015. On variational and PDE-based distance function approximations. In Computer Graphics Forum, Vol. 34. Wiley Online Library, 104–118.
[12]
Jean-Paul Berrut and Lloyd N. Trefethen. 2004. Barycentric lagrange interpolation. SIAM Rev. 46, 3 (2004), 501–517.
[13]
Marcelo Bertalmıo, Li-Tien Cheng, Stanley Osher, and Guillermo Sapiro. 2001. Variational problems and partial differential equations on implicit surfaces. J. Comput. Phys. 174, 2 (2001), 759–780.
[14]
Erik Burman, Susanne Claus, Peter Hansbo, Mats G. Larson, and André Massing. 2015a. CutFEM: Discretizing geometry and partial differential equations. Int. J. Numer. Meth. Eng. 104, 7 (2015), 472–501.
[15]
Erik Burman, Peter Hansbo, and Mats G. Larson. 2015b. A stabilized cut finite element method for partial differential equations on surfaces: The Laplace–Beltrami operator. Comput. Meth. Appl. Mechan. Eng. 285 (2015), 188–207.
[16]
Erik Burman, Peter Hansbo, Mats G. Larson, and Sara Zahedi. 2019. Stabilized CutFEM for the convection problem on surfaces. Numer. Math. 141 (2019), 103–139.
[17]
Chieh Chen and Richard Tsai. 2017. Implicit boundary integral methods for the Helmholtz equation in exterior domains. Res. Math. Sci. 4, 1 (2017), 19.
[18]
Yujia Chen and Colin B. Macdonald. 2015. The closest point method and multigrid solvers for elliptic equations on surfaces. SIAM J. Scient. Comput. 37, 1 (2015), A134–A155.
[19]
Ka C. Cheung, Leevan Ling, and Steven J. Ruuth. 2015. A localized meshless method for diffusion on folded surfaces. J. Comput. Phys. 297 (2015), 194–206.
[20]
Jay Chu and Richard Tsai. 2018. Volumetric variational principles for a class of partial differential equations defined on surfaces and curves. Res. Math. Sci. 5, 2 (2018), 19.
[21]
Ming Chuang. 2013. Grid-based finite Elements System for Solving Laplace-Beltrami Equations on 2-manifolds. Ph. D. Dissertation. Johns Hopkins University.
[22]
Ming Chuang, Linjie Luo, Benedict J. Brown, Szymon Rusinkiewicz, and Michael Kazhdan. 2009. Estimating the Laplace-Beltrami operator by restricting 3D functions. In Computer Graphics Forum, Vol. 28. Wiley Online Library, 1475–1484.
[24]
[25]
Keenan Crane, Clarisse Weischedel, and Max Wardetzky. 2013. Geodesics in heat: A new approach to computing distance based on heat flow. ACM Trans. Graph. 32, 5 (2013), 1–11.
[26]
Fernando De Goes, Mathieu Desbrun, Mark Meyer, and Tony DeRose. 2016b. Subdivision exterior calculus for geometry processing. ACM Trans. Graph. 35, 4 (2016), 1–11.
[27]
Fernando De Goes, Mathieu Desbrun, and Yiying Tong. 2016a. Vector field processing on triangle meshes. In ACM SIGGRAPH 2016 Courses. 1–49.
[28]
Ismail Demir and Rüdiger Westermann. 2015. Vector-to-closest-point octree for surface ray-casting. In Vision, Modeling & Visualization, David Bommes, Tobias Ritschel, and Thomas Schultz (Eds.). The Eurographics Association. DOI:DOI:
[29]
Gerhard Dziuk. 1988. Finite Elements for the Beltrami Operator on Arbitrary Surfaces. Springer.
[30]
Gerhard Dziuk and Charles M. Elliott. 2007. Surface finite elements for parabolic equations. J. Computat. Math. 25, 4 (2007), 385–407.
[31]
Danielle Ezuz, Justin Solomon, and Mirela Ben-Chen. 2019. Reversible harmonic maps between discrete surfaces. ACM Trans. Graph. 38, 2 (2019), 1–12.
[32]
Prerna Gera and David Salac. 2017. Cahn–Hilliard on surfaces: A numerical study. Appl. Math. Lett. 73 (2017), 56–61.
[33]
Frederic Gibou, Ronald P. Fedkiw, Li-Tien Cheng, and Myungjoo Kang. 2002. A second-order-accurate symmetric discretization of the Poisson equation on irregular domains. J. Comput. Phys. 176, 1 (2002), 205–227.
[34]
John B. Greer. 2006. An improvement of a recent Eulerian method for solving PDEs on general geometries. J. Scient. Comput. 29, 3 (2006), 321–352.
[35]
Gaël Guennebaud, Benoît Jacob, et al. 2010. Eigen v3. Retrieved from http://eigen.tuxfamily.org
[36]
Jeffrey L. Hellrung Jr., Luming Wang, Eftychios Sifakis, and Joseph M. Teran. 2012. A second order virtual node method for elliptic problems with interfaces and irregular domains in three dimensions. J. Comput. Phys. 231, 4 (2012), 2015–2048.
[37]
Yi Hong, Dengming Zhu, Xianjie Qiu, and Zhaoqi Wang. 2010. Geometry-based control of fire simulation. Visual Comput. 26, 9 (2010), 1217–1228.
[38]
Yixin Hu, Qingnan Zhou, Xifeng Gao, Alec Jacobson, Denis Zorin, and Daniele Panozzo. 2018. Tetrahedral meshing in the wild.ACM Trans. Graph. 37, 4 (2018), 60:1–60:14.
[39]
Alec Jacobson, Daniele Panozzo, and others. 2018. libigl: A Simple C++ Geometry Processing Library. Retrieved from https://libigl.github.io/
[40]
Stefan Jeschke, David Cline, and Peter Wonka. 2009. Rendering surface details with diffusion curves. In ACM SIGGRAPH Asia. 1–8.
[41]
Peter Kaufmann, Sebastian Martin, Mario Botsch, Eitan Grinspun, and Markus Gross. 2009. Enrichment textures for detailed cutting of shells. In ACM SIGGRAPH. 1–10.
[42]
Theodore Kim, Jerry Tessendorf, and Nils Thuerey. 2013. Closest point turbulence for liquid surfaces. ACM Trans. Graph. 32, 2 (2013), 1–13.
[43]
Nathan D. King and Steven J. Ruuth. 2017. Solving variational problems and partial differential equations that map between manifolds via the closest point method. J. Comput. Phys. 336 (2017), 330–346.
[44]
Catherine Kublik, Nicolay M. Tanushev, and Richard Tsai. 2013. An implicit interface boundary integral method for Poisson’s equation on arbitrary domains. J. Comput. Phys. 247 (2013), 279–311.
[45]
Catherine Kublik and Richard Tsai. 2016. Integration over curves and surfaces defined by the closest point mapping. Res. Math. Sci. 3, 1 (2016), 3.
[46]
Randall J. LeVeque. 2007. Finite Difference Methods for Ordinary and Partial Differential Equations: Steady-state and Time-dependent Problems. SIAM.
[47]
Jian Liang and Hongkai Zhao. 2013. Solving partial differential equations on point clouds. SIAM J. Scient. Comput. 35, 3 (2013), A1461–A1486.
[48]
Hsueh-Ti D. Liu, Alec Jacobson, and Keenan Crane. 2017. A Dirac operator for extrinsic shape analysis. In Computer Graphics Forum, Vol. 36. Wiley Online Library, 139–149.
[49]
Yu-Shen Liu, Jean-Claude Paul, Jun-Hai Yong, Pi-Qiang Yu, Hui Zhang, Jia-Guang Sun, and Karthik Ramani. 2006. Automatic least-squares projection of points onto point clouds with applications in reverse engineering. Comput.-aid. Des. 38, 12 (2006), 1251–1263.
[50]
Colin B. Macdonald, Jeremy Brandman, and Steven J. Ruuth. 2011. Solving eigenvalue problems on curved surfaces using the closest point method. J. Comput. Phys. 230, 22 (2011), 7944–7956.
[51]
Colin B. Macdonald, Barry Merriman, and Steven J. Ruuth. 2013. Simple computation of reaction–diffusion processes on point clouds. Proc. Nat’l Acad. Sci. 110, 23 (2013), 9209–9214. pmid:23690616.
[52]
Colin B. Macdonald and Steven J. Ruuth. 2008. Level set equations on surfaces via the closest point method. J. Scient. Comput. 35, 2-3 (2008), 219–240.
[53]
Colin B. Macdonald and Steven J. Ruuth. 2010. The implicit closest point method for the numerical solution of partial differential equations on surfaces. SIAM J. Scient. Comput. 31, 6 (2010), 4330–4350.
[54]
Zoë Marschner, Paul Zhang, David Palmer, and Justin Solomon. 2021. Sum-of-squares geometry processing. ACM Trans. Graph. 40, 6 (2021), 1–13.
[55]
Lindsay Martin and Yen-Hsi R. Tsai. 2020. Equivalent extensions of Hamilton–Jacobi–Bellman equations on hypersurfaces. J. Scient. Comput. 84, 3 (2020), 1–29.
[56]
Thomas Marz and Colin B. Macdonald. 2012. Calculus on surfaces with general closest point functions. SIAM J. Numer. Anal. 50, 6 (2012), 3303–3328.
[57]
Sean P. Mauch. 2003. Efficient Algorithms for Solving Static Hamilton-Jacobi Equations. Ph. D. Dissertation. California Institute of Technology. Pasadena, California.
[58]
Ian C. May, Ronald D. Haynes, and Steven J. Ruuth. 2020. Schwarz solvers and preconditioners for the closest point method. SIAM J. Scient. Comput. 42, 6 (2020), A3584–A3609.
[59]
Ian C. T. May, Ronald D. Haynes, and Steven J. Ruuth. 2022. A closest point method library for PDEs on surfaces with parallel domain decomposition solvers and preconditioners. Numer. Algor. 93, 2 (2022), 1–23.
[60]
Joseph S. B. Mitchell, David M. Mount, and Christos H. Papadimitriou. 1987. The discrete geodesic problem. SIAM J. Comput. 16, 4 (1987), 647–668.
[61]
Nathan Mitchell, Mridul Aanjaneya, Rajsekhar Setaluri, and Eftychios Sifakis. 2015. Non-manifold level sets: A multivalued implicit surface representation with applications to self-collision processing. ACM Trans. Graph. 34, 6 (2015), 1–9.
[62]
Nicolas Moës, John Dolbow, and Ted Belytschko. 1999. A finite element method for crack growth without remeshing. Int. J. Numer. Meth. Eng. 46, 1 (1999), 131–150.
[63]
Neil Molino, Zhaosheng Bao, and Ron Fedkiw. 2004. A virtual node algorithm for changing mesh topology during simulation. ACM Trans. Graph. 23, 3 (2004), 385–392.
[64]
Dieter Morgenroth, Stefan Reinhardt, Daniel Weiskopf, and Bernhard Eberhardt. 2020. Efficient 2D simulation on moving 3D surfaces. In Computer Graphics Forum, Vol. 39. Wiley Online Library, 27–38.
[65]
Yen Ting Ng, Chohong Min, and Frédéric Gibou. 2009. An efficient fluid–solid coupling algorithm for single-phase flows. J. Comput. Phys. 228, 23 (2009), 8807–8829.
[66]
Thien Nguyen, Kȩstutis Karčiauskas, and Jörg Peters. 2016. \(C^1\) finite elements on non-tensor-product 2D and 3D manifolds. Appl. Math. Comput. 272 (2016), 148–158.
[67]
Alexandrina Orzan, Adrien Bousseau, Holger Winnemöller, Pascal Barla, Joëlle Thollot, and David Salesin. 2008. Diffusion curves: A vector representation for smooth-shaded images. ACM Trans. Graph. 27, 3 (2008), 1–8.
[68]
Richard Palais, Hermann Karcher, et al. 2023. 3DXM Virtual Math Museum. Retrieved from https://virtualmathmuseum.org
[69]
John E. Pearson. 1993. Complex patterns in a simple system. Science 261, 5118 (1993), 189–192.
[70]
Argyrios Petras, Leevan Ling, Cécile Piret, and Steven J. Ruuth. 2019. A least-squares implicit RBF-FD closest point method and applications to PDEs on moving surfaces. J. Comput. Phys. 381 (2019), 146–161.
[71]
Argyrios Petras, Leevan Ling, and Steven J. Ruuth. 2018. An RBF-FD closest point method for solving PDEs on surfaces. J. Comput. Phys. 370 (2018), 43–57.
[72]
Argyrios Petras, Leevan Ling, and Steven J. Ruuth. 2022. Meshfree semi-Lagrangian methods for solving surface advection PDEs. J. Scient. Comput. 93, 1 (2022), 1–22.
[73]
Argyrios Petras and Steven J. Ruuth. 2016. PDEs on moving surfaces via the closest point method and a modified grid based particle method. J. Comput. Phys. 312 (2016), 139–156.
[74]
Ulrich Pinkall and Konrad Polthier. 1993. Computing discrete minimal surfaces and their conjugates. Experim. Math. 2, 1 (1993), 15–36.
[75]
Cécile Piret. 2012. The orthogonal gradients method: A radial basis functions method for solving partial differential equations on arbitrary surfaces. J. Comput. Phys. 231, 14 (2012), 4662–4675.
[76]
Yixuan Qiu. 2023. LBFGS++. Retrieved from https://lbfgspp.statr.me/
[77]
Martin Reuter, Franz-Erich Wolter, and Niklas Peinecke. 2006. Laplace–Beltrami spectra as “Shape-DNA” of surfaces and solids. Comput.-aid. Des. 38, 4 (2006), 342–366.
[78]
Damien Rioux-Lavoie, Ryusuke Sugimoto, Tümay Özdemir, Naoharu H. Shimada, Christopher Batty, Derek Nowrouzezahrai, and Toshiya Hachisuka. 2022. A Monte Carlo method for fluid simulation. ACM Trans. Graph. 41, 6 (2022), 1–16.
[79]
Steven J. Ruuth and Barry Merriman. 2008. A simple embedding method for solving partial differential equations on surfaces. J. Comput. Phys. 227, 3 (2008), 1943–1961.
[80]
Rohan Sawhney. 2022. FCPW: Fastest Closest Points in the West. Retrieved from https://github.com/rohan-sawhney/fcpw
[81]
Rohan Sawhney and Keenan Crane. 2020. Monte Carlo geometry processing: A grid-free approach to PDE-based methods on volumetric domains. ACM Trans. Graph. 39, 4 (2020), 123: 1–123: 18.
[82]
Rohan Sawhney, Dario Seyb, Wojciech Jarosz, and Keenan Crane. 2022. Grid-free Monte Carlo for PDEs with spatially varying coefficients. ACM Trans. Graph. 41, 4 (2022), 1–17.
[83]
Robert Saye. 2014. High-order methods for computing distances to implicitly defined surfaces. Commun. Appl. Math. Computat. Sci. 9, 1 (2014), 107–141.
[84]
Teseo Schneider, Yixin Hu, Jérémie Dumas, Xifeng Gao, Daniele Panozzo, and Denis Zorin. 2018. Decoupling simulation accuracy from mesh quality. ACM Trans. Graph. 37, 6 (2018).
[85]
Peter Schwartz, Michael Barad, Phillip Colella, and Terry Ligocki. 2006. A Cartesian grid embedded boundary method for the heat equation and Poisson’s equation in three dimensions. J. Comput. Phys. 211, 2 (2006), 531–550.
[86]
Nicholas Sharp, et al. 2019b. Polyscope. https://polyscope.run/
[87]
Nicholas Sharp and Keenan Crane. 2020. You can find geodesic paths in triangle meshes by just flipping edges. ACM Trans. Graph. 39, 6 (2020), 1–15.
[88]
Nicholas Sharp, Keenan Crane, et al. 2019a. Geometry Central. Retrieved from www.geometry-central.net
[89]
Nicholas Sharp and Alec Jacobson. 2022. Spelunking the deep: Guaranteed queries on general neural implicit surfaces via range analysis. ACM Trans. Graph. 41, 4, Article 107 (July 2022), 16 pages. DOI:DOI:
[90]
Nicholas Sharp, Yousuf Soliman, and Keenan Crane. 2019c. The vector heat method. ACM Trans. Graph. 38, 3 (2019), 1–19.
[91]
Yonggang Shi, Jonathan H. Morra, Paul M. Thompson, and Arthur W. Toga. 2009. Inverse-consistent surface mapping with Laplace-Beltrami eigen-features. In International Conference on Information Processing in Medical Imaging. Springer, 467–478.
[92]
Yonggang Shi, Paul M. Thompson, Ivo Dinov, Stanley Osher, and Arthur W. Toga. 2007. Direct cortical mapping via solving partial differential equations on implicit surfaces. Med. Image Anal. 11, 3 (2007), 207–223.
[93]
John Strain. 1999. Fast tree-based redistancing for level set computations. J. Comput. Phys. 152, 2 (1999), 664–686.
[94]
Ryusuke Sugimoto, Terry Chen, Yiti Jiang, Christopher Batty, and Toshiya Hachisuka. 2023. A practical walk-on-boundary method for boundary value problems. ACM Trans. Graph. 42, 4 (July 2023). DOI:DOI:
[95]
The Stanford 3D Scanning Repository. 2024. Lucy and XYZ RGB Dragon. Retrieved from https://animium.com/2013/11/lucy-angel-3d-model
[96]
Li Tian, Colin B. Macdonald, and Steven J. Ruuth. 2009. Segmentation on surfaces with the closest point method. In 16th IEEE International Conference on Image Processing (ICIP’09). IEEE, 3009–3012.
[97]
Greg Turk. 1991. Generating textures on arbitrary surfaces using reaction-diffusion. ACM SIGGRAPH Comput. Graph. 25, 4 (1991), 289–298.
[98]
Greg Turk. 2001. Texture synthesis on surfaces. In 28th Annual Conference on Computer Graphics and Interactive Techniques. 347–354.
[99]
Hui Wang, Yongxu Jin, Anqi Luo, Xubo Yang, and Bo Zhu. 2020. Codimensional surface tension flow using moving-least-squares particles. ACM Trans. Graph. 39, 4 (2020), 42–1.
[100]
Li-Yi Wei and Marc Levoy. 2001. Texture synthesis over arbitrary manifold surfaces. In 28th Annual Conference on Computer Graphics and Interactive Techniques. 355–360.
[101]
Junxiang Yang, Yibao Li, and Junseok Kim. 2020. A practical finite difference scheme for the Navier–Stokes equation on curved surfaces in \(\mathbb {R}^3\). J. Comput. Phys. 411 (2020), 109403.
[102]
Zhang Yingjie and Ge Liling. 2011. Improved moving least squares algorithm for directed projecting onto point clouds. Measurement 44, 10 (2011), 2008–2019.
[103]
Eugene Zhang, Konstantin Mischaikow, and Greg Turk. 2006. Vector field design on surfaces. ACM Trans. Graph. 25, 4 (2006), 1294–1326.

Cited By

View all
  • (2024)Optimized schwarz domain decomposition algorithms for the closest point method on closed manifoldsNumerical Algorithms10.1007/s11075-024-01995-6Online publication date: 20-Dec-2024

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Graphics
ACM Transactions on Graphics  Volume 43, Issue 5
October 2024
207 pages
EISSN:1557-7368
DOI:10.1145/3613708
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 August 2024
Online AM: 17 June 2024
Accepted: 03 June 2024
Revised: 31 May 2024
Received: 04 May 2023
Published in TOG Volume 43, Issue 5

Check for updates

Author Tags

  1. Manifold partial differential equations
  2. embedding methods
  3. closest point method
  4. boundary conditions
  5. geometry processing
  6. diffusion curves
  7. geodesic distance
  8. vector field design
  9. harmonic maps
  10. reaction-diffusion textures

Qualifiers

  • Research-article

Funding Sources

  • QEII-GSST and Ontario Graduate Scholarships
  • National Science Foundation
  • NSERC Discovery
  • NSERC Discovery
  • CFI-JELF

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)487
  • Downloads (Last 6 weeks)52
Reflects downloads up to 12 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Optimized schwarz domain decomposition algorithms for the closest point method on closed manifoldsNumerical Algorithms10.1007/s11075-024-01995-6Online publication date: 20-Dec-2024

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Full Text

View this article in Full Text.

Full Text

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media