Distance Measurements of CAD Models in Boundary Representation

The need to analyze and visualize distances between objects arises in many use cases. Although the problem to calculate the distance between two polygonal objects may sound simple, real-world scenarios with large models will always be challenging, but optimization techniques – such as space partitioning – can reduce the complexity of the average case significantly.

[1]  C. Preusche,et al.  A benchmarking suite for 6-DOF real time collision response algorithms , 2010, VRST '10.

[2]  Paolo Cignoni,et al.  MeshLab: an Open-Source Mesh Processing Tool , 2008, Eurographics Italian Chapter Conference.

[3]  Dieter W. Fellner,et al.  Abstand: Distance Visualization for Geometric Analysis , 2008 .

[4]  David P. Dobkin,et al.  The quickhull algorithm for convex hulls , 1996, TOMS.

[5]  Bernard H. Foing,et al.  3D structure of the Gusev Crater region , 2010 .

[6]  Yannis Manolopoulos,et al.  The BASIS System: A Benchmarking Approach for Spatial Index Structures , 1999, Spatio-Temporal Database Management.

[7]  Dinesh Manocha,et al.  OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.

[8]  Stefano Mottola,et al.  The Shape of Comet 67P/Churyumov-Gerasimenko from Rosetta/Osiris Images , 2014 .

[9]  Jun-Hai Yong,et al.  A cell-based algorithm for evaluating directional distances in GIS , 2010, Int. J. Geogr. Inf. Sci..

[10]  Gabriel Zachmann,et al.  A model for the expected running time of collision detection using AABBs trees , 2006, EGVE'06.

[11]  Dieter W. Fellner,et al.  A Benchmark for Distance Measurements , 2018, 2018 International Conference on Cyberworlds (CW).

[12]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[13]  Pierre Alliez,et al.  CGAL - The Computational Geometry Algorithms Library , 2011 .

[14]  Dinesh Manocha,et al.  Fast distance queries with rectangular swept sphere volumes , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[15]  Nick Holliman,et al.  Review of "Level of detail for 3D graphics" by David Luebke, Martin Reddy, Jonathan D. Cohen, Amitabh Varshney, Benjamin Watson, and Robert Heubner. Morgan Kaufmann , 2003 .

[16]  David R. Owen,et al.  Performance comparisons of tree‐based and cell‐based contact detection algorithms , 2007 .

[17]  Sean Quinlan,et al.  Efficient distance computation between non-convex objects , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[18]  Evan Shellshear,et al.  BVH Split Strategies for Fast Distance Queries , 2015 .

[19]  Herbert Edelsbrunner,et al.  Fast software for box intersections , 2000, SCG '00.

[20]  David H. Eberly,et al.  Geometric Tools for Computer Graphics , 2002 .

[21]  Yannis Manolopoulos,et al.  R-Trees: Theory and Applications , 2005, Advanced Information and Knowledge Processing.

[22]  Paolo Cignoni,et al.  Metro: Measuring Error on Simplified Surfaces , 1998, Comput. Graph. Forum.

[23]  Gino van den Bergen.  Efficient Collision Detection of Complex Deformable Models using AABB Trees , 1997, J. Graphics, GPU, & Game Tools.

[24]  James D. Murray,et al.  Encyclopedia of graphics file formats (2nd ed.) , 1996 .

[25]  Suprio Ray,et al.  Jackpine: A benchmark to evaluate spatial database performance , 2011, 2011 IEEE 27th International Conference on Data Engineering.

[26]  Joseph S. B. Mitchell,et al.  Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs , 1998, IEEE Trans. Vis. Comput. Graph..

[27]  Anil K. Jain,et al.  A modified Hausdorff distance for object matching , 1994, Proceedings of 12th International Conference on Pattern Recognition.

[28]  Ivana Kolingerová,et al.  A cell-based point-in-polygon algorithm suitable for large sets of points , 2001 .

[29]  Tomas Akenine-Möller,et al.  Bounding Volume Hierarchies of Slab Cut Balls , 2009, Comput. Graph. Forum.