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

키워드

참고문헌 (41)

1. S. Gottschalk, "OBBTree A Hierarchical Structure for Rapid Interference Detection", ACM Transactions on Graphics(SIGGRAPH 1996), 15(3), pp.171~180 (1996)
2. Fast Proximity Queries with Swept Sphere Volumes, "E. Larsen", Dept. of Computer Science, UNC, ~ (1999)
3. E. Larsen, "Fast distance queries with rectangular swept sphere volumes", Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No. 00CH37065), 4, pp.3719~3726 (2000)
4. D. S. Meek, "Approximating smooth planar curves by arc splines", Journal of Computational and Applied Mathematics, 59(2), pp.221~231 (1995)
5. M. Barton, "Spiral fat arcs-Bounding regions with cubic convergence", Graphical Models, 73(2), pp.50~57 (2011)
6. Y.-J. Kim, "Data structures for accelerating geometric operations on freeform objects", Korea Computer Graphics Society 2011 Proceeding, pp.71~72 (2011)
7. Y. -J. Kim, "Efficient offset trimming for planar rational curves using biarc trees", Computer Aided Geometric Design, 29(7), pp.555~564 (2012)
8. J. Lee, "Efficient offset trimming for deformable planar curves using a dynamic hierarchy of bounding circular arcs", Computer-Aided Design, 58, pp.248~255 (2015)
9. F. Aurenhammer, "Voronoi Diagrams — A Survey of a Fundamental Geometric Data Structure", ACM Computing Surveys(CSUR), 23(3), pp.345~405 (1991)
10. O. Aichholzer, "Medial axis computation for planar free-form shapes", Computer-Aided Design, 41(5), pp.339~349 (2009)
11. O. Aichholzer, "Divide-and-conquer for Voronoi diagrams revisited", Computational geometry, 43(8), pp.688~699 (2010)
12. J. Lee, "Efficient voronoi diagram construction for planar freeform spiral curves", Computer Aided Geometric Design, 43, pp.131~142 (2016)
13. S. Krishnan, "Rapid and Accurate Contact Determination between Spline Models using ShellTrees", Computer Graphics Forum, 17(3), pp.315~326 (1998)
14. G. Bradshaw, "Sphere-Tree Construction using Dynamic Medial Axis Approximation", Proceedings of the 2002 ACM SIGGRAPH, 2002, 33~40
15. X. -M. Liu, "A torus patch approximation approach for point projection on surfaces", Computer Aided Geometric Design, 26(5), pp.593~598 (2009)
16. S.-M. Hu, "A second order algorithm for orthogonal projection onto curves and surfaces", Computer Aided Geometric Design, 22(3), pp.251~260 (2005)
17. D. -S. Kim, "Tangent, normal, and visibility cones on B´ezier surfaces", Computer Aided Geometric Design, 12(3), pp.305~320 (1995)
18. M. Daniel, "Using a Convex Pyramid to Bound Surface Normal Vectors", Computer graphics forum, 15(4), pp.219~227 (1996)
19. K.-R. Park, "Offsets of ruled surfaces", Journal of the Korea Computer Graphics Society, 4(2), pp.69~75 (1998)
20. R. T. Farouki, "The approximation of non-degenerate offset surfaces", Computer Aided Geometric Design, 3(1), pp.15~43 (1986)
21. G. Elber, "Error bounded variable distance offset operator for free form curves and surfaces", International Journal of Computational Geometry & Applications, 1(01), pp.67~78 (1991)
22. G. Elber, "Comparing offset curve approximation methods", IEEE computer graphics and applications, 17(3), pp.62~71 (1997)
23. R. Martin, "Principal patches-a new class of surface patch based on differential geometry", Eurographics, 83, pp.47~55 (1983)
24. R. T. Farouki, "Exact offset procedures for simple solids", Computer Aided Geometric Design, 2(4), pp.257~279 (1985)
25. M. Tang, "Interactive hausdorff distance computation for general polygonal models", ACM Transactions on Graphics (TOG), 28(3), pp.74~ (2009)
26. M. Bartoˇn, "Precise hausdorff distance computation between polygonal meshes", Computer Aided Geometric Design, 27(8), pp.580~591 (2010)
27. Y. -J. Kim, "Precise Hausdorff distance computation for planar freeform curves using biarcs and depth buffer", The Visual Computer, 26(6-8), pp.1007~1016 (2010)
28. M. Guthe, "Fast and accurate hausdorff distance calculation between meshes", Journal of WSCG, 13(2) (2005)
29. Y. Kang, "Fast and robust Hausdorff distance computation from triangle mesh to quad mesh in near-zero cases", Computer Aided Geometric Design, 62, pp.91~103 (2018)
30. I. Hanniel, "Computing the Hausdorff distance between NURBS surfaces using numerical iteration on the GPU", Graphical Models, 74(4), pp.255~264 (2012)
31. A. Krishnamurthy, "GPUaccelerated Hausdorff distance computation between dynamic deformable NURBS surfaces", Computer-Aided Design, 43(11), pp.1370~1379 (2011)
32. Y. -J. Kim, "Efficient Hausdorff distance computation for freeform geometric models in close proximity", Computer-Aided Design, 45(2), pp.270~276 (2013)
33. D. Filip, "Surface algorithms using bounds on derivatives", Computer Aided Geometric Design, 3(4), pp.295~311 (1986)
34. M. P. Do Carmo, "Differential Geometry of Curves and Surfaces" (2016)
35. Y. Kang, "Deformable quad mesh for accelerated geometric operations", Korea Computer Graphics Society 2015 Proceeding, pp.73~74 (2011)
36. P. Du, "TSS BVHs : tetrahedron swept sphere BVHs for ray tracing subdivision surfaces", Computer Graphics Forum, 35(7), pp.279~288 (2016)
37. N. M. Patrikalakis, "Surface-to-surface intersections", IEEE Computer Graphics and Applications, 13(1), pp.89~95 (1993)
38. K. -J. Kim, "Computing intersection between freeform surfaces", Journal of the Korea Computer Graphics Society, 10(3), pp.28~33 (2004)
39. K. -J. Kim, "Torus", Sphere Intersection Based on a Configuration Space Approach, 1998, 77~92
40. K. -J. Kim, "Circles in torus-torus intersections", Journal of Computational and Applied Mathematics, 236(9), pp.2387~2397 (2012)
41. G. Elber, "Hausdorff and Minimal Distances between Parametric Freeforms in R2 and R3", International Conference on Geometric Modeling and Processing, pp.191~204 (2008)

관련 논문AI추천