Journal of the Korea Computer Graphics Society (한국컴퓨터그래픽스학회논문지)

Korea Computer Graphics Society (한국컴퓨터그래픽스학회)
권호 표지
DOI QR코드

DOI QR Code

Geometric Processing for Freeform Surfaces Based on High-Precision Torus Patch Approximation

토러스 패치 기반의 정밀 근사를 이용한 자유곡면의 기하학적 처리

  • Park, Youngjin (Department of Computer Science and Engineering, Seoul National University) ;
  • Hong, Q Youn (Department of Computer Science and Engineering, Seoul National University) ;
  • Kim, Myung-Soo (Department of Computer Science and Engineering, Seoul National University)
  • Received : 2019.06.10
  • Accepted : 2019.06.22
  • Published : 2019.07.14
Download PDF
⟨ Previous Next ⟩

Abstract

We introduce a geometric processing method for freeform surfaces based on high-precision torus patch approximation, a new spatial data structure for efficient geometric operations on freeform surfaces. A torus patch fits the freeform surface with flexibility: it can handle not only positive and negative curvature but also a zero curvature. It is possible to precisely approximate the surface regardless of the convexity/concavity of the surface. Unlike the traditional method, a torus patch easily bounds the surface normal, and the offset of the torus becomes a torus again, thus helps the acceleration of various geometric operations. We have shown that the torus patch's approximation accuracy of the freeform surface is high by measuring the upper bound of the two-sided Hausdorff distance between the freeform surface and set of torus patches. Using the method, it can be easily processed to detect an intersection curve between two freeform surfaces and find the offset surface of the freeform surface.

3차원상의 자유곡면에 대한 효율적인 기하 연산을 지원하기 위한 새로운 공간자료구조로서 토러스 패치 기반 정밀 근사를 이용한 자유곡면의 기하학적 처리 기법을 소개한다. 토러스는 곡률이 양이나 음인 경우뿐만 아니라, 0인 부분도 있으므로 자유곡면의 볼록, 오목 여부에 상관없이 곡면을 정밀하게 근사할 수 있다. 전통적인 기법과 달리 토러스 패치는 자유곡면의 법벡터 방향까지 쉽게 모델링할 수 있고, 토러스의 오프셋은 다시 토러스가 되므로 다양한 기하 연산의 가속화를 지원할 수 있다. 자유곡면과 이를 근사하는 토러스 패치 집합 사이의 양방향 하우스도르프 거 리의 상한을 계산하여 토러스 패치를 이용하여 자유곡면을 높은 정밀도로 근사할 수 있음을 보였다. 이 기법을 이용하여 두 자유곡면의 교차곡선 계산과 자유곡면의 오프셋 곡면 생성을 쉽게 처리할 수 있음을 보였다.

Keywords

References

  1. S. Gottschalk, M. C. Lin, and D. Manocha, "OBBTree A Hierarchical Structure for Rapid Interference Detection," ACM Transactions on Graphics (SIGGRAPH 1996), vol. 15, no. 3, pp. 171-180, 1996.
  2. E. Larsen, S. Gottschalk, M. Lin, and D. Manocha, "Fast Proximity Queries with Swept Sphere Volumes," Dept. of Computer Science, UNC, Chapel Hill, NC, Tech. Rep., 1999.
  3. E. Larsen, S. Gottschalk, M. C. Lin, and D. Manocha, "Fast distance queries with rectangular swept sphere volumes," in Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No. 00CH37065), vol. 4, 2000, pp. 3719-3726.
  4. D. S. Meek and D. J. Walton, "Approximating smooth planar curves by arc splines," Journal of Computational and Applied Mathematics, vol. 59, no. 2, pp. 221-231, 1995. https://doi.org/10.1016/0377-0427(94)00029-Z
  5. M. Barton and G. Elber, "Spiral fat arcs-Bounding regions with cubic convergence," Graphical Models, vol. 73, no. 2, pp. 50-57, 2011. https://doi.org/10.1016/j.gmod.2010.10.005
  6. Y.-J. Kim, Y.-T. Oh, J. Lee, S.-H. Yoon, and M.-S. Kim, "Data structures for accelerating geometric operations on freeform objects," in Korea Computer Graphics Society 2011 Proceeding, 2011, pp. 71-72.
  7. Y.-J. Kim, J. Lee, M.-S. Kim, and G. Elber, "Efficient offset trimming for planar rational curves using biarc trees," Computer Aided Geometric Design, vol. 29, no. 7, pp. 555-564, 2012. https://doi.org/10.1016/j.cagd.2012.03.014
  8. J. Lee, Y.-J. Kim, M.-S. Kim, and G. Elber, "Efficient offset trimming for deformable planar curves using a dynamic hierarchy of bounding circular arcs," Computer-Aided Design, vol. 58, pp. 248-255, 2015. https://doi.org/10.1016/j.cad.2014.08.031
  9. F. Aurenhammer, "Voronoi Diagrams - A Survey of a Fundamental Geometric Data Structure," ACM Computing Surveys (CSUR), vol. 23, no. 3, pp. 345-405, 1991. https://doi.org/10.1145/116873.116880
  10. O. Aichholzer,W. Aigner, F. Aurenhammer, T. Hackl, B. Juttler, and M. Rabl, "Medial axis computation for planar free-form shapes," Computer-Aided Design, vol. 41, no. 5, pp. 339-349, 2009. https://doi.org/10.1016/j.cad.2008.08.008
  11. O. Aichholzer,W. Aigner, F. Aurenhammer, T. Hackl, B. Juttler, E. Pilgerstorfer, and M. Rabl, "Divide-and-conquer for Voronoi diagrams revisited," Computational geometry, vol. 43, no. 8, pp. 688-699, 2010. https://doi.org/10.1016/j.comgeo.2010.04.004
  12. J. Lee, Y.-J. Kim, M.-S. Kim, and G. Elber, "Efficient voronoi diagram construction for planar freeform spiral curves," Computer Aided Geometric Design, vol. 43, pp. 131-142, 2016. https://doi.org/10.1016/j.cagd.2016.02.008
  13. S. Krishnan, M. Gopi, M. Lin, D. Manocha, and A. Pattekar, "Rapid and Accurate Contact Determination between Spline Models using ShellTrees," in Computer Graphics Forum, vol. 17, no. 3, 1998, pp. 315-326. https://doi.org/10.1111/1467-8659.00278
  14. G. Bradshaw and C. O'Sullivan, "Sphere-Tree Construction using Dynamic Medial Axis Approximation," in Proceedings of the 2002 ACM SIGGRAPH/Eurographics symposium on Computer animation, 2002, pp. 33-40.
  15. X.-M. Liu, L. Yang, J.-H. Yong, H.-J. Gu, and J.-G. Sun, "A torus patch approximation approach for point projection on surfaces," Computer Aided Geometric Design, vol. 26, no. 5, pp. 593-598, 2009. https://doi.org/10.1016/j.cagd.2009.01.004
  16. S.-M. Hu and J. Wallner, "A second order algorithm for orthogonal projection onto curves and surfaces," Computer Aided Geometric Design, vol. 22, no. 3, pp. 251-260, 2005. https://doi.org/10.1016/j.cagd.2004.12.001
  17. D.-S. Kim, P. Y. Papalambros, and T. C. Woo, "Tangent, normal, and visibility cones on Bezier surfaces," Computer Aided Geometric Design, vol. 12, no. 3, pp. 305-320, 1995. https://doi.org/10.1016/0167-8396(94)00016-L
  18. M. Daniel, "Using a Convex Pyramid to Bound Surface Normal Vectors," in Computer graphics forum, vol. 15, no. 4, 1996, pp. 219-227. https://doi.org/10.1111/1467-8659.1540219
  19. K.-R. Park and G.-I. Kim, "Offsets of ruled surfaces," Journal of the Korea Computer Graphics Society, vol. 4, no. 2, pp. 69-75, 1998.
  20. R. T. Farouki, "The approximation of non-degenerate offset surfaces," Computer Aided Geometric Design, vol. 3, no. 1, pp. 15-43, 1986. https://doi.org/10.1016/0167-8396(86)90022-1
  21. G. Elber and E. Cohen, "Error bounded variable distance offset operator for free form curves and surfaces," International Journal of Computational Geometry & Applications, vol. 1, no. 01, pp. 67-78, 1991. https://doi.org/10.1142/S0218195991000062
  22. G. Elber, I.-K. Lee, and M.-S. Kim, "Comparing offset curve approximation methods," IEEE computer graphics and applications, vol. 17, no. 3, pp. 62-71, 1997. https://doi.org/10.1109/38.586019
  23. R. Martin, "Principal patches-a new class of surface patch based on differential geometry," in Eurographics, vol. 83, 1983, pp. 47-55.
  24. R. T. Farouki, "Exact offset procedures for simple solids," Computer Aided Geometric Design, vol. 2, no. 4, pp. 257-279, 1985. https://doi.org/10.1016/S0167-8396(85)80002-9
  25. M. Tang, M. Lee, and Y. J. Kim, "Interactive hausdorff distance computation for general polygonal models," ACM Transactions on Graphics (TOG), vol. 28, no. 3, p. 74, 2009. https://doi.org/10.1145/1531326.1531380
  26. M. Barton, I. Hanniel, G. Elber, and M.-S. Kim, "Precise hausdorff distance computation between polygonal meshes," Computer Aided Geometric Design, vol. 27, no. 8, pp. 580-591, 2010. https://doi.org/10.1016/j.cagd.2010.04.004
  27. Y.-J. Kim, Y.-T. Oh, S.-H. Yoon, M.-S. Kim, and G. Elber, "Precise Hausdorff distance computation for planar freeform curves using biarcs and depth buffer," The Visual Computer, vol. 26, no. 6-8, pp. 1007-1016, 2010. https://doi.org/10.1007/s00371-010-0477-3
  28. M. Guthe, P. Borodin, and R. Klein, "Fast and accurate hausdorff distance calculation between meshes," Journal of WSCG, vol. 13, no. 2, 2005.
  29. Y. Kang, M.-H. Kyung, S.-H. Yoon, and M.-S. Kim, "Fast and robust Hausdorff distance computation from triangle mesh to quad mesh in near-zero cases," Computer Aided Geometric Design, vol. 62, pp. 91-103, 2018. https://doi.org/10.1016/j.cagd.2018.03.017
  30. I. Hanniel, A. Krishnamurthy, and S. McMains, "Computing the Hausdorff distance between NURBS surfaces using numerical iteration on the GPU," Graphical Models, vol. 74, no. 4, pp. 255-264, 2012. https://doi.org/10.1016/j.gmod.2012.05.002
  31. A. Krishnamurthy, S. McMains, and I. Hanniel, "GPU-accelerated Hausdorff distance computation between dynamic deformable NURBS surfaces," Computer-Aided Design, vol. 43, no. 11, pp. 1370-1379, 2011. https://doi.org/10.1016/j.cad.2011.08.022
  32. Y.-J. Kim, Y.-T. Oh, S.-H. Yoon, M.-S. Kim, and G. Elber, "Efficient Hausdorff distance computation for freeform geometric models in close proximity," Computer-Aided Design, vol. 45, no. 2, pp. 270-276, 2013. https://doi.org/10.1016/j.cad.2012.10.010
  33. D. Filip, R. Magedson, and R. Markot, "Surface algorithms using bounds on derivatives," Computer Aided Geometric Design, vol. 3, no. 4, pp. 295-311, 1986. https://doi.org/10.1016/0167-8396(86)90005-1
  34. M. P. Do Carmo, Differential Geometry of Curves and Surfaces: Revised and Updated Second Edition, 2016.
  35. Y. Kang, J. Jang, and M.-S. Kim, "Deformable quad mesh for accelerated geometric operations," in Korea Computer Graphics Society 2015 Proceeding, 2011, pp. 73-74.
  36. P. Du, Y. J. Kim, and S.-E. Yoon, "TSS BVHs: tetrahedron swept sphere BVHs for ray tracing subdivision surfaces," Computer Graphics Forum, vol. 35, no. 7, pp. 279-288, 2016. https://doi.org/10.1111/cgf.13025
  37. N. M. Patrikalakis, "Surface-to-surface intersections," IEEE Computer Graphics and Applications, vol. 13, no. 1, pp. 89-95, 1993. https://doi.org/10.1109/38.180122
  38. K.-J. Kim, J.-K. Seong, and M.-S. Kim, "Computing intersection between freeform surfaces," Journal of the Korea Computer Graphics Society, vol. 10, no. 3, pp. 28-33, 2004.
  39. K.-J. Kim, M.-S. Kim, and K. Oh, "Torus/Sphere Intersection Based on a Configuration Space Approach," Graphical Models and Image Processing, pp. 77-92, 1998. https://doi.org/10.1006/gmip.1997.0451
  40. K.-J. Kim, "Circles in torus-torus intersections," Journal of Computational and Applied Mathematics, vol. 236, no. 9, pp. 2387-2397, 2012. https://doi.org/10.1016/j.cam.2011.11.025
  41. G. Elber and T. Grandine, "Hausdorff and Minimal Distances between Parametric Freeforms in ${\mathbb{R}}^2$ and ${\mathbb{R}}^3$," in International Conference on Geometric Modeling and Processing, 2008, pp. 191-204.