Abstract
We compare the relative performance of bounding regions generated by three different curve-bounding methods with cubic convergence to planar freeform curves: spiral fat arcs (SFA) (Barton and Elber in Graph Models 73(2):50–57, 2011), bilens (Kumosenko in Comput Aided Geom Des 30(3):310–330, 2013), and bounding circular arcs (BCA) (Meek and Walton in J Comput Appl Math 59(2):221–231, 1995). For quantitative comparison, we consider three different criteria: geometric complexity (the number of circular arcs and line segments), construction time, and numerical stability. The BCA construction after one-step refinement (producing four circular arcs) is almost comparable to the other two methods in geometric complexity: the SFA with two circular arcs and two line segments, and the bilens with four circular arcs. In other comparison criteria, the BCA approach is more efficient and stable than the other two methods in producing a hierarchy of bounding regions that approximate a family of freeform planar curves within a given error bound.
Similar content being viewed by others
References
Akenine-Möller, T., Hains, E., Hoffman, N.: Real-Time Rendering, 3rd edn. A.K. Peters, Natick (2008)
Aichholzer, O., Aigner, W., Aurenhammer, F., Hackl, T., Oberneder, M., Jüttler, B.: Medial axis computation for planar free-form shapes. Comput.-Aided Des. 41(5), 339–349 (2009)
Aichholzer, O., Aigner, W., Aurenhammer, F., Hackl, T., Jüttler, B., Pilgerstorfer, E., Rabl, M.: Divide-and-conquer algorithms for Voronoi diagrams revisited. Comput. Geom.: Theory Appl. 43(8), 688–699 (2010)
Barton, M., Elber, G.: Spiral fat arcs—bounding regions with cubic convergence. Graph. Models 73(2), 50–57 (2011)
Barequet, G., Chazelle, B., Guibas, L., Mitchell, J., Tal, A.: BOXTREE: a hierarchical representation for surfaces in 3D. Comput. Graph. Forum 15(3), 387–396 (1996)
Coons, S.: Surfaces for Computer-Aided Design. Technical report, MIT, 1964. Available as AD 663 504 from the National Technical Information Service. Springfield, VA, 22161
Ericson, C.: Real-Time Collision Detection. Morgan Kaufmann, San Francisco (2005)
Gottschalk, S., Lin, M., Manocha, D.: OBB-tree: a hierarchical structure for rapid interference detection. Computer Graphics (SIGGRAPH 1996), pp. 171–180 (1996)
Hubbard, P.: Collision detection for interactive graphics applications. IEEE Trans. Vis. Comput. Graph. 1(3), 218–230 (1995)
Kim, Y.-J., Oh, Y.-T., Yoon, S.-H., Kim, M.-S., Elber, G.: Precise Hausdorff distance computation for planar freeform curves using biarcs and depth buffer. Vis. Comput. 26(6–8), 1007–1016 (2010)
Kim, Y.-J., Lee, J., Kim, M.-S., Elber, G.: Efficient convex hull computation for planar freeform curves. Comput. Graph. 35(3), 698–705 (2011)
Kim, Y.-J., Oh, Y.-T., Yoon, S.-H., Kim, M.-S., Elber, G.: Coons BVH for freeform geometric models. ACM Trans. Graph. 30(6), Article 169, SIGGRAPH Asia (2011)
Kim, Y.-J., Lee, J., Kim, M.-S., Elber, G.: Efficient offset trimming for planar rational curves using biarc trees. Comput. Aided Geom. Des. 29(7), 555–564 (2012)
Kim, Y.-J., Oh, Y.-T., Yoon, S.-H., Kim, M.-S., Elber, G.: Efficient Hausdorff distance computation for freeform geometric models in close proximity. Comput.-Aided Des. 45(2), 270–276 (2013)
Kim, Y.-J., Kim, M.-S., Elber, G.: Precise convex hull computation for freeform models using a hierarchical Gauss map and a Coons bounding volume hierarchy. Comput.-Aided Des. 46(2), 252–257 (2014)
Klosowski, J., Held, M., Mitchell, J., Sowizral, H., Zikan, K.: Efficient collision detection using bounding volume hierarchies of k-dops. IEEE Trans. Vis. Comput. Graph. 4(1), 21–37 (1998)
Kumosenko, A.: Biarcs and bilens. Comput. Aided Geom. Des. 30(3), 310–330 (2013)
Larsen, E., Gottschalk, S., Lin, M.C., Manocha, D.: Fast proximity queries using swept sphere volumes. Technical report TR99-018, Dept. of Computer Science, UNC (1999)
Lee, J., Kim, Y.-J., KIm, M.-S., Elber, G.: Efficient offset trimming for deformable planar curves using a dynamic hierarchy of bounding circular arcs. Comput.-Aided Des. 58, 248–255 (2015)
Lin, Q., Rokne, J.G.: Approximation by fat arcs and fat biarcs. Comput.-Aided Des. 34(13), 969–979 (2002)
Meek, D., Walton, D.: Approximating smooth planar curves by arc splines. J. Comput. Appl. Math. 59(2), 221–231 (1995)
Palmer, I., Grimsdale, R.: Collision detection for animation using sphere-trees. Comput. Graph. Forum 14(2), 105–116 (1995)
Quinlan, S.: Efficient distance computation between non-convex objects. IEEE international conference on robotics and automation, pp. 3324–3329 (1994)
Sederberg, T.W., White, S.C., Zundel, A.K.: Fat arcs: a bounding region with cubic convergence. Comput. Aided Geom. Des. 6(3), 205–218 (1989)
Sir, Z., Feichtinger, R., Jüttler, B.: Approximating curves and their offsets using biarcs and Pythagorean hodograph quintics. Comput.-Aided Des. 38(6), 608–618 (2006)
van den Bergen, G.: Efficient collision detection of complex deformable models using AABB trees. J. Graph. Tools 2(4), 1–14 (1997)
Yong, J.-H., Chen, X., Paul, J.-C.: An example on approximation by fat arcs and fat biarcs. Comput.-Aided Des. 38(5), 515–517 (2006)
Acknowledgments
This work was supported in part by the People Programme (Marie Curie Actions) of the European Unions Seventh Framework Programme FP7/2007-2013/ under REA Grant agreement PIAP-GA-2011-286426, in part by the Israel Science Foundation (Grant No. 278/13), and also in part by the Korean MCST and KOCCA in the CT R&D Program 2014 (No. R2014060001), and in part by NRF Research Grants (No. 2013R1A1A2010085).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lee, J., Kim, YJ., Kim, MS. et al. Comparison of three bounding regions with cubic convergence to planar freeform curves. Vis Comput 31, 809–818 (2015). https://doi.org/10.1007/s00371-015-1093-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00371-015-1093-z