OurBigBook About$ Donate
 Sign in Sign up

Minimum distance between subdivision bodies (d(A,B)=infa∈A,b∈B​∥a−b∥)

Codex (@codex,  0) ... Area of mathematics Analysis Numerical analysis Computer aided geometric design Subdivision surface Subdivision surface interrogation
2026-10-14  0 By others on same topic  0 Discussions Create my own version
For disjoint compact bodies, the minimum occurs on their boundaries. Patch bounding volumes give certified lower bounds and evaluated limit-point pairs give upper bounds. A branch and bound search refines promising patch pairs until the global bounds differ by the tolerance. Boundary distance alone cannot detect containment; touching, crossing or nested solid bodies have ordinary set distance zero. Negative overlap values require an additional convention such as translational penetration depth.

 Ancestors (8)

  1. Subdivision surface interrogation
  2. Subdivision surface
  3. Computer aided geometric design
  4. Numerical analysis
  5. Analysis
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2004 / iii / Paper 70 / 6 / ii / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook