2013
DOI: 10.1016/j.cad.2012.10.010
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Hausdorff Distance computation for freeform geometric models in close proximity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
9
0
1

Year Published

2014
2014
2022
2022

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 21 publications
(10 citation statements)
references
References 14 publications
0
9
0
1
Order By: Relevance
“…choice of the distance [25]. The distance chosen has to fulfil certain conditions, such as being robust against noise and outliers to ensure its trustworthiness, particularly when the objects are close to each other [26]. Furthermore, it should correspond to the problem under consideration, that is, shape recognition or image comparisons may require another definition than object matching applications [27].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…choice of the distance [25]. The distance chosen has to fulfil certain conditions, such as being robust against noise and outliers to ensure its trustworthiness, particularly when the objects are close to each other [26]. Furthermore, it should correspond to the problem under consideration, that is, shape recognition or image comparisons may require another definition than object matching applications [27].…”
Section: Introductionmentioning
confidence: 99%
“…Unfortunately, the traditional HD only provides a global measure of the distance and is known to be sensitive to outliers. Alternatives were proposed, including the Hausdorff quantile [32], for close objects [26], for the specific case of B-spline curves [33], spatially coherent matching [34] or the averaged Hausdorff distance (AHD; [27]).…”
Section: Introductionmentioning
confidence: 99%
“…Based on the methods in [34,35], they have extended to compute the Hausdorff distance between two B-spline curves. Based on matching a surface patch from one model to the other model which is the corresponding nearby surface patch, an algorithm for solving the Hausdorff distance between two freeform surfaces is presented in Kim et al [36], where a hierarchy of Coons patches and bilinear surfaces that approximate the NURBS surfaces with bounding volume is adopted. Of course, the common feature of geometric methods is that the ultimate solution accuracy is not very high.…”
Section: Introductionmentioning
confidence: 99%
“…For the design of efficient geometric algorithms for freeform NURBS surfaces, the Coons BVH construction (based on Coons patch approximation [6]) is highly effective, often demonstrating interactive-speed performance in computing minimum and Hausdorff distances and convex hulls [12,14,15]. Coons patches approximate NURBS surfaces considerably more tightly and thus have a higher approximation order than other regular shapes such as spheres and boxes.…”
Section: Introductionmentioning
confidence: 99%