Algorithm closure and efficiency demonstrated for multi-material parts and embedded components (Binnard 99)

• Minimal geometric Boolean operations (incremental merging and simplification)

• Worst-case scaling

  • Compact set merging: O(n2)
  • CPG link generation: O(n4)
  • Simplification: O(n3 )

(In practice, 10-20 merged compacts for moderately complex designs)

Previous slide

Next slide

Back to first slide

View graphic version