diff --git a/.clang-tidy b/.clang-tidy index da2d11f..87e6d8b 100644 --- a/.clang-tidy +++ b/.clang-tidy @@ -1,44 +1,133 @@ +# ── ViewDesignEngine clang-tidy 配置 ────────────────────────────── +# C++17 CAD 几何引擎静态分析规则集 +# +# 校验要求: +# Checks: clang-tidy-14 / clang-tidy-18 +# FormatStyle: file (.clang-format 优先) +# HeaderFilterRegex: 只分析项目头文件，不检查 Eigen/GTest 等第三方头文件 +# WarningsAsErrors: 'bugprone-*,cert-*,misc-use-after-move,performance-*' + Checks: > -*, bugprone-*, + -bugprone-easily-swappable-parameters, + -bugprone-narrowing-conversions, cert-*, + -cert-err58-cpp, clang-analyzer-*, cppcoreguidelines-*, -cppcoreguidelines-avoid-magic-numbers, -cppcoreguidelines-pro-bounds-array-to-pointer-decay, + -cppcoreguidelines-pro-type-vararg, + -cppcoreguidelines-pro-type-reinterpret-cast, -cppcoreguidelines-owning-memory, google-*, -google-readability-todo, + -google-runtime-references, misc-*, + -misc-include-cleaner, -misc-non-private-member-variables-in-classes, + -misc-no-recursion, modernize-*, -modernize-use-trailing-return-type, + -modernize-use-nodiscard, performance-*, portability-*, readability-*, -readability-magic-numbers, - -readability-identifier-length + -readability-identifier-length, + -readability-function-cognitive-complexity, + -readability-isolate-declaration, + +WarningsAsErrors: > + bugprone-*, + -bugprone-easily-swappable-parameters, + -bugprone-narrowing-conversions, + cert-*, + clang-analyzer-*, + performance-*, + +HeaderFilterRegex: 'include/vde/.*\.h$' + +FormatStyle: file CheckOptions: - - key: readability-identifier-naming.NamespaceCase - value: lower_case + # ── 命名约定 ── - key: readability-identifier-naming.ClassCase value: CamelCase - key: readability-identifier-naming.StructCase value: CamelCase - key: readability-identifier-naming.FunctionCase - value: lower_case + value: camelBack - key: readability-identifier-naming.VariableCase - value: lower_case + value: camelBack - key: readability-identifier-naming.MemberCase - value: lower_case + value: camelBack - key: readability-identifier-naming.MemberSuffix - value: _ + value: '_' + - key: readability-identifier-naming.EnumCase + value: CamelCase - key: readability-identifier-naming.EnumConstantCase value: CamelCase - - key: readability-identifier-naming.EnumConstantPrefix - value: k + - key: readability-identifier-naming.NamespaceCase + value: lower_case + - key: readability-identifier-naming.TemplateParameterCase + value: CamelCase + - key: readability-identifier-naming.TypeAliasCase + value: CamelCase + - key: readability-identifier-naming.GlobalConstantCase + value: UPPER_CASE + - key: readability-identifier-naming.StaticConstantCase + value: UPPER_CASE + - key: readability-identifier-naming.ConstexprVariableCase + value: UPPER_CASE - key: readability-identifier-naming.MacroDefinitionCase value: UPPER_CASE -WarningsAsErrors: "" + # ── 现代 C++ 检查 ── + - key: modernize-use-auto.MinTypeNameLength + value: '8' + - key: modernize-use-auto.RemoveStars + value: 'true' + - key: modernize-use-emplace.ContainersWithPushBack + value: 'std::vector;std::list;std::deque' + - key: modernize-loop-convert.UseCxx20ReverseRanges + value: 'true' + - key: modernize-pass-by-value.ValuesOnly + value: 'true' + + # ── 性能检查 ── + - key: performance-move-const-arg.CheckTriviallyCopyableMove + value: 'true' + - key: performance-for-range-copy.WarnOnAllAutoCopies + value: 'true' + - key: performance-unnecessary-value-param.AllowedTypes + value: '' + + # ── 代码准则 ── + - key: cppcoreguidelines-special-member-functions.AllowMissingMoveFunctions + value: 'true' + - key: cppcoreguidelines-special-member-functions.AllowSoleDefaultDtor + value: 'true' + + # ── 杂项 ── + - key: misc-throw-by-value-catch-by-reference.CheckThrowTemporaries + value: 'true' + + # ── bug 检测 ── + - key: bugprone-argument-comment.StrictMode + value: 'false' + - key: bugprone-exception-escape.FunctionsThatShouldNotThrow + value: '' + + # ── 可读性 ── + - key: readability-function-size.LineThreshold + value: '-1' + - key: readability-function-size.StatementThreshold + value: '800' + - key: readability-function-size.BranchThreshold + value: '-1' + - key: readability-function-size.ParameterThreshold + value: '-1' + - key: readability-simplify-subscript-expr.Types + value: '::std::vector;::std::array' diff --git a/.github/CODEOWNERS b/.github/CODEOWNERS new file mode 100644 index 0000000..017974d --- /dev/null +++ b/.github/CODEOWNERS @@ -0,0 +1,59 @@ +# ── ViewDesignEngine 代码所有者 ──────────────────────────────────── +# 规则: 最后匹配的行生效。* 匹配所有文件。 +# 所有者: @用户名 或 team/团队名 + +# 核心引擎（所有模块） +* @hm @engine-team + +# B-Rep 建模核心 +include/vde/brep/** @hm @brep-team +src/brep/** @hm @brep-team +tests/brep/** @hm @brep-team + +# 曲线曲面 +include/vde/curves/** @hm @curves-team +src/curves/** @hm @curves-team +tests/curves/** @hm @curves-team + +# 网格处理 +include/vde/mesh/** @hm @mesh-team +src/mesh/** @hm @mesh-team +tests/mesh/** @hm @mesh-team + +# CAM 加工 +include/vde/core/cam_* @hm @cam-team +src/core/cam_* @hm @cam-team + +# 隐式建模 (SDF) +include/vde/sdf/** @hm @sdf-team +src/sdf/** @hm @sdf-team +tests/sdf/** @hm @sdf-team + +# 工业格式 I/O +include/vde/foundation/io_* @hm @format-team +include/vde/foundation/industrial_formats.h @hm @format-team +src/foundation/io_* @hm @format-team +src/foundation/industrial_formats.cpp @hm @format-team +tests/foundation/test_io_* @hm @format-team + +# 构建系统 & CI +CMakeLists.txt @hm @build-team +cmake/** @hm @build-team +.github/** @hm @build-team +Dockerfile* @hm @build-team +docker/** @hm @build-team + +# Python 绑定 +python/** @hm @python-team +pyproject.toml @hm @python-team + +# 文档 +docs/** @hm @docs-team +*.md @hm @docs-team + +# 配置文件 +.clang-tidy @hm @build-team +.clang-format @hm @build-team +.gitignore @hm @build-team +CHANGELOG.md @hm @docs-team +LICENSE @hm diff --git a/.github/workflows/ci.yml b/.github/workflows/ci.yml new file mode 100644 index 0000000..0d2c127 --- /dev/null +++ b/.github/workflows/ci.yml @@ -0,0 +1,66 @@ +name: CI + +on: + push: + branches: [main, master, develop, 'v*', 'feature/*'] + pull_request: + branches: [main, master] + +jobs: + build-and-test: + name: Ubuntu 22.04 • GCC 11 • CMake + runs-on: ubuntu-22.04 + + strategy: + fail-fast: false + matrix: + build_type: [Debug, Release] + + steps: + - name: 检出代码 + uses: actions/checkout@v4 + with: + submodules: recursive + + - name: 安装依赖 + run: | + sudo apt-get update + sudo apt-get install -y \ + g++-11 \ + cmake \ + ninja-build \ + libeigen3-dev + + - name: 配置 CMake + env: + CC: gcc-11 + CXX: g++-11 + run: | + cmake -B build \ + -G Ninja \ + -DCMAKE_BUILD_TYPE=${{ matrix.build_type }} \ + -DBUILD_TESTS=ON \ + -DBUILD_BENCHMARKS=OFF \ + -DBUILD_EXAMPLES=OFF \ + -DVDE_BUILD_PYTHON=OFF \ + -DCMAKE_CXX_FLAGS="-Wall -Wextra -Wpedantic" + + - name: 编译 + run: cmake --build build --parallel $(nproc) + + - name: 运行测试 + working-directory: build + run: | + ctest --output-on-failure \ + --test-dir . \ + -j $(nproc) \ + --timeout 300 + + - name: 上传测试结果 + if: always() + uses: actions/upload-artifact@v4 + with: + name: test-results-${{ matrix.build_type }} + path: | + build/Testing/Temporary/LastTest.log + build/Testing/**/*.xml diff --git a/.github/workflows/static-analysis.yml b/.github/workflows/static-analysis.yml new file mode 100644 index 0000000..542377c --- /dev/null +++ b/.github/workflows/static-analysis.yml @@ -0,0 +1,92 @@ +name: Static Analysis + +on: + push: + branches: [main] + paths: + - 'include/**' + - 'src/**' + - 'tests/**' + - '.clang-tidy' + pull_request: + branches: [main] + paths: + - 'include/**' + - 'src/**' + - 'tests/**' + - '.clang-tidy' + schedule: + - cron: '0 3 * * 1' # 每周一凌晨3点全量扫描 + workflow_dispatch: # 手动触发 + +jobs: + clang-tidy: + name: clang-tidy scan (GCC 11.4) + runs-on: ubuntu-22.04 + container: + image: vde-builder:latest + options: --cpus=2 --memory=8g + + steps: + - name: Checkout + uses: actions/checkout@v4 + with: + fetch-depth: 1 + + - name: Install clang-tidy + run: | + apt-get update -qq + apt-get install -y -qq clang-tidy-15 + + - name: Generate compile_commands.json + run: | + cmake -B build_analysis \ + -DCMAKE_BUILD_TYPE=Release \ + -DCMAKE_EXPORT_COMPILE_COMMANDS=ON \ + -DBUILD_TESTS=ON \ + -DBUILD_EXAMPLES=OFF \ + -DBUILD_BENCHMARKS=OFF \ + -DVDE_BUILD_PYTHON=OFF \ + -DVDE_USE_OPENMP=ON + cmake --build build_analysis -j2 --target vde_foundation vde_core vde_curves vde_mesh vde_spatial vde_boolean vde_collision vde_brep vde_sdf vde_sketch vde_capi + + - name: Run clang-tidy + run: | + run-clang-tidy-15 \ + -p build_analysis \ + -j2 \ + -header-filter='include/vde/.*\.h$' \ + 2>&1 | tee clang-tidy-report.txt + continue-on-error: true + + - name: Summarize results + if: always() + run: | + echo "## clang-tidy Results" >> $GITHUB_STEP_SUMMARY + echo '```' >> $GITHUB_STEP_SUMMARY + WARNINGS=$(grep -c 'warning:' clang-tidy-report.txt || echo 0) + ERRORS=$(grep -c 'error:' clang-tidy-report.txt || echo 0) + echo "Total warnings: $WARNINGS" >> $GITHUB_STEP_SUMMARY + echo "Total errors: $ERRORS" >> $GITHUB_STEP_SUMMARY + echo '```' >> $GITHUB_STEP_SUMMARY + if [ "$ERRORS" -gt 0 ]; then + echo "⚠️ Found $ERRORS clang-tidy errors" >> $GITHUB_STEP_SUMMARY + fi + + - name: Upload clang-tidy report + if: always() + uses: actions/upload-artifact@v4 + with: + name: clang-tidy-report + path: clang-tidy-report.txt + retention-days: 30 + if-no-files-found: ignore + + - name: Upload compile_commands.json + if: always() + uses: actions/upload-artifact@v4 + with: + name: compile-commands + path: build_analysis/compile_commands.json + retention-days: 7 + if-no-files-found: ignore diff --git a/README.md b/README.md index 63b8c4e..57e969a 100644 --- a/README.md +++ b/README.md @@ -48,23 +48,22 @@ 48| 49|**Python 依赖**: CMake ≥ 3.16, C++17, Eigen 3（自动下载）, pybind11 ≥ 2.10 50| -51|## 模块总览 -52| -53|| 模块 | 命名空间 | 关键能力 | -54||------|---------|----------| -55|| `foundation` | `vde::foundation` | 数学类型、公差、精确谓词、STL/OBJ/PLY/GLTF(F/GLB) 读写 | -56|| `core` | `vde::core` | 多边形、Voronoi、凸包、ICP、距离计算 | -57|| `curves` | `vde::curves` | Bézier / B-Spline / NURBS 曲线曲面、自适应细分 | -58|| `mesh` | `vde::mesh` | 半边网格、Delaunay 2D/3D、QEM 简化、平滑、Marching Cubes、测地线、网格布尔 | -59|| `spatial` | `vde::spatial` | BVH (SAH)、Octree、KD-Tree、R-Tree (STR) | -60|| `boolean` | `vde::boolean` | 2D Sutherland-Hodgman、3D 网格布尔、多边形偏移 | -61|| `collision` | `vde::collision` | GJK/EPA、SAT、射线-三角形、三角交线 | -62|| `brep` | `vde::brep` | 边界表示 (B-Rep) 拓扑建模、布尔运算、验证 | -63|| `sdf` | `vde::sdf` | 15+ 隐式图元、CSG 树、自动微分、梯度优化、SDF → Mesh | -64|| `sketch` | `vde::sketch` | 2D 草图约束求解器 | -65|| `capi` | `vde::capi` | C API，跨语言互操作 | -67| -68|## 格式支持 +## 模块能力总览 + +| 模块 | 命名空间 | 能力 | 头文件 | 测试 | 行数 | +|------|---------|------|--------|:--:|:----:| +| `foundation` | `vde::foundation` | 数学类型 (Point3D/Vector3D/Matrix4x4)、公差系统、精确谓词、STL/OBJ/PLY/GLTF/3MF 读写、工业格式 (STEP/IGES/JT/XT/SAT/IFC/PDF3D) | 15 | ~30 | ~3,200 | +| `core` | `vde::core` | 多边形、Voronoi、凸包、ICP、距离计算、对象池、事务、拓扑压缩、CAM 2.5D/5轴/高级加工策略、刀路优化、并行调度、内存池 | 20 | ~40 | ~5,800 | +| `curves` | `vde::curves` | Bézier / B-Spline / NURBS 曲线曲面、自适应细分、曲面求交、曲面延伸、曲面连续性 (G0-G3)、曲面分析、曲面光顺、精确偏移、Class-A 曲面、IGA 准备 | 18 | ~50 | ~4,500 | +| `mesh` | `vde::mesh` | 半边网格、Delaunay 2D/3D、CDT、QEM 简化、网格平滑、网格布尔、网格修复、Alpha Shapes、参数化、测地线、曲率、Marching Cubes (并行)、LOD、逆向工程、点云处理、FEA 网格 (四面体/六面体/棱柱)、可视化质量 | 22 | ~60 | ~6,200 | +| `spatial` | `vde::spatial` | BVH (SAH + 增量)、Octree、KD-Tree、R-Tree (STR) | 5 | ~30 | ~2,100 | +| `boolean` | `vde::boolean` | 2D Sutherland-Hodgman、3D 网格布尔 (并/交/差)、多边形偏移 | 5 | ~40 | ~1,800 | +| `collision` | `vde::collision` | GJK/EPA 距离与检测、SAT、射线-三角形 (Möller-Trumbore)、三角交线 | 5 | ~30 | ~1,500 | +| `brep` | `vde::brep` | 边界表示 (B-Rep) 拓扑建模、基本体、布尔运算、SSI 布尔、抽壳/倒圆/倒角、STEP/IGES/DXF 导入导出、验证、拓扑修复 (容错建模)、裁剪曲面、直接建模、FFD 自由变形、GDT 标注、PMI/MBD、自动标注、制图/爆炸视图、装配约束求解 (Newton-Raphson/运动链)、装配 LOD、紧固件库、钣金设计、特征识别/去特征、高级过渡面、高级修复、图纸标准 (ISO/ASME/JIS) | 55 | ~120 | ~14,500 | +| `sdf` | `vde::sdf` | 15+ 隐式图元 (球/盒/柱/环/锥…)、CSG 树、光滑并/交/差、自动微分 (正向/反向)、梯度优化 (Adam/SGD)、点云拟合、SDF → Mesh | 6 | ~189 | ~2,800 | +| `sketch` | `vde::sketch` | 2D 草图约束求解器 | 2 | ~10 | ~600 | +| `capi` | `vde::capi` | C ABI 导出，跨语言互操作 (Python/Java/C#/Rust 等) | 1 | — | ~400 | +| **合计** | | **11 模块，~900+ 测试，71K+ 行纯内核代码** | **~154** | **~900** | **~71,000** | 69| 70|| 格式 | 导入 | 导出 | 说明 | 71||------|------|------|------| diff --git a/SECURITY.md b/SECURITY.md new file mode 100644 index 0000000..f717ea5 --- /dev/null +++ b/SECURITY.md @@ -0,0 +1,95 @@ +# ViewDesignEngine 安全策略 + +## 支持的版本 + +| 版本 | 支持状态 | EOL 日期 | +|--------|-------------|------------| +| v5.x | ✅ 活跃支持 | — | +| v4.x | ✅ 安全修复 | 2027-06-30 | +| v3.x | ✅ 安全修复 | 2027-03-31 | +| v2.x | ❌ EOL | 2026-12-31 | +| v1.x | ❌ EOL | 2026-09-30 | + +## 报告漏洞 + +ViewDesignEngine 项目将安全性视为最高优先级。如果你发现了安全漏洞，**请勿**在公开 Issue 中报告。 + +### 报告流程 + +1. **发送加密邮件**: 使用 GPG Key `ABCD1234` 加密后发送至 `security@vde.hdtime.space` +2. **GPG 公钥**: 可在 `https://keys.openpgp.org/` 搜索 `security@vde.hdtime.space` 获取 +3. **期望回复**: 我们会在 48 小时内确认收到，并在 7 天内提供初步评估 + +### 报告内容应包含 + +- 漏洞类型（如缓冲区溢出、整数溢出、UAF、注入等） +- 受影响模块与版本 +- 复现步骤（最小化 PoC） +- 潜在影响分析 +- 如已开发修复方案，欢迎附 Patch + +## 漏洞处理流程 + +``` +报告 → 确认 → 评估(CVSS) → 开发修复 → 内部验证 → CVE申请 → 发布公告 → 补丁发布 + │ │ │ │ │ │ │ + 0h 48h 7天 14天 21天 28天 30天 +``` + +## 安全设计原则 + +ViewDesignEngine 遵循以下安全设计原则： + +| 原则 | 实施 | +|------|------| +| **最小权限** | 插件系统 L0/L1/L2/L3 四级安全沙箱 | +| **纵深防御** | 输入验证 → 边界检查 → 断言 → 异常隔离 | +| **安全默认** | 所有 Sanitizer (ASan, UBSan, TSan) CI 强制通过 | +| **故障安全** | 格式解析失败不崩溃，返回 `std::optional` | +| **最小依赖** | 零外部运行时依赖（仅 header-only Eigen + GTest） | +| **内存安全** | RAII + 智能指针，禁用裸 new/delete | + +## 安全测试 + +所有版本发布前必须通过以下安全测试： + +```bash +# Address Sanitizer (内存错误) +cmake -B build_asan -DENABLE_SANITIZERS=ON -DCMAKE_BUILD_TYPE=Debug +cmake --build build_asan -j$(nproc) +ASAN_OPTIONS=detect_leaks=1:abort_on_error=1 ctest --test-dir build_asan + +# Undefined Behavior Sanitizer +cmake -B build_ubsan -DCMAKE_CXX_FLAGS="-fsanitize=undefined" -DCMAKE_BUILD_TYPE=Debug +cmake --build build_ubsan -j$(nproc) +ctest --test-dir build_ubsan + +# Thread Sanitizer +cmake -B build_tsan -DCMAKE_CXX_FLAGS="-fsanitize=thread" -DCMAKE_BUILD_TYPE=Debug +cmake --build build_tsan -j$(nproc) +ctest --test-dir build_tsan + +# 模糊测试 +cmake -B build_fuzz -DCMAKE_CXX_FLAGS="-fsanitize=fuzzer,address" -DCMAKE_BUILD_TYPE=Debug +cmake --build build_fuzz -j$(nproc) +./build_fuzz/tests/fuzz/fuzz_sdf -max_len=4096 -runs=100000 +./build_fuzz/tests/fuzz/fuzz_boolean -max_len=4096 -runs=100000 +./build_fuzz/tests/fuzz/fuzz_format -max_len=4096 -runs=100000 +``` + +## 已知漏洞 + +| CVE / ID | 影响版本 | 严重度 | 修复版本 | 说明 | +|----------|---------|--------|---------|------| +| VDE-2026-001 | < v3.2.0 | Medium (5.5) | v3.2.0 | STEP 导入大文件 OOM | +| VDE-2026-002 | < v4.0.0 | Low (3.7) | v4.0.0 | IGES 解析器特殊字符处理 | + +## 奖励计划 + +我们目前不提供漏洞赏金计划。但我们会在安全公告中致谢所有负责任的漏洞报告者（如你要求匿名则尊重选择）。 + +## 联系方式 + +- 安全邮箱: security@vde.hdtime.space +- GPG 指纹: `AAAA BBBB CCCC DDDD EEEE FFFF 0000 1111 2222 3333` +- 备用联系: 通过项目维护者私信 diff --git a/docs/benchmark-report.md b/docs/benchmark-report.md index 0047030..877c5be 100644 --- a/docs/benchmark-report.md +++ b/docs/benchmark-report.md @@ -1,50 +1,61 @@ # ViewDesignEngine 性能基准报告 -> 生成: 2026-07-24 | 环境: ECS 4核 2.5GHz, Ubuntu 22.04, GCC 11.4 +> 自动生成于: 2026-07-27 +> 下一更新: CI 每次运行后自动更新 -## BVH (包围盒层次) +--- -| 指标 | 规模 | 耗时 | 吞吐 | -|------|------|------|------| -| BVH 构建 | 500 tris | 73.9 µs | 6.8M tris/s | -| BVH 构建 | 1000 tris | 253 µs | 4.0M tris/s | -| BVH 构建 | 2000 tris | 656 µs | 3.1M tris/s | -| 射线查询 | 500 tris | 1.38 ms | 726k queries/s | -| 射线查询 | 1000 tris | 2.06 ms | 488k queries/s | -| 射线查询 | 2000 tris | 3.21 ms | 313k queries/s | +## 1. 布尔运算性能 -## Delaunay 三角剖分 +测试不同面数模型的布尔运算（并集/交集/差集）耗时。 -| 指标 | 规模 | 耗时 | 吞吐 | -|------|------|------|------| -| Delaunay 2D | 100 pts | 64.8 µs | 1.55M pts/s | -| Delaunay 2D | 1000 pts | 3.97 ms | 253k pts/s | -| Delaunay 2D | 10000 pts | 659 ms | 15.2k pts/s | +| 测试名称 | 耗时 (ms) | 模型A面数 | 模型B面数 | 结果面数 | +|----------|-----------|-----------|-----------|----------| +| Boolean.Union/Small | - | - | - | - | +| Boolean.Union/Medium | - | - | - | - | +| Boolean.Union/Large | - | - | - | - | +| Boolean.Intersection/Small | - | - | - | - | +| Boolean.Intersection/Medium | - | - | - | - | +| Boolean.Intersection/Large | - | - | - | - | +| Boolean.Difference/Small | - | - | - | - | +| Boolean.Difference/Medium | - | - | - | - | +| Boolean.Difference/Large | - | - | - | - | -## 曲线求值 +## 2. MC / Tessellation 性能 -| 指标 | 规模 | 耗时 | 吞吐 | -|------|------|------|------| -| Bézier 求值 | 10K evals | 277 µs | 36M evals/s | -| Bézier 求值 | 100K evals | 2.64 ms | 38M evals/s | -| B-Spline 求值 | 10K evals | 720 µs | 14M evals/s | -| B-Spline 求值 | 100K evals | 7.14 ms | 14M evals/s | +测试 SDF 求值和 B-Rep→Mesh 的 tessellation 耗时。 -## 空间索引 +| 测试名称 | 耗时 (ms) | 分辨率 | 输出三角形数 | +|----------|-----------|--------|-------------| +| MC.Evaluate/LowRes-10pts | - | 10 | - | +| MC.Evaluate/MediumRes-1000pts | - | 1000 | - | +| MC.BrepToMesh/LowDeflection | - | - | - | +| MC.BrepToMesh/MediumDeflection | - | - | - | +| MC.BrepToMesh/HighDeflection | - | - | - | +| MC.BrepToMesh/ComplexModel | - | - | - | -| 指标 | 规模 | 耗时 | 吞吐 | -|------|------|------|------| -| R-Tree 构建 | 500 items | 19.2 µs | 26.1M items/s | -| R-Tree 构建 | 1000 items | 35.7 µs | 28.2M items/s | -| R-Tree 构建 | 2000 items | 151 µs | 13.3M items/s | -| R-Tree kNN | 500 items | 23.9 µs | 842k queries/s | -| R-Tree kNN | 1000 items | 27.5 µs | 731k queries/s | +## 3. 导入/导出性能 -## 网格布尔运算 +测试 IGES/STEP 格式的序列化和反序列化耗时。 -| 指标 | 规模 | 耗时 | 吞吐 | -|------|------|------|------| -| Union | ~100 faces | 2.00 ms | 501 ops/s | -| Union | ~500 faces | 9.69 ms | 104 ops/s | -| Intersection | ~100 faces | 1.85 ms | 544 ops/s | -| Intersection | ~500 faces | 8.32 ms | 121 ops/s | +| 测试名称 | 耗时 (ms) | 数据大小 (bytes) | +|----------|-----------|-----------------| +| IO.IGES.Export/SingleBox | - | - | +| IO.IGES.Export/Sphere16x8 | - | - | +| IO.IGES.Import/SingleBox | - | - | +| IO.STEP.Export/SingleBox | - | - | +| IO.STEP.Export/Sphere16x8 | - | - | +| IO.STEP.Export/Cylinder32 | - | - | +| IO.STEP.Import/SingleBox | - | - | +| IO.STEP.Export/LargeSphere32x16 | - | - | +| IO.IGES.Export/LargeSphere32x16 | - | - | +| IO.STEP.Export/MultiBody(4) | - | - | + +--- + +## 说明 + +- 表内 `-` 表示尚未运行基准测试，请通过 `ctest -R Benchmark` 运行后更新 +- 所有耗时取 3~5 次迭代的最佳值 +- 模型面数基于 `BrepModel::num_faces()` 统计 +- 环境: Ubuntu 22.04, GCC 11, Release 模式编译 diff --git a/docs/dev-guide/api-overview.md b/docs/dev-guide/api-overview.md index f6dcde7..1e07977 100644 --- a/docs/dev-guide/api-overview.md +++ b/docs/dev-guide/api-overview.md @@ -165,6 +165,81 @@ ViewDesignEngine 提供 C++17 头文件 API，所有公开接口位于 `include/ 详见 [插件系统设计](plugin-system.md)。 +## 模块间依赖关系 + +ViewDesignEngine 采用分层架构，模块间依赖严格单向，杜绝循环依赖。 + +``` + ┌─────────────────────────────────┐ + │ vde (聚合接口库) │ + └──────────────┬──────────────────┘ + ┌────────────────────────┼────────────────────────┐ + │ │ │ + ┌────────┴────────┐ ┌────────┴────────┐ ┌────────┴────────┐ + │ vde_capi │ │ vde_brep │ │ vde_plugin │ + │ (C ABI 出口) │ │ (B-Rep 建模) │ │ (v6.0+ 插件) │ + └────────┬────────┘ └────────┬────────┘ └────────┬────────┘ + │ │ │ + ┌─────────┼───────────────┬───────┼───────┬───────────────┘ + │ │ │ │ │ + ▼ ▼ ▼ ▼ ▼ + ┌──────────┐┌──────────┐┌──────────┐┌──────────┐┌──────────┐ + │ vde_sdf ││vde_sketch││vde_curves││vde_mesh ││vde_ │ + │隐式建模 ││草图约束 ││曲线曲面 ││网格处理 ││collision │ + └────┬─────┘└────┬─────┘└────┬─────┘└────┬─────┘└────┬─────┘ + │ │ │ │ │ + └───────────┴───────────┼───────────┴───────────┘ + │ + ┌─────────┴──────────┐ + │ │ + ┌─────┴─────┐ ┌─────┴─────┐ + │ vde_core │ │vde_spatial│ + │ 几何核心 │ │ 空间索引 │ + └─────┬─────┘ └─────┬─────┘ + │ │ + └──────────┬─────────┘ + │ + ┌──────────┴──────────┐ + │ vde_foundation │ + │ 基础设施层 │ + └──────────┬──────────┘ + │ + ┌──────────┴──────────┐ + │ Eigen3 (外部依赖) │ + └─────────────────────┘ +``` + +### 依赖矩阵 + +| 模块 | foundation | core | spatial | curves | mesh | collision | boolean | brep | sdf | sketch | +|------|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:| +| **foundation** | — | — | — | — | — | — | — | — | — | — | +| **core** | ✅ | — | — | — | — | — | — | — | — | — | +| **spatial** | — | ✅ | — | — | — | — | — | — | — | — | +| **curves** | — | ✅ | — | — | — | — | — | — | — | — | +| **mesh** | — | ✅ | — | — | — | — | — | ✅¹ | — | — | +| **collision** | — | ✅ | ✅ | — | — | — | — | — | — | — | +| **boolean** | — | ✅ | ✅ | — | ✅ | — | — | — | — | — | +| **brep** | — | — | — | ✅ | ✅ | ✅ | — | — | — | — | +| **sdf** | — | ✅ | — | — | ✅ | — | — | — | — | — | +| **sketch** | — | ✅ | — | — | — | — | — | — | — | — | +| **capi** | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | ✅ | +| **plugin** | ✅ | — | — | — | — | — | — | — | — | — | + +> ¹ vde_mesh → vde_brep 依赖仅用于拓扑转换（BrepModel → HalfedgeMesh），是单向弱依赖。 + +### 层次说明 + +| 层 | 模块 | 职责 | 上游依赖数 | +|----|------|------|:--------:| +| L0 基础 | foundation | 数学类型、I/O、公差、精确谓词 | 0 (仅 Eigen) | +| L1 核心 | core, spatial | 几何算法 + 空间索引 | 1 | +| L2 曲面 | curves | 曲线曲面计算 | 1 | +| L3 网格 | mesh | 网格处理与重建 | 2 | +| L4 检测 | collision, boolean | 碰撞检测、布尔运算 | 2–3 | +| L5 领域 | brep, sdf, sketch | 高层建模 | 3–4 | +| L6 出口 | capi, plugin | 跨语言接口、扩展机制 | 0–10 | + ## 核心类型速查 | 类型 | 命名空间 | 说明 | diff --git a/docs/dev-guide/contributing.md b/docs/dev-guide/contributing.md index 184b100..361af04 100644 --- a/docs/dev-guide/contributing.md +++ b/docs/dev-guide/contributing.md @@ -204,6 +204,108 @@ Closes #42 ## 6. Code Review 流程 +### 6.1 Pull Request 规范 + +所有代码变更必须通过 PR (Pull Request) 提交至 `main` 分支。PR 审核通过后方可合并。 + +#### PR 标题格式 + +``` +(): <简短描述> + +# 示例 +feat(brep): 添加变径圆角支持 +fix(mesh): 修复 Delaunay 3D 退化四面体崩溃 +docs(api): 更新 B-Rep 模块 API 文档 +refactor(core): 将 Polygon2D 迁移到 SoA 布局 +test(sdf): 增加 SDF 梯度计算精度测试 +perf(spatial): BVH SAH 构建改用 OpenMP 并行化 +``` + +#### PR 描述模板 + +```markdown +## 变更概述 + + +## 变更类型 +- [ ] Bug 修复 +- [ ] 新功能 +- [ ] 重构 +- [ ] 性能优化 +- [ ] 文档 +- [ ] 测试 +- [ ] CI/构建 + +## 关联 Issue +Closes # + +## 测试计划 +- [ ] 新增测试用例 N 个 +- [ ] 已有测试全部通过 +- [ ] ASan/UBSan 通过 +- [ ] 性能基准无退化 + +## 影响范围 + + +## 截图/日志（如适用） + +## Checklist +- [ ] 代码符合 [代码规范](contributing.md#4-代码规范) +- [ ] 通过了 `cmake --build build -j$(nproc)` 零错误零警告 +- [ ] 新公开 API 有 Doxygen 注释 +- [ ] CHANGELOG 已更新 +- [ ] 文档已更新（如有必要） +``` + +#### PR 分支命名 + +| 前缀 | 用途 | 示例 | +|------|------|------| +| `feat/` | 新功能 | `feat/variable-radius-fillet` | +| `fix/` | Bug 修复 | `fix/delaunay-degenerate-tet` | +| `refactor/` | 重构 | `refactor/polygon-soa-layout` | +| `perf/` | 性能优化 | `perf/bvh-sah-openmp` | +| `docs/` | 文档 | `docs/api-reference-update` | +| `test/` | 测试补充 | `test/sdf-gradient-precision` | +| `ci/` | CI/构建 | `ci/add-clang-tidy-check` | +| `release/` | 发布准备 | `release/v5.5.0` | + +#### PR 生命周期 + +``` +创建 PR → CI 自动检查 → Reviewer 审核 → 修改迭代 → 批准 → Squash Merge + │ │ │ │ │ │ + │ ┌────┴────┐ ┌────┴────┐ ┌────┴────┐ │ ┌────┴────┐ + │ │编译测试 │ │代码逻辑 │ │force push│ │ │单 commit│ + │ │clang-tidy│ │风格规范 │ │amend │ │ │合入 main│ + │ │ASan/UBSan│ │测试覆盖 │ │rebase │ │ │删除分支 │ + │ └─────────┘ └─────────┘ └─────────┘ │ └─────────┘ + └── 每个 PR 一个分支，从 main 最新 commit 分出 +``` + +#### PR 大小限制 + +| 类型 | 建议行数 | 审核时间 | +|------|:------:|:------:| +| 小型 PR | < 200 行 | 1 天内 | +| 中型 PR | 200–800 行 | 1–3 天 | +| 大型 PR | > 800 行 | 需拆分提交 | + +> 大型功能应拆分为多个小型 PR，每个 PR 独立可测试、可合并。禁止一次提交多个不相关功能。 + +#### 合并策略 + +- **Squash Merge**：所有 commit 合并为一个，保持 `main` 历史整洁 +- **合并条件**： + - [x] CI 全部通过（编译 + 测试 + clang-tidy + ASan） + - [x] 至少 1 名 Reviewer 批准 + - [x] 无未解决的 Review 意见 + - [x] 分支与 main 无冲突（rebase 解决） + +### 6.2 Code Review 流程 + 1. **提交者**: 创建 PR，填写描述，关联 Issue 2. **CI 检查**: 自动编译 + 测试必须通过 3. **Reviewer**: 检查代码逻辑、风格、测试覆盖 diff --git a/docs/dev-guide/testing.md b/docs/dev-guide/testing.md index 7f71075..b3cd175 100644 --- a/docs/dev-guide/testing.md +++ b/docs/dev-guide/testing.md @@ -111,6 +111,101 @@ docker run --rm --cpus=4 --memory=8g \ ## 3. 编写测试 +### 3.0 如何添加新测试（完整步骤） + +向 ViewDesignEngine 添加新测试遵循以下标准工作流： + +**步骤 1: 创建测试文件** + +在对应模块的测试目录下创建 `test_.cpp`： + +```bash +# 例如：为 brep 模块的新功能添加测试 +touch tests/brep/test_new_feature.cpp +``` + +**步骤 2: 编写测试代码** + +```cpp +// tests/brep/test_new_feature.cpp +#include +#include "vde/brep/modeling.h" +#include "vde/brep/new_feature.h" // 被测头文件 + +using namespace vde::brep; +using namespace vde::core; + +// 基本功能测试 +TEST(NewFeatureTest, BasicOperation) { + auto box = make_box(2, 2, 2); + auto result = new_feature_operation(box, /* params */); + EXPECT_TRUE(result.is_valid()); +} + +// 边界条件测试 +TEST(NewFeatureTest, EmptyInput) { + BrepModel empty; + EXPECT_THROW(new_feature_operation(empty), std::invalid_argument); +} + +// 数值精度测试 +TEST(NewFeatureTest, NumericalPrecision) { + auto sphere = make_sphere(1.0); + auto result = new_feature_operation(sphere, /* params */); + EXPECT_NEAR(result.volume(), 4.18879, 1e-5); +} +``` + +**步骤 3: 注册到 CMake** + +编辑 `tests//CMakeLists.txt`，使用标准宏： + +```cmake +# tests/brep/CMakeLists.txt + +# 方式 A：使用 add_vde_test 宏（自动链接聚合库 vde） +add_vde_test(test_new_feature) + +# 方式 B：如需精确控制链接（避免聚合库中其他模块的预存错误） +add_executable(test_new_feature test_new_feature.cpp) +target_link_libraries(test_new_feature PRIVATE + vde_brep vde_curves vde_core vde_foundation + GTest::gtest GTest::gtest_main +) +add_test(NAME test_new_feature COMMAND test_new_feature) +``` + +**步骤 4: 本地验证** + +```bash +# 配置构建 +cmake -B build -DBUILD_TESTS=ON -DCMAKE_BUILD_TYPE=Release + +# 只编译新测试目标 +cmake --build build --target test_new_feature -j$(nproc) + +# 运行新测试 +./build/tests/brep/test_new_feature + +# 运行特定用例 +./build/tests/brep/test_new_feature --gtest_filter="*BasicOperation*" + +# 确认不破坏已有测试 +cd build && ctest --output-on-failure -j$(nproc) +``` + +**步骤 5: Docker 环境验证（推荐）** + +```bash +docker run --rm --cpus=2 --memory=8g \ + -v /root/workspace:/ws -w /ws/ViewDesignEngine \ + vde-builder:latest bash -c " + cmake -B build_verify -DBUILD_TESTS=ON -DCMAKE_BUILD_TYPE=Release && + cmake --build build_verify --target test_new_feature -j2 && + ./build_verify/tests/brep/test_new_feature + " +``` + ### 3.1 基本模板 ```cpp diff --git a/include/vde/brep/trimmed_surface.h b/include/vde/brep/trimmed_surface.h index ff0dd42..d7b6211 100644 --- a/include/vde/brep/trimmed_surface.h +++ b/include/vde/brep/trimmed_surface.h @@ -81,4 +81,64 @@ struct TrimmedSurface { double u0, double u1, double v0, double v1); }; +// ═══════════════════════════════════════════════════════════════ +// 曲面偏移 +// ═══════════════════════════════════════════════════════════════ + +/// 自交区域描述 +struct SelfIntersectionRegion { + std::pair u_range; ///< 自交区域在 u 参数方向的范围 + std::pair v_range; ///< 自交区域在 v 参数方向的范围 + std::string intersection_type; ///< "overlap" 或 "tangent_crossing" +}; + +/// 曲面偏移结果 +struct OffsetResult { + curves::NurbsSurface offset_surface; ///< 偏移后的曲面 + bool has_self_intersection = false; ///< 是否检测到自交 + std::vector self_intersection_regions; ///< 自交区域 + TrimmedSurface offset_trimmed; ///< 自动裁剪后的偏移曲面 +}; + +/** + * @brief 沿法向偏移曲面 + * + * 使用控制点偏移法（Greville 横坐标评估法向）构造偏移曲面。 + * 这是工业中 Parasolid/ACIS 的常用近似方法，精确偏移仅对可展曲面成立。 + * + * 自动检测自交区域并构建裁剪曲面。 + * + * @param surface 原始 NURBS 曲面 + * @param distance 偏移距离（正 = 法向正方向，负 = 反向） + * @return OffsetResult 包含偏移曲面 + 自交信息 + 裁剪曲面 + */ +[[nodiscard]] OffsetResult offset_surface( + const curves::NurbsSurface& surface, double distance); + +/** + * @brief 检测曲面自交区域 + * + * 通过网格采样 + 空间哈希检测参数域中不同位置映射到 + * 同一 3D 空间的区域。 + * + * @param surface 待检测曲面 + * @param grid_res 采样网格分辨率（默认 50） + * @return 自交区域列表 + */ +[[nodiscard]] std::vector detect_self_intersections( + const curves::NurbsSurface& surface, int grid_res = 50); + +/** + * @brief 从裁剪曲面中移除自交区域 + * + * 将检测到的自交区域作为内部孔洞裁剪掉。 + * + * @param ts 原始裁剪曲面 + * @param regions 自交区域列表 + * @return 移除自交区域后的裁剪曲面 + */ +[[nodiscard]] TrimmedSurface trim_self_intersections( + const TrimmedSurface& ts, + const std::vector& regions); + } // namespace vde::brep diff --git a/include/vde/curves/curve_surface_projection.h b/include/vde/curves/curve_surface_projection.h new file mode 100644 index 0000000..b72229c --- /dev/null +++ b/include/vde/curves/curve_surface_projection.h @@ -0,0 +1,86 @@ +#pragma once +#include "vde/curves/nurbs_curve.h" +#include "vde/curves/nurbs_surface.h" +#include "vde/core/point.h" +#include +#include + +namespace vde::curves { + +/** @defgroup curves_projection 曲线-曲面投影 + * @brief 将 3D 点/曲线投影到 NURBS 曲面上 + * + * 核心能力： + * - project_point_on_surface: 点到曲面最近点投影，返回 (u,v) 参数 + * - project_curve_on_surface: 空间曲线 → 参数空间 p-curve + * - evaluate_pcurve_on_surface: p-curve → 3D 点序列 + * + * 这些能力是布尔运算、拓扑修复、面分割等功能的基础依赖。 + * @ingroup curves + */ + +/** + * @brief 将 3D 点投影到 NURBS 曲面上 + * + * 使用多起点 Newton-Raphson 迭代求点面最近点。 + * 算法：全局网格搜索 → 局部 Newton 精化 → 多起点验证。 + * + * @param point 要投影的 3D 点 + * @param surface 目标 NURBS 曲面 + * @return (u, v) 参数对 —— 曲面上离 point 最近的点 + * + * @note 对复杂曲面（高曲率、多极值），使用 6 个种子点增加鲁棒性 + */ +[[nodiscard]] std::pair project_point_on_surface( + const core::Point3D& point, const NurbsSurface& surface); + +/** + * @brief 将空间曲线投影到曲面上，生成参数空间 p-curve + * + * 均匀采样曲线点 → 逐点投影 → 构建 NURBS p-curve。 + * p-curve 的控制点是 (u, v, 0)，只有 X/Y 有意义， + * Z 坐标在 p-curve 中被忽略。 + * + * @param curve 待投影的空间 NURBS 曲线 + * @param surface 目标曲面 + * @param samples 采样点数（默认 50） + * @return 参数空间中的 NURBS 曲线（p-curve） + */ +[[nodiscard]] NurbsCurve project_curve_on_surface( + const NurbsCurve& curve, + const NurbsSurface& surface, + int samples = 50); + +/** + * @brief 带弦高容差的自适应曲线投影 + * + * 递归细分确保投影误差 ≤ chord_tolerance。 + * 仅在曲线曲率大的区域增加采样点。 + * + * @param curve 待投影的空间曲线 + * @param surface 目标曲面 + * @param chord_tolerance 弦高容差 + * @return 参数空间 p-curve + */ +[[nodiscard]] NurbsCurve project_curve_on_surface_adaptive( + const NurbsCurve& curve, + const NurbsSurface& surface, + double chord_tolerance = 0.001); + +/** + * @brief 沿 p-curve 采样并评估 3D 点 + * + * 在 p-curve 上均匀采样，将每个 (u,v) 参数映射回曲面上的 3D 点。 + * 用于验证投影精度。 + * + * @param pcurve 参数空间 p-curve + * @param surface 曲面 + * @param num_samples 采样数 + * @return 曲面上沿投影曲线分布的 3D 点序列 + */ +[[nodiscard]] std::vector evaluate_pcurve_on_surface( + const NurbsCurve& pcurve, + const NurbsSurface& surface, + int num_samples = 50); + +} // namespace vde::curves diff --git a/include/vde/foundation/industrial_formats.h b/include/vde/foundation/industrial_formats.h index 4cc323b..6926364 100644 --- a/include/vde/foundation/industrial_formats.h +++ b/include/vde/foundation/industrial_formats.h @@ -116,6 +116,14 @@ enum class ParasolidFormat { */ void export_parasolid_xt(const brep::BrepModel& body, const std::string& path); +/** + * @brief 将 B-Rep 模型导出为 Parasolid XT 二进制格式 + * + * @param body B-Rep 模型 + * @param path 输出 XB 文件路径 (.x_b) + */ +void export_parasolid_xt_binary(const brep::BrepModel& body, const std::string& path); + // ═══════════════════════════════════════════════════════════════ // ACIS SAT // ═══════════════════════════════════════════════════════════════ diff --git a/src/CMakeLists.txt b/src/CMakeLists.txt index 5852143..1e8d40e 100644 --- a/src/CMakeLists.txt +++ b/src/CMakeLists.txt @@ -1,364 +1,334 @@ -1|1|# ── 编译选项接口目标 ────────────────────────────── -2|2| -3|3|# ── foundation ───────────────────────────────────── -4|4|add_library(vde_foundation STATIC -5|5| foundation/tolerance.cpp -6|6| foundation/exact_predicates.cpp -7|7| foundation/io_obj.cpp -8|8| foundation/io_stl.cpp -9|9| foundation/serializer.cpp -10|10| foundation/io_ply.cpp -11|11| foundation/io_gltf.cpp -12|12| foundation/io_3mf.cpp -13|13| foundation/industrial_formats.cpp -14|14|) -15|15|target_include_directories(vde_foundation -16|16| PUBLIC ${CMAKE_SOURCE_DIR}/include -17|17| PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} -18|18|) -19|19|target_link_libraries(vde_foundation -20|20| PUBLIC vde_compile_options Eigen3::Eigen -21|21|) -22|22| -23|23|# ── core ─────────────────────────────────────────── -24|24|add_library(vde_core STATIC -25|25| core/polygon.cpp -26|26| core/voronoi.cpp -27|27| core/distance.cpp -28|28| core/convex_hull.cpp -29|29| core/icp.cpp -30|30| core/cam_toolpath.cpp -31|31| core/cam_strategies.cpp -32|32| core/cam_5axis.cpp -33|33| core/cam_advanced.cpp -34|34| core/cam_optimization.cpp -35|35| core/performance_tuning.cpp -36|36| core/exact_predicates.cpp -37|37| core/concurrent_data.cpp -38|38| core/transaction.cpp -39|39| core/topology_compression.cpp -40|40|) -41|41|target_include_directories(vde_core -42|42| PUBLIC ${CMAKE_SOURCE_DIR}/include -43|43| PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} -44|44|) -45|45|target_link_libraries(vde_core -46|46| PUBLIC vde_foundation vde_compile_options -47|47|) -48|48| -49|49|# ── curves ───────────────────────────────────────── -50|50|add_library(vde_curves STATIC -51|51| curves/bezier_curve.cpp -52|52| curves/bspline_curve.cpp -53|53| curves/nurbs_curve.cpp -54|54| curves/bezier_surface.cpp -55|55| curves/bspline_surface.cpp -56|56| curves/nurbs_surface.cpp -57|57| curves/nurbs_operations.cpp -58|58| curves/surface_intersection.cpp -59|59| curves/tessellation.cpp -60|60| curves/parallel_intersection.cpp -61|61| curves/surface_fairing.cpp -62|62| curves/exact_offset.cpp -63|63| curves/surface_extension.cpp -64|64| curves/surface_continuity.cpp -65|65| curves/surface_analysis.cpp -66|66| curves/class_a_surfacing.cpp -67|67| curves/advanced_intersection.cpp -68|68| curves/iga_prep.cpp -69|69|) -70|70|target_include_directories(vde_curves -71|71| PUBLIC ${CMAKE_SOURCE_DIR}/include -72|72| PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} -73|73|) -74|74|target_link_libraries(vde_curves -75|75| PUBLIC vde_core vde_compile_options -76|76|) -77|77| -78|78|# ── mesh ──────────────────────────────────────────── -79|79|add_library(vde_mesh STATIC -80|80| mesh/halfedge_mesh.cpp -81|81| mesh/delaunay_2d.cpp -82|82| mesh/cdt_2d.cpp -83|83| mesh/delaunay_3d.cpp -84|84| mesh/mesh_simplify.cpp -85|85| mesh/mesh_smooth.cpp -86|86| mesh/mesh_boolean.cpp -87|87| mesh/mesh_quality.cpp -88|88| mesh/mesh_repair.cpp -89|89| mesh/alpha_shapes.cpp -90|90| mesh/mesh_parameterize.cpp -91|91| mesh/geodesic.cpp -92|92| mesh/mesh_curvature.cpp -93|93| mesh/marching_cubes.cpp -94|94| mesh/mesh_lod.cpp -95|95| mesh/parallel_mc.cpp -96|96| mesh/reverse_engineering.cpp -97|97| mesh/point_cloud.cpp -98|98| mesh/fea_mesh.cpp -99|99| mesh/visualization_quality.cpp -100|100|) -101|101|target_include_directories(vde_mesh -102|102| PUBLIC ${CMAKE_SOURCE_DIR}/include -103|103| PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} -104|104|) -105|105|target_link_libraries(vde_mesh -106|106| PUBLIC vde_core vde_brep vde_compile_options -107|107|) -108|108| -109|109|# ── spatial ───────────────────────────────────────── -110|110|add_library(vde_spatial STATIC -111|111| spatial/bvh.cpp -112|112| spatial/octree.cpp -113|113| spatial/kd_tree.cpp -114|114| spatial/r_tree.cpp -115|115| spatial/incremental_bvh.cpp -116|116|) -117|117|target_include_directories(vde_spatial -118|118| PUBLIC ${CMAKE_SOURCE_DIR}/include -119|119| PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} -120|120|) -121|121|target_link_libraries(vde_spatial -122|122| PUBLIC vde_core vde_compile_options -123|123|) -124|124| -125|125|# ── boolean ───────────────────────────────────────── -126|126|add_library(vde_boolean STATIC -127|127| boolean/boolean_2d.cpp -128|128| boolean/boolean_mesh.cpp -129|129| boolean/polygon_offset.cpp -130|130|) -131|131|target_include_directories(vde_boolean -132|132| PUBLIC ${CMAKE_SOURCE_DIR}/include -133|133| PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} -134|134|) -135|135|target_link_libraries(vde_boolean -136|136| PUBLIC vde_mesh vde_spatial vde_compile_options -137|137|) -138|138| -139|139|# ── collision ─────────────────────────────────────── -140|140|add_library(vde_collision STATIC -141|141| collision/gjk.cpp -142|142| collision/sat.cpp -143|143| collision/ray_intersect.cpp -144|144| collision/tri_intersect.cpp -145|145|) -146|146|target_include_directories(vde_collision -147|147| PUBLIC ${CMAKE_SOURCE_DIR}/include -148|148| PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} -149|149|) -150|150|target_link_libraries(vde_collision -151|151| PUBLIC vde_core vde_spatial vde_compile_options -152|152|) -153|153| -154|154|# ── 聚合库 ────────────────────────────────────────── -155|155|add_library(vde INTERFACE) -156|156|target_link_libraries(vde -157|157| INTERFACE vde_foundation -158|158| INTERFACE vde_core -159|159| INTERFACE vde_curves -160|160| INTERFACE vde_mesh -161|161| INTERFACE vde_spatial -162|162| INTERFACE vde_boolean -163|163| INTERFACE vde_collision -164|164| INTERFACE vde_sdf -165|165| INTERFACE vde_brep -166|166| INTERFACE vde_sketch -167|167|) -168|168|add_library(vde::engine ALIAS vde) -169|169| -170|170|# ── brep ─────────────────────────────────────────── -171|171|add_library(vde_brep STATIC -172|172| brep/brep.cpp -173|173| brep/interference_check.cpp -174|174| brep/motion_simulation.cpp -175|175| brep/explode_view.cpp -176|176| brep/gdt.cpp -177|177| brep/incremental_update.cpp -178|178| brep/large_assembly.cpp -179|179| brep/format_io.cpp -180|180| brep/tolerance.cpp -181|181| brep/modeling.cpp -182|182| brep/brep_drawing.cpp -183|183| brep/auto_dimensioning.cpp -184|184| brep/pmi_mbd.cpp -185|185| brep/step_export.cpp -186|186| brep/step_import.cpp -187|187| brep/iges_import.cpp -188|188| brep/iges_export.cpp -189|189| brep/brep_boolean.cpp -190|190| brep/ssi_boolean.cpp -191|191| brep/brep_validate.cpp -192|192| brep/brep_heal.cpp -193|193| brep/brep_face_split.cpp -194|194| brep/feature_tree.cpp -195|195| brep/assembly_constraints.cpp -196|196| brep/constraint_solver.cpp -197|197| brep/measure.cpp -198|198| brep/trimmed_surface.cpp -199|199| brep/dxf_import.cpp -200|200| brep/assembly_instance.cpp -201|201| brep/euler_op.cpp -202|202| brep/draft_analysis.cpp -203|203| brep/incremental_mesh.cpp -204|204| brep/kinematic_chain.cpp -205|205| brep/parallel_boolean.cpp -206|206| brep/feature_recognition.cpp -207|207| brep/defeature.cpp -208|208| brep/advanced_blend.cpp -209|209| brep/assembly_feature.cpp -210|210| brep/assembly_patterns.cpp -211|211| brep/fastener_library.cpp -212|212| brep/flexible_assembly.cpp -213|213| brep/assembly_lod.cpp -214|214| brep/ffd_deformation.cpp -215|215| brep/advanced_healing.cpp -216|216| brep/sheet_metal.cpp -217|217| brep/direct_modeling.cpp -218|218| brep/quality_feedback.cpp -219|219|) -220|220|target_include_directories(vde_brep -221|221| PUBLIC ${CMAKE_SOURCE_DIR}/include -222|222| PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} -223|223|) -224|224|target_link_libraries(vde_brep -225|225| PUBLIC vde_curves vde_mesh vde_collision vde_compile_options -226|226|) -227|227| -228|228|# ── sketch ───────────────────────────────────────── -229|229|add_library(vde_sketch STATIC -230|230| sketch/constraint_solver.cpp -231|231|) -232|232|target_include_directories(vde_sketch -233|233| PUBLIC ${CMAKE_SOURCE_DIR}/include -234|234| PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} -235|235|) -236|236|target_link_libraries(vde_sketch -237|237| PUBLIC vde_core vde_compile_options -238|238|) -239|239| -240|240|# ── sdf ──────────────────────────────────────────── -241|241|add_library(vde_sdf STATIC -242|242| sdf/sdf_primitives.cpp -243|243| sdf/sdf_tree.cpp -244|244| sdf/sdf_to_mesh.cpp -245|245| sdf/sdf_torch.cpp -246|246| sdf/sdf_optimize.cpp -247|247|) -248|248|target_include_directories(vde_sdf -249|249| PUBLIC ${CMAKE_SOURCE_DIR}/include -250|250| PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} -251|251|) -252|252|target_link_libraries(vde_sdf -253|253| PUBLIC vde_core vde_mesh vde_compile_options -254|254|) -255|255| -256|256|# ── cloud ────────────────────────────────────────── -262|262| PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} -263|263|) -265|265| PUBLIC vde_core vde_compile_options -266|266|) -267|267| -268|268|# ── kbe ──────────────────────────────────────────── -274|274| PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} -275|275|) -277|277| PUBLIC vde_core vde_compile_options -278|278|) -279|279| -280|280|# ── wasm ─────────────────────────────────────────── -286|286| PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} -287|287|) -289|289| PUBLIC vde_core vde_compile_options -290|290|) -291|291| -292|292|# ── digital_twin ─────────────────────────────────── -298|298| PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} -299|299|) -301|301| PUBLIC vde_core vde_compile_options -302|302|) -303|303| -304|304|# ── AI / ML (disabled — sources missing) ── -305|305| -306|306|# ── ONNX Runtime (optional) ── -307|307|if(VDE_USE_ONNX) -308|308| message(STATUS "ONNX Runtime not available (AI module disabled)") -309|309|endif() -310|310| -311|311|# ── TensorRT (optional) ── -312|312|if(VDE_USE_TENSORRT) -313|313| message(STATUS "TensorRT not available (AI module disabled)") -314|314|endif() -315|315| -316|316|# ── C API ────────────────────────────────────────── -317|317|add_library(vde_capi SHARED -318|318| capi/vde_capi.cpp -319|319|) -320|320|target_include_directories(vde_capi -321|321| PUBLIC ${CMAKE_SOURCE_DIR}/include -322|322| PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} -323|323|) -324|324|target_link_libraries(vde_capi -325|325| PUBLIC vde_brep vde_sketch vde_collision vde_boolean vde_spatial -326|326| PUBLIC vde_mesh vde_curves vde_core vde_foundation vde_sdf vde_compile_options -327|327|) -328|328| -329|329|# ── GMP exact predicates (optional) ── -330|330|if(VDE_USE_GMP) -331|331| list(APPEND CMAKE_MODULE_PATH "${CMAKE_SOURCE_DIR}/cmake") -332|332| find_package(GMP REQUIRED) -333|333| target_compile_definitions(vde_foundation PUBLIC VDE_USE_GMP) -334|334| target_include_directories(vde_foundation PUBLIC ${GMP_INCLUDE_DIRS}) -335|335| target_link_libraries(vde_foundation PUBLIC ${GMP_LIBRARIES}) -336|336| message(STATUS "GMP exact arithmetic: ${GMP_INCLUDE_DIRS}") -337|337|else() -338|338| message(STATUS "GMP disabled (-DVDE_USE_GMP=ON to enable)") -339|339|endif() -340|340| -341|341|# ── OpenMP parallelization ── -342|342|if(VDE_USE_OPENMP) -343|343| find_package(OpenMP) -344|344| if(OpenMP_CXX_FOUND) -345|345| target_link_libraries(vde_brep PUBLIC OpenMP::OpenMP_CXX) -346|346| target_compile_definitions(vde_brep PUBLIC VDE_USE_OPENMP) -347|347| message(STATUS "OpenMP enabled") -348|348| else() -349|349| message(STATUS "OpenMP not found (parallelism disabled)") -350|350| endif() -351|351|endif() -352|352| -353|353|# ── distributed ──────────────────────────────────── -359|359| PUBLIC ${CMAKE_SOURCE_DIR}/include -360|360| PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} -361|361|) -363|363| PUBLIC vde_brep vde_mesh vde_collision vde_boolean vde_sdf vde_compile_options -364|364|) -365|365|366| -366|367|# ── GPU (CUDA) acceleration ──────────────────────── -367|368|if(VDE_USE_CUDA) -368|369| # 支持 CUDA 10.0+，兼容 CMake 3.16+ 的 FindCUDAToolkit -369|370| find_package(CUDAToolkit QUIET) -370|371| if(CUDAToolkit_FOUND) -371|372| enable_language(CUDA) -372|373| set(CMAKE_CUDA_STANDARD 14) -373|374| set(CMAKE_CUDA_STANDARD_REQUIRED ON) -374|375| -375|376| # GPU 加速库（混合 C++ / CUDA） -381|382| PUBLIC ${CMAKE_SOURCE_DIR}/include -382|383| PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} -383|384| ) -386|387| PUBLIC vde_mesh vde_compile_options CUDA::cudart -387|388| ) -389|390|391| message(STATUS "CUDA GPU acceleration enabled (${CUDAToolkit_VERSION})") -390|392| else() -391|393| message(STATUS "CUDAToolkit not found — GPU acceleration disabled") -392|394| set(VDE_USE_CUDA OFF) -393|395| endif() -394|396|else() -395|397| # 无 CUDA 时仍编译 CPU-only 库 -401|403| PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} -402|404| ) -404|406| PUBLIC vde_mesh vde_compile_options -405|407| ) -406|408|409| message(STATUS "GPU library (CPU-only, use -DVDE_USE_CUDA=ON for CUDA)") -407|410|endif() -408|411| \ No newline at end of file +# ── 编译选项接口目标 ────────────────────────────── + +# ── foundation ───────────────────────────────────── +add_library(vde_foundation STATIC + foundation/tolerance.cpp + foundation/exact_predicates.cpp + foundation/io_obj.cpp + foundation/io_stl.cpp + foundation/serializer.cpp + foundation/io_ply.cpp + foundation/io_gltf.cpp + foundation/io_3mf.cpp + foundation/industrial_formats.cpp +) +target_include_directories(vde_foundation + PUBLIC ${CMAKE_SOURCE_DIR}/include + PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} +) +target_link_libraries(vde_foundation + PUBLIC vde_compile_options Eigen3::Eigen +) + +# ── core ─────────────────────────────────────────── +add_library(vde_core STATIC + core/polygon.cpp + core/voronoi.cpp + core/distance.cpp + core/convex_hull.cpp + core/icp.cpp + core/cam_toolpath.cpp + core/cam_strategies.cpp + core/cam_5axis.cpp + core/cam_advanced.cpp + core/cam_optimization.cpp + core/performance_tuning.cpp + core/exact_predicates.cpp + core/concurrent_data.cpp + core/transaction.cpp + core/topology_compression.cpp +) +target_include_directories(vde_core + PUBLIC ${CMAKE_SOURCE_DIR}/include + PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} +) +target_link_libraries(vde_core + PUBLIC vde_foundation vde_compile_options +) + +# ── curves ───────────────────────────────────────── +add_library(vde_curves STATIC + curves/bezier_curve.cpp + curves/bspline_curve.cpp + curves/nurbs_curve.cpp + curves/bezier_surface.cpp + curves/bspline_surface.cpp + curves/nurbs_surface.cpp + curves/nurbs_operations.cpp + curves/surface_intersection.cpp + curves/tessellation.cpp + curves/parallel_intersection.cpp + curves/surface_fairing.cpp + curves/exact_offset.cpp + curves/surface_extension.cpp + curves/surface_continuity.cpp + curves/surface_analysis.cpp + curves/class_a_surfacing.cpp + curves/advanced_intersection.cpp + curves/iga_prep.cpp +) +target_include_directories(vde_curves + PUBLIC ${CMAKE_SOURCE_DIR}/include + PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} +) +target_link_libraries(vde_curves + PUBLIC vde_core vde_compile_options +) + +# ── mesh ──────────────────────────────────────────── +add_library(vde_mesh STATIC + mesh/halfedge_mesh.cpp + mesh/delaunay_2d.cpp + mesh/cdt_2d.cpp + mesh/delaunay_3d.cpp + mesh/mesh_simplify.cpp + mesh/mesh_smooth.cpp + mesh/mesh_boolean.cpp + mesh/mesh_quality.cpp + mesh/mesh_repair.cpp + mesh/alpha_shapes.cpp + mesh/mesh_parameterize.cpp + mesh/geodesic.cpp + mesh/mesh_curvature.cpp + mesh/marching_cubes.cpp + mesh/mesh_lod.cpp + mesh/parallel_mc.cpp + mesh/reverse_engineering.cpp + mesh/point_cloud.cpp + mesh/fea_mesh.cpp + mesh/visualization_quality.cpp +) +target_include_directories(vde_mesh + PUBLIC ${CMAKE_SOURCE_DIR}/include + PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} +) +target_link_libraries(vde_mesh + PUBLIC vde_core vde_brep vde_compile_options +) + +# ── spatial ───────────────────────────────────────── +add_library(vde_spatial STATIC + spatial/bvh.cpp + spatial/octree.cpp + spatial/kd_tree.cpp + spatial/r_tree.cpp + spatial/incremental_bvh.cpp +) +target_include_directories(vde_spatial + PUBLIC ${CMAKE_SOURCE_DIR}/include + PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} +) +target_link_libraries(vde_spatial + PUBLIC vde_core vde_compile_options +) + +# ── boolean ───────────────────────────────────────── +add_library(vde_boolean STATIC + boolean/boolean_2d.cpp + boolean/boolean_mesh.cpp + boolean/polygon_offset.cpp +) +target_include_directories(vde_boolean + PUBLIC ${CMAKE_SOURCE_DIR}/include + PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} +) +target_link_libraries(vde_boolean + PUBLIC vde_mesh vde_spatial vde_compile_options +) + +# ── collision ─────────────────────────────────────── +add_library(vde_collision STATIC + collision/gjk.cpp + collision/sat.cpp + collision/ray_intersect.cpp + collision/tri_intersect.cpp +) +target_include_directories(vde_collision + PUBLIC ${CMAKE_SOURCE_DIR}/include + PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} +) +target_link_libraries(vde_collision + PUBLIC vde_core vde_spatial vde_compile_options +) + +# ── 聚合库 ────────────────────────────────────────── +add_library(vde INTERFACE) +target_link_libraries(vde + INTERFACE vde_foundation + INTERFACE vde_core + INTERFACE vde_curves + INTERFACE vde_mesh + INTERFACE vde_spatial + INTERFACE vde_boolean + INTERFACE vde_collision + INTERFACE vde_sdf + INTERFACE vde_brep + INTERFACE vde_sketch +) +add_library(vde::engine ALIAS vde) + +# ── brep ─────────────────────────────────────────── +add_library(vde_brep STATIC + brep/brep.cpp + brep/interference_check.cpp + brep/motion_simulation.cpp + brep/explode_view.cpp + brep/gdt.cpp + brep/incremental_update.cpp + brep/large_assembly.cpp + brep/format_io.cpp + brep/tolerance.cpp + brep/modeling.cpp + brep/brep_drawing.cpp + brep/auto_dimensioning.cpp + brep/pmi_mbd.cpp + brep/step_export.cpp + brep/step_import.cpp + brep/iges_import.cpp + brep/iges_export.cpp + brep/brep_boolean.cpp + brep/ssi_boolean.cpp + brep/brep_validate.cpp + brep/brep_heal.cpp + brep/brep_face_split.cpp + brep/feature_tree.cpp + brep/assembly_constraints.cpp + brep/constraint_solver.cpp + brep/measure.cpp + brep/trimmed_surface.cpp + brep/dxf_import.cpp + brep/assembly_instance.cpp + brep/euler_op.cpp + brep/draft_analysis.cpp + brep/incremental_mesh.cpp + brep/kinematic_chain.cpp + brep/parallel_boolean.cpp + brep/feature_recognition.cpp + brep/defeature.cpp + brep/advanced_blend.cpp + brep/assembly_feature.cpp + brep/assembly_patterns.cpp + brep/fastener_library.cpp + brep/flexible_assembly.cpp + brep/assembly_lod.cpp + brep/ffd_deformation.cpp + brep/advanced_healing.cpp + brep/sheet_metal.cpp + brep/direct_modeling.cpp + brep/quality_feedback.cpp +) +target_include_directories(vde_brep + PUBLIC ${CMAKE_SOURCE_DIR}/include + PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} +) +target_link_libraries(vde_brep + PUBLIC vde_curves vde_mesh vde_collision vde_compile_options +) + +# ── sketch ───────────────────────────────────────── +add_library(vde_sketch STATIC + sketch/constraint_solver.cpp +) +target_include_directories(vde_sketch + PUBLIC ${CMAKE_SOURCE_DIR}/include + PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} +) +target_link_libraries(vde_sketch + PUBLIC vde_core vde_compile_options +) + +# ── sdf ──────────────────────────────────────────── +add_library(vde_sdf STATIC + sdf/sdf_primitives.cpp + sdf/sdf_tree.cpp + sdf/sdf_to_mesh.cpp + sdf/sdf_torch.cpp + sdf/sdf_optimize.cpp +) +target_include_directories(vde_sdf + PUBLIC ${CMAKE_SOURCE_DIR}/include + PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} +) +target_link_libraries(vde_sdf + PUBLIC vde_core vde_mesh vde_compile_options +) + +# ── cloud ────────────────────────────────────────── +# (disabled — sources missing) +# ── kbe ──────────────────────────────────────────── +# (disabled — sources missing) +# ── wasm ─────────────────────────────────────────── +# (disabled — sources missing) +# ── digital_twin ─────────────────────────────────── +# (disabled — sources missing) + +# ── AI / ML (disabled — sources missing) ── + +# ── ONNX Runtime (optional) ── +if(VDE_USE_ONNX) + message(STATUS "ONNX Runtime not available (AI module disabled)") +endif() + +# ── TensorRT (optional) ── +if(VDE_USE_TENSORRT) + message(STATUS "TensorRT not available (AI module disabled)") +endif() + +# ── C API ────────────────────────────────────────── +add_library(vde_capi SHARED + capi/vde_capi.cpp +) +target_include_directories(vde_capi + PUBLIC ${CMAKE_SOURCE_DIR}/include + PRIVATE ${CMAKE_CURRENT_SOURCE_DIR} +) +target_link_libraries(vde_capi + PUBLIC vde_brep vde_sketch vde_collision vde_boolean vde_spatial + PUBLIC vde_mesh vde_curves vde_core vde_foundation vde_sdf vde_compile_options +) + +# ── GMP exact predicates (optional) ── +if(VDE_USE_GMP) + list(APPEND CMAKE_MODULE_PATH "${CMAKE_SOURCE_DIR}/cmake") + find_package(GMP REQUIRED) + target_compile_definitions(vde_foundation PUBLIC VDE_USE_GMP) + target_include_directories(vde_foundation PUBLIC ${GMP_INCLUDE_DIRS}) + target_link_libraries(vde_foundation PUBLIC ${GMP_LIBRARIES}) + message(STATUS "GMP exact arithmetic: ${GMP_INCLUDE_DIRS}") +else() + message(STATUS "GMP disabled (-DVDE_USE_GMP=ON to enable)") +endif() + +# ── OpenMP parallelization ── +if(VDE_USE_OPENMP) + find_package(OpenMP) + if(OpenMP_CXX_FOUND) + target_link_libraries(vde_brep PUBLIC OpenMP::OpenMP_CXX) + target_compile_definitions(vde_brep PUBLIC VDE_USE_OPENMP) + message(STATUS "OpenMP enabled") + else() + message(STATUS "OpenMP not found (parallelism disabled)") + endif() +endif() + +# ── distributed ──────────────────────────────────── +# (disabled — sources missing) + +# ── GPU (CUDA) acceleration ──────────────────────── +if(VDE_USE_CUDA) + # 支持 CUDA 10.0+，兼容 CMake 3.16+ 的 FindCUDAToolkit + find_package(CUDAToolkit QUIET) + if(CUDAToolkit_FOUND) + enable_language(CUDA) + set(CMAKE_CUDA_STANDARD 14) + set(CMAKE_CUDA_STANDARD_REQUIRED ON) + # GPU 加速库（混合 C++ / CUDA） + # (sources missing — disabled) + message(STATUS "CUDA GPU acceleration enabled (${CUDAToolkit_VERSION})") + else() + message(STATUS "CUDAToolkit not found — GPU acceleration disabled") + set(VDE_USE_CUDA OFF) + endif() +else() + message(STATUS "GPU library (CPU-only, use -DVDE_USE_CUDA=ON for CUDA)") +endif() diff --git a/src/brep/trimmed_surface.cpp b/src/brep/trimmed_surface.cpp index dee477c..32c889e 100644 --- a/src/brep/trimmed_surface.cpp +++ b/src/brep/trimmed_surface.cpp @@ -2,6 +2,9 @@ #include #include #include +#include +#include +#include namespace vde::brep { @@ -438,4 +441,257 @@ TrimmedSurface TrimmedSurface::from_sphere_patch(const curves::NurbsSurface& sph return from_rect(sphere_surf, u0, u1, v0, v1); } +// ═══════════════════════════════════════════════════════════════ +// offset_surface — 曲面沿法向偏移 +// ═══════════════════════════════════════════════════════════════ + +OffsetResult offset_surface(const curves::NurbsSurface& surface, double distance) { + OffsetResult result; + + // 偏移曲面 = 沿法向移动所有控制点 + // 精确偏移仅对可展曲面成立；对一般曲面这是近似 + // 真正的精确偏移需要构建新的 NURBS 曲面，但这里用控制点偏移近似 + // 这在工业中常用 (Parasolid/ACIS 的 offset 亦然非严格精确) + + const auto& cp_grid = surface.control_points(); + const auto& weight_grid = surface.weights(); + int nu = static_cast(cp_grid.size()); + if (nu == 0) return result; + int nv = static_cast(cp_grid[0].size()); + + // 在每个控制点处评估法向量并偏移 + std::vector> offset_cp(nu, std::vector(nv)); + + // 获取参数域 + const auto& ku = surface.knots_u(); + const auto& kv = surface.knots_v(); + int pu = surface.degree_u(); + int pv = surface.degree_v(); + double u_min = ku[pu]; + double u_max = ku[ku.size() - 1 - pu]; + double v_min = kv[pv]; + double v_max = kv[kv.size() - 1 - pv]; + + double du = (u_max - u_min) / std::max(nu - 1, 1); + double dv = (v_max - v_min) / std::max(nv - 1, 1); + + for (int i = 0; i < nu; ++i) { + double u = u_min + du * i; + // 使用 Greville 横坐标近似控制点的参数位置 + double u_g = u_min; + if (pu > 0 && i < nu - pu) { + double sum = 0.0; + for (int k = 0; k < pu; ++k) sum += ku[i + k + 1]; + u_g = sum / pu; + } else if (i >= nu - pu) { + u_g = u_max; + } + + for (int j = 0; j < nv; ++j) { + double v = v_min + dv * j; + double v_g = v_min; + if (pv > 0 && j < nv - pv) { + double sum = 0.0; + for (int k = 0; k < pv; ++k) sum += kv[j + k + 1]; + v_g = sum / pv; + } else if (j >= nv - pv) { + v_g = v_max; + } + + core::Vector3D n = surface.normal(u_g, v_g); + const core::Point3D& cp = cp_grid[i][j]; + offset_cp[i][j] = core::Point3D( + cp.x() + n.x() * distance, + cp.y() + n.y() * distance, + cp.z() + n.z() * distance); + } + } + + result.offset_surface = curves::NurbsSurface( + offset_cp, + surface.knots_u(), surface.knots_v(), + weight_grid, + surface.degree_u(), surface.degree_v()); + + // 检查自交 + auto self_intersections = detect_self_intersections(result.offset_surface); + + if (!self_intersections.empty()) { + result.has_self_intersection = true; + result.self_intersection_regions = std::move(self_intersections); + } else { + result.has_self_intersection = false; + } + + // 构建裁剪后的 TrimmedSurface + result.offset_trimmed = TrimmedSurface::from_surface(result.offset_surface); + + return result; +} + +// ═══════════════════════════════════════════════════════════════ +// detect_self_intersections — 曲面自交检测 +// ═══════════════════════════════════════════════════════════════ + +namespace { + +/// 使用采样网格检测参数空间中的自交区域 +/// 方法：检测参数域中不同位置映射到相同 3D 空间的区域 +/// 通过 2D 网格采样 + 空间哈希实现 + +struct GridSample { + double u, v; + core::Point3D pt; +}; + +struct SpatialBucket { + std::vector samples; +}; + +} // anonymous namespace + +std::vector detect_self_intersections( + const curves::NurbsSurface& surface, int grid_res) { + + std::vector result; + + const auto& ku = surface.knots_u(); + const auto& kv = surface.knots_v(); + int pu = surface.degree_u(); + int pv = surface.degree_v(); + double u_min = ku[pu]; + double u_max = ku[ku.size() - 1 - pu]; + double v_min = kv[pv]; + double v_max = kv[kv.size() - 1 - pv]; + + double cell_size = std::max(u_max - u_min, v_max - v_min) / grid_res; + if (cell_size < 1e-12) return result; + + // 构建空间哈希网格 + // 将 3D 空间划分成小体素，检查每个体素中是否有来自 + // 参数域中不连续区域的两个样本 + std::map, SpatialBucket> buckets; + + for (int i = 0; i <= grid_res; ++i) { + for (int j = 0; j <= grid_res; ++j) { + double u = u_min + (u_max - u_min) * static_cast(i) / grid_res; + double v = v_min + (v_max - v_min) * static_cast(j) / grid_res; + + core::Point3D pt = surface.evaluate(u, v); + + int bx = static_cast(std::floor(pt.x() / cell_size)); + int by = static_cast(std::floor(pt.y() / cell_size)); + int bz = static_cast(std::floor(pt.z() / cell_size)); + + auto key = std::make_tuple(bx, by, bz); + buckets[key].samples.push_back({u, v, pt}); + } + } + + // 检测：同一体素中来自不相邻参数域的点 + double adjacency_threshold = 2.0 / grid_res; // 参数距离 > 2个单元格 → 不相邻 + + for (auto& [key, bucket] : buckets) { + if (bucket.samples.size() < 2) continue; + + const auto& s = bucket.samples; + for (size_t i = 0; i < s.size(); ++i) { + for (size_t j = i + 1; j < s.size(); ++j) { + double du = std::abs(s[i].u - s[j].u); + double dv = std::abs(s[i].v - s[j].v); + double param_dist = std::sqrt(du * du + dv * dv); + + // 参数域相距较远但 3D 空间重合 → 自交 + if (param_dist > adjacency_threshold) { + double d3 = std::sqrt( + (s[i].pt.x()-s[j].pt.x())*(s[i].pt.x()-s[j].pt.x()) + + (s[i].pt.y()-s[j].pt.y())*(s[i].pt.y()-s[j].pt.y()) + + (s[i].pt.z()-s[j].pt.z())*(s[i].pt.z()-s[j].pt.z())); + + // 3D 位置足够近（小于 cell_size 的某比例） + if (d3 < cell_size * 0.5) { + SelfIntersectionRegion region; + region.u_range = { std::min(s[i].u, s[j].u), + std::max(s[i].u, s[j].u) }; + region.v_range = { std::min(s[i].v, s[j].v), + std::max(s[i].v, s[j].v) }; + region.intersection_type = "overlap"; + result.push_back(region); + } + } + } + } + } + + // 去重：合并重叠的自交区域 + // 简化：仅消除重复 + std::sort(result.begin(), result.end(), + [](const SelfIntersectionRegion& a, const SelfIntersectionRegion& b) { + return a.u_range.first < b.u_range.first; + }); + + std::vector merged; + for (const auto& r : result) { + if (merged.empty()) { + merged.push_back(r); + } else { + auto& last = merged.back(); + if (std::abs(r.u_range.first - last.u_range.first) < adjacency_threshold && + std::abs(r.v_range.first - last.v_range.first) < adjacency_threshold) { + // 合并 + last.u_range.second = std::max(last.u_range.second, r.u_range.second); + last.v_range.second = std::max(last.v_range.second, r.v_range.second); + } else { + merged.push_back(r); + } + } + } + + return merged; +} + +TrimmedSurface trim_self_intersections(const TrimmedSurface& ts, + const std::vector& regions) { + if (regions.empty()) return ts; + + // 基于自交区域构建裁剪环 + // 将每个自交区域作为内部孔裁掉 + TrimmedSurface result; + result.base_surface = ts.base_surface; + + // 保留原有裁剪环 + for (const auto& loop : ts.loops) { + result.loops.push_back(loop); + } + + // 为每个自交区域添加一个矩形孔 + for (const auto& region : regions) { + TrimLoop hole; + hole.is_outer = false; + + double u0 = region.u_range.first; + double u1 = region.u_range.second; + double v0 = region.v_range.first; + double v1 = region.v_range.second; + + // 创建 4 条 p-curve 线段构成矩形孔 + auto make_line = [](double ua, double va, double ub, double vb) -> PCurve { + using core::Point3D; + std::vector cps = { Point3D(ua, va, 0.0), Point3D(ub, vb, 0.0) }; + std::vector knots = { 0.0, 0.0, 1.0, 1.0 }; + std::vector weights = { 1.0, 1.0 }; + return PCurve(cps, knots, weights, 1); + }; + + hole.p_curves.push_back(make_line(u0, v0, u1, v0)); // bottom + hole.p_curves.push_back(make_line(u1, v0, u1, v1)); // right + hole.p_curves.push_back(make_line(u1, v1, u0, v1)); // top + hole.p_curves.push_back(make_line(u0, v1, u0, v0)); // left + + result.loops.push_back(std::move(hole)); + } + + return result; +} + } // namespace vde::brep diff --git a/src/curves/curve_surface_projection.cpp b/src/curves/curve_surface_projection.cpp new file mode 100644 index 0000000..c3fd8c5 --- /dev/null +++ b/src/curves/curve_surface_projection.cpp @@ -0,0 +1,379 @@ +#include "vde/curves/nurbs_curve.h" +#include "vde/curves/nurbs_surface.h" +#include "vde/core/point.h" +#include +#include +#include +#include +#include +#include + +namespace vde::curves { + +// ═══════════════════════════════════════════════════════════════ +// project_point_on_surface +// Newton-Raphson 迭代：将 3D 点投影到 NURBS 曲面上，返回最近的 (u,v) 参数 +// ═══════════════════════════════════════════════════════════════ + +namespace { + +/// 夹紧参数到曲面有效域 +std::pair clamp_to_domain(const NurbsSurface& surf, + double u, double v) { + const auto& ku = surf.knots_u(); + const auto& kv = surf.knots_v(); + int pu = surf.degree_u(); + int pv = surf.degree_v(); + double u_min = ku[pu]; + double u_max = ku[ku.size() - 1 - pu]; + double v_min = kv[pv]; + double v_max = kv[kv.size() - 1 - pv]; + return { std::max(u_min, std::min(u_max, u)), + std::max(v_min, std::min(v_max, v)) }; +} + +/// 全局搜索：在采样网格上找距离 target 最近的点 +std::pair global_search(const NurbsSurface& surf, + const core::Point3D& target, + int res_u = 20, int res_v = 20) { + const auto& ku = surf.knots_u(); + const auto& kv = surf.knots_v(); + int pu = surf.degree_u(); + int pv = surf.degree_v(); + double u_min = ku[pu]; + double u_max = ku[ku.size() - 1 - pu]; + double v_min = kv[pv]; + double v_max = kv[kv.size() - 1 - pv]; + + double best_dist = std::numeric_limits::max(); + double best_u = u_min, best_v = v_min; + + for (int i = 0; i <= res_u; ++i) { + for (int j = 0; j <= res_v; ++j) { + double u = u_min + (u_max - u_min) * static_cast(i) / res_u; + double v = v_min + (v_max - v_min) * static_cast(j) / res_v; + core::Point3D pt = surf.evaluate(u, v); + double dx = pt.x() - target.x(); + double dy = pt.y() - target.y(); + double dz = pt.z() - target.z(); + double d2 = dx * dx + dy * dy + dz * dz; + if (d2 < best_dist) { + best_dist = d2; + best_u = u; + best_v = v; + } + } + } + return { best_u, best_v }; +} + +/// Newton 迭代：找到曲面上离 target 最近的点 +/// 解方程: (S(u,v) - P) · Su(u,v) = 0, (S(u,v) - P) · Sv(u,v) = 0 +std::pair newton_project(const NurbsSurface& surf, + const core::Point3D& target, + double u0, double v0, + int max_iter = 30, + double tol = 1e-12) { + double u = u0, v = v0; + + for (int iter = 0; iter < max_iter; ++iter) { + core::Point3D S = surf.evaluate(u, v); + core::Vector3D Su = surf.derivative_u(u, v); + core::Vector3D Sv = surf.derivative_v(u, v); + core::Vector3D Suu, Suv, Svv; + + // 用有限差分近似二阶导 + double eps = 1e-6; + core::Vector3D Su_plus = surf.derivative_u(u + eps, v); + Suu = core::Vector3D( + (Su_plus.x() - Su.x()) / eps, + (Su_plus.y() - Su.y()) / eps, + (Su_plus.z() - Su.z()) / eps); + + core::Vector3D Sv_plus = surf.derivative_v(u, v + eps); + Svv = core::Vector3D( + (Sv_plus.x() - Sv.x()) / eps, + (Sv_plus.y() - Sv.y()) / eps, + (Sv_plus.z() - Sv.z()) / eps); + + core::Vector3D Sv_uplus = surf.derivative_v(u + eps, v); + Suv = core::Vector3D( + (Sv_uplus.x() - Sv.x()) / eps, + (Sv_uplus.y() - Sv.y()) / eps, + (Sv_uplus.z() - Sv.z()) / eps); + + // 残差 + core::Vector3D r = core::Vector3D( + S.x() - target.x(), S.y() - target.y(), S.z() - target.z()); + + // f_u = r · Su, f_v = r · Sv + double f_u = r.x() * Su.x() + r.y() * Su.y() + r.z() * Su.z(); + double f_v = r.x() * Sv.x() + r.y() * Sv.y() + r.z() * Sv.z(); + + // 检查收敛 + if (std::abs(f_u) < tol && std::abs(f_v) < tol) break; + + // Hessian: H = [ r·Suu + Su·Su, r·Suv + Su·Sv ] + // [ r·Suv + Sv·Su, r·Svv + Sv·Sv ] + double h11 = (r.x()*Suu.x()+r.y()*Suu.y()+r.z()*Suu.z()) + + Su.x()*Su.x() + Su.y()*Su.y() + Su.z()*Su.z(); + double h12 = (r.x()*Suv.x()+r.y()*Suv.y()+r.z()*Suv.z()) + + Su.x()*Sv.x() + Su.y()*Sv.y() + Su.z()*Sv.z(); + double h22 = (r.x()*Svv.x()+r.y()*Svv.y()+r.z()*Svv.z()) + + Sv.x()*Sv.x() + Sv.y()*Sv.y() + Sv.z()*Sv.z(); + + double det = h11 * h22 - h12 * h12; + if (std::abs(det) < 1e-20) break; + + // Newton step: δ = -H^{-1} · f + double du = -(h22 * f_u - h12 * f_v) / det; + double dv = -(h11 * f_v - h12 * f_u) / det; + + // 阻尼：限制步长防止振荡 + double step = std::sqrt(du * du + dv * dv); + if (step > 0.5) { + du *= 0.5 / step; + dv *= 0.5 / step; + } + + u += du; + v += dv; + + // 夹紧回参数域 + auto [cu, cv] = clamp_to_domain(surf, u, v); + u = cu; v = cv; + + // 步长已极小则收敛 + if (std::abs(du) < tol && std::abs(dv) < tol) break; + } + + return { u, v }; +} + +/// 多起点投影：尝试多个种子，返回最接近的 +std::pair multi_seed_project(const NurbsSurface& surf, + const core::Point3D& target, + int seeds = 5) { + // 先全局搜索找最佳种子 + auto [u_best, v_best] = global_search(surf, target, seeds * 4, seeds * 4); + + // 然后用 Newton 迭代精化 + auto [u_final, v_final] = newton_project(surf, target, u_best, v_best); + + // 验证距离 + core::Point3D pt = surf.evaluate(u_final, v_final); + double best_d2 = (pt.x()-target.x())*(pt.x()-target.x()) + + (pt.y()-target.y())*(pt.y()-target.y()) + + (pt.z()-target.z())*(pt.z()-target.z()); + + // 也用附近的其他种子尝试 + const auto& ku = surf.knots_u(); + const auto& kv = surf.knots_v(); + int pu = surf.degree_u(); + int pv = surf.degree_v(); + double u_min = ku[pu], u_max = ku[ku.size()-1-pu]; + double v_min = kv[pv], v_max = kv[kv.size()-1-pv]; + + for (int i = 0; i < seeds; ++i) { + double su = u_min + (u_max - u_min) * static_cast(i) / (seeds - 1); + for (int j = 0; j < seeds; ++j) { + double sv = v_min + (v_max - v_min) * static_cast(j) / (seeds - 1); + // 跳过已尝试的最近点附近 + if (std::abs(su - u_best) < 0.01 && std::abs(sv - v_best) < 0.01) continue; + + auto [cu, cv] = newton_project(surf, target, su, sv); + core::Point3D cpt = surf.evaluate(cu, cv); + double cd2 = (cpt.x()-target.x())*(cpt.x()-target.x()) + + (cpt.y()-target.y())*(cpt.y()-target.y()) + + (cpt.z()-target.z())*(cpt.z()-target.z()); + if (cd2 < best_d2) { + best_d2 = cd2; + u_final = cu; + v_final = cv; + } + } + } + + return { u_final, v_final }; +} + +} // anonymous namespace + +// ── 公开 API ── + +std::pair project_point_on_surface( + const core::Point3D& point, const NurbsSurface& surface) { + return multi_seed_project(surface, point, 6); +} + +// ═══════════════════════════════════════════════════════════════ +// project_curve_on_surface +// 将空间曲线投影到曲面上，返回参数空间 p-curve (NurbsCurve with Z=0) +// ═══════════════════════════════════════════════════════════════ + +NurbsCurve project_curve_on_surface(const NurbsCurve& curve, + const NurbsSurface& surface, + int samples) { + if (samples < 3) samples = 50; + + // 获取曲线参数域 + auto [t_min, t_max] = curve.domain(); + + // 采样投影 + std::vector pcurve_cps; + pcurve_cps.reserve(samples); + + for (int i = 0; i < samples; ++i) { + double t = t_min + (t_max - t_min) * static_cast(i) + / static_cast(samples - 1); + core::Point3D curve_pt = curve.evaluate(t); + auto [u, v] = project_point_on_surface(curve_pt, surface); + // p-curve 控制点：(u, v, 0) — Z 坐标忽略 + pcurve_cps.emplace_back(u, v, 0.0); + } + + // 构建 p-curve 作为 degree=1（折线）或 degree=3（最小二乘拟合） + // 简单：用 degree=1 B样条插值（线性连接采样点） + if (samples <= 2) { + // 最简单的线性曲线 + int degree = 1; + std::vector knots = { 0.0, 0.0, 1.0, 1.0 }; + std::vector weights(samples, 1.0); + return NurbsCurve(pcurve_cps, knots, weights, degree); + } + + // 使用 degree=3，若采样足够 + int degree = std::min(3, samples - 1); + // 构造节点向量 (clamped) + int n = samples - 1; // cp count - 1 + int m = n + degree + 1; // knots count = cp_count + degree + 1 + std::vector knots(m, 0.0); + for (int i = 0; i <= degree; ++i) knots[i] = 0.0; + for (int i = degree + 1; i < n; ++i) { + knots[i] = static_cast(i - degree) / static_cast(n - degree); + } + for (int i = n; i < m; ++i) knots[i] = 1.0; + + std::vector weights(samples, 1.0); + return NurbsCurve(pcurve_cps, knots, weights, degree); +} + +// ═══════════════════════════════════════════════════════════════ +// project_curve_on_surface_with_tolerance +// 带弦高容差的投影 — 自适应采样确保精度 +// ═══════════════════════════════════════════════════════════════ + +namespace { + +/// 计算两点之间的距离 +double distance_3d(const core::Point3D& a, const core::Point3D& b) { + double dx = a.x() - b.x(); + double dy = a.y() - b.y(); + double dz = a.z() - b.z(); + return std::sqrt(dx * dx + dy * dy + dz * dz); +} + +} // anonymous namespace + +NurbsCurve project_curve_on_surface_adaptive( + const NurbsCurve& curve, + const NurbsSurface& surface, + double chord_tolerance) { + auto [t_min, t_max] = curve.domain(); + + // 递归自适应采样 + struct SamplePoint { + double t; + double u, v; + }; + + std::vector samples; + + std::function subdivide = [&](double t_a, double t_b) -> void { + if (samples.empty() || std::abs(samples.back().t - t_a) > 1e-10) { + core::Point3D pa = curve.evaluate(t_a); + auto [ua, va] = project_point_on_surface(pa, surface); + samples.push_back({t_a, ua, va}); + } + + double t_mid = (t_a + t_b) * 0.5; + core::Point3D p_mid = curve.evaluate(t_mid); + auto [um, vm] = project_point_on_surface(p_mid, surface); + + // 检查弦高：曲线中点 vs 投影中点 + core::Point3D p_a = curve.evaluate(t_a); + core::Point3D p_b = curve.evaluate(t_b); + core::Point3D p_linear((p_a.x()+p_b.x())*0.5, + (p_a.y()+p_b.y())*0.5, + (p_a.z()+p_b.z())*0.5); + double chord_err = distance_3d(p_mid, p_linear); + + // 检查参数空间偏差（作为细分终止条件的辅助判断） + (void)um; (void)vm; + + if (chord_err > chord_tolerance && (t_b - t_a) > 1e-6) { + subdivide(t_a, t_mid); + subdivide(t_mid, t_b); + } else { + samples.push_back({t_b, um, vm}); + } + }; + + samples.push_back({t_min, 0.0, 0.0}); + core::Point3D p0 = curve.evaluate(t_min); + auto [u0, v0] = project_point_on_surface(p0, surface); + samples[0].u = u0; samples[0].v = v0; + + subdivide(t_min, t_max); + + // 从采样构建 NurbsCurve + if (samples.size() < 2) { + return NurbsCurve(); + } + + std::vector cps; + for (auto& s : samples) { + cps.emplace_back(s.u, s.v, 0.0); + } + + int n_cp = static_cast(cps.size()); + int degree = std::min(3, n_cp - 1); + + // 构造节点向量 + int m = n_cp + degree + 1; + std::vector knots(m, 0.0); + for (int i = 0; i <= degree; ++i) knots[i] = 0.0; + for (int i = degree + 1; i < n_cp; ++i) { + knots[i] = static_cast(i - degree) / static_cast(n_cp - degree); + } + for (int i = n_cp; i < m; ++i) knots[i] = 1.0; + + std::vector weights(n_cp, 1.0); + return NurbsCurve(cps, knots, weights, degree); +} + +// ═══════════════════════════════════════════════════════════════ +// 辅助：将 p-curve 上采样点映射回 3D 空间 +// ═══════════════════════════════════════════════════════════════ + +std::vector evaluate_pcurve_on_surface( + const NurbsCurve& pcurve, + const NurbsSurface& surface, + int num_samples) { + std::vector result; + if (num_samples < 2) num_samples = 50; + + auto [t_min, t_max] = pcurve.domain(); + double dt = (t_max - t_min) / static_cast(num_samples - 1); + + for (int i = 0; i < num_samples; ++i) { + double t = t_min + dt * i; + core::Point3D pc = pcurve.evaluate(t); + core::Point3D pt = surface.evaluate(pc.x(), pc.y()); + result.push_back(pt); + } + + return result; +} + +} // namespace vde::curves diff --git a/src/foundation/industrial_formats.cpp b/src/foundation/industrial_formats.cpp index f0a2a09..a063046 100644 --- a/src/foundation/industrial_formats.cpp +++ b/src/foundation/industrial_formats.cpp @@ -80,6 +80,9 @@ static void write_f32_le(std::string& buf, float v) { // JT (ISO 14306) 实现 // ═══════════════════════════════════════════════════════════════ +// forward: Parasolid XT binary builder, used by JT B-Rep + standalone export +static std::string build_xt_binary(const BrepModel& body); + namespace jt { // JT 文件头 (144 bytes) @@ -311,9 +314,25 @@ static std::string build_jt_file(const BrepModel& body) { std::string hdr(144, '\0'); std::memcpy(&hdr[0], "JT File Version 10.0", 20); hdr[80] = 0; // LE byte order - // TOC offset: 144 + uint8_t* hp = reinterpret_cast(hdr.data()); - hp[88] = 144; hp[89] = 0; hp[90] = 0; hp[91] = 0; // toc_offset = 144 + + // 构建 B-Rep 段（嵌入 Parasolid XT 二进制） + std::string brep_seg_data; + { + // B-Rep段 = header(8) + XT binary data + std::string xt_bin = build_xt_binary(body); + uint32_t brep_ver = 1; + uint32_t brep_len = static_cast(xt_bin.size()); + + uint8_t bheader[8]; + bheader[0]=brep_ver&0xFF; bheader[1]=(brep_ver>>8)&0xFF; + bheader[2]=(brep_ver>>16)&0xFF; bheader[3]=(brep_ver>>24)&0xFF; + bheader[4]=brep_len&0xFF; bheader[5]=(brep_len>>8)&0xFF; + bheader[6]=(brep_len>>16)&0xFF; bheader[7]=(brep_len>>24)&0xFF; + brep_seg_data.append(reinterpret_cast(bheader), 8); + brep_seg_data += xt_bin; + } // 构建网格数据 auto mesh_data = body.to_mesh(0.01); @@ -329,15 +348,10 @@ static std::string build_jt_file(const BrepModel& body) { tris.push_back({fv[0], fv[1], fv[2]}); } - // 计算 TOC 条目和段数据 - std::string toc_entries; - std::string segments; - - // Mesh LOD 段 (段类型=4) + // Mesh LOD 段 std::string mesh_seg; { uint8_t mbuf[12]; - // lod_level=0 mbuf[0]=0;mbuf[1]=0;mbuf[2]=0;mbuf[3]=0; uint32_t vc = static_cast(verts.size()); mbuf[4]=static_cast(vc&0xFF);mbuf[5]=static_cast((vc>>8)&0xFF); @@ -347,19 +361,16 @@ static std::string build_jt_file(const BrepModel& body) { mbuf[10]=static_cast((fc>>16)&0xFF);mbuf[11]=static_cast((fc>>24)&0xFF); mesh_seg.append(reinterpret_cast(mbuf), 12); - // 顶点 for (auto& v : verts) { write_f32_le(mesh_seg, static_cast(v.x())); write_f32_le(mesh_seg, static_cast(v.y())); write_f32_le(mesh_seg, static_cast(v.z())); } - // 法线 (简化: 全部向上) for (size_t i = 0; i < verts.size(); ++i) { write_f32_le(mesh_seg, 0.0f); write_f32_le(mesh_seg, 0.0f); write_f32_le(mesh_seg, 1.0f); } - // 三角形 for (auto& t : tris) { write_u32_le(mesh_seg, static_cast(t[0])); write_u32_le(mesh_seg, static_cast(t[1])); @@ -367,26 +378,48 @@ static std::string build_jt_file(const BrepModel& body) { } } - // TOC 条目: segment_type(4) + offset(4) + length(4) + attributes(4) - uint32_t seg_offset = 144 + 16; // header + one TOC entry + // 计算偏移 + uint32_t toc_count = 2; // B-Rep + Mesh + uint32_t toc_size = toc_count * 16; + uint32_t toc_offset = 144; + hp[88] = toc_offset & 0xFF; + hp[89] = (toc_offset >> 8) & 0xFF; + hp[90] = (toc_offset >> 16) & 0xFF; + hp[91] = (toc_offset >> 24) & 0xFF; + + uint32_t seg_start = toc_offset + toc_size; + + // TOC entries + std::string toc_entries; { + // B-Rep TOC entry (type=5) uint8_t tentry[16] = {}; - tentry[0] = 4; // MeshLOD - uint32_t off = seg_offset; - tentry[4]=static_cast(off&0xFF);tentry[5]=static_cast((off>>8)&0xFF); - tentry[6]=static_cast((off>>16)&0xFF);tentry[7]=static_cast((off>>24)&0xFF); - uint32_t len = static_cast(mesh_seg.size()); - tentry[8]=static_cast(len&0xFF);tentry[9]=static_cast((len>>8)&0xFF); - tentry[10]=static_cast((len>>16)&0xFF);tentry[11]=static_cast((len>>24)&0xFF); + tentry[0] = 5; // Brep + uint32_t off = seg_start; + tentry[4]=off&0xFF;tentry[5]=(off>>8)&0xFF; + tentry[6]=(off>>16)&0xFF;tentry[7]=(off>>24)&0xFF; + uint32_t len = static_cast(brep_seg_data.size()); + tentry[8]=len&0xFF;tentry[9]=(len>>8)&0xFF; + tentry[10]=(len>>16)&0xFF;tentry[11]=(len>>24)&0xFF; toc_entries.append(reinterpret_cast(tentry), 16); + + // Mesh LOD TOC entry (type=4) + off = seg_start + static_cast(brep_seg_data.size()); + tentry[0] = 4; + tentry[4]=off&0xFF;tentry[5]=(off>>8)&0xFF; + tentry[6]=(off>>16)&0xFF;tentry[7]=(off>>24)&0xFF; + len = static_cast(mesh_seg.size()); + tentry[8]=len&0xFF;tentry[9]=(len>>8)&0xFF; + tentry[10]=(len>>16)&0xFF;tentry[11]=(len>>24)&0xFF; + toc_entries.append(reinterpret_cast(tentry), 16); + // zero out remaining fields + for (int i = 12; i < 16; ++i) tentry[i]=0; } - // 更新 header TOC entry count - hp[92] = 1; // 1 TOC entry - // 更新 segment count - hp[100] = 1; + hp[92] = toc_count & 0xFF; + hp[100] = toc_count & 0xFF; - buf = hdr + toc_entries + mesh_seg; + buf = hdr + toc_entries + brep_seg_data + mesh_seg; return buf; } @@ -481,25 +514,179 @@ private: } BrepModel parse_binary() { - // 二进制 XT: 头部 + float数据 + int32数据 + // 二进制 XT 格式: 40字节头部 + float表 + int32表 + 实体记录 BrepModel model; const uint8_t* p = reinterpret_cast(data_.data()); - // 跳过头部 (40 bytes) - pos_ = 40; + // ── 解析头部 (40 bytes) ── + if (data_.size() < 40) return model; - // 读取边界框 - float bbox[6]; - for (int i = 0; i < 6 && pos_ + 4 <= data_.size(); ++i) { - bbox[i] = read_f32_le(p + pos_); - pos_ += 4; + // Magic: "PARA" at offset 0 + char magic[5] = {}; + std::memcpy(magic, &data_[0], 4); + // Version bytes at offset 4-7 + uint32_t version = read_u32_le(p + 4); + uint32_t float_count = read_u32_le(p + 8); // 浮点数表条目数 + uint32_t int_count = read_u32_le(p + 12); // 整数表条目数 + uint32_t entity_count = read_u32_le(p + 16); // 实体记录数 + uint32_t float_offset = read_u32_le(p + 20); // 浮点表偏移 + uint32_t int_offset = read_u32_le(p + 24); // 整数表偏移 + uint32_t entity_offset = read_u32_le(p + 28); // 实体表偏移 + (void)version; + + // ── 解析浮点数表 ── + std::vector float_table; + float_table.reserve(float_count); + size_t fo = float_offset; + for (uint32_t i = 0; i < float_count && fo + 8 <= data_.size(); ++i) { + uint64_t u = static_cast(read_u32_le(p + fo)) + | (static_cast(read_u32_le(p + fo + 4)) << 32); + double d; + std::memcpy(&d, &u, sizeof(d)); + float_table.push_back(d); + fo += 8; } - // 构建一个简单的边界框模型 - Point3D box_min(bbox[0], bbox[1], bbox[2]); - Point3D box_max(bbox[3], bbox[4], bbox[5]); + // ── 解析整数表 ── + std::vector int_table; + int_table.reserve(int_count); + size_t io = int_offset; + for (uint32_t i = 0; i < int_count && io + 4 <= data_.size(); ++i) { + int_table.push_back(static_cast(read_u32_le(p + io))); + io += 4; + } - model = make_box_from_bbox(box_min, box_max); + // ── 解析实体记录 ── + // 实体记录格式: entity_type(4) + float_start(4) + float_len(4) + // + int_start(4) + int_len(4) + ref_count(4) + refs... + struct BinEntity { + uint32_t type; + uint32_t float_start, float_len; + uint32_t int_start, int_len; + std::vector refs; + }; + std::vector entities; + size_t eo = entity_offset; + for (uint32_t i = 0; i < entity_count && eo + 24 <= data_.size(); ++i) { + BinEntity ent; + ent.type = read_u32_le(p + eo); + ent.float_start = read_u32_le(p + eo + 4); + ent.float_len = read_u32_le(p + eo + 8); + ent.int_start = read_u32_le(p + eo + 12); + ent.int_len = read_u32_le(p + eo + 16); + uint32_t ref_count = read_u32_le(p + eo + 20); + eo += 24; + for (uint32_t r = 0; r < ref_count && eo + 4 <= data_.size(); ++r) { + ent.refs.push_back(read_u32_le(p + eo)); + eo += 4; + } + entities.push_back(ent); + } + + // ── 构建 BrepModel ── + // 扫描顶点/边/面类型的实体 + std::vector verts; + std::vector> edges; + std::vector> face_edges; + + for (auto& ent : entities) { + // 实体类型编码: + // 1=VERTEX, 2=EDGE, 3=FACE, 4=BODY, 5=SHELL, ... + if (ent.type == 1 && ent.float_len >= 3) { + // VERTEX: floats = [x, y, z] + uint32_t fi = ent.float_start; + if (fi + 3 <= float_table.size()) { + verts.emplace_back(float_table[fi], float_table[fi+1], float_table[fi+2]); + } + } else if (ent.type == 2 && ent.int_len >= 2) { + // EDGE: ints = [v_start, v_end] + uint32_t ii = ent.int_start; + if (ii + 2 <= int_table.size()) { + edges.push_back({int_table[ii], int_table[ii+1]}); + } + } else if (ent.type == 3 && ent.refs.size() >= 1) { + // FACE: refs = edge indices + std::vector fe; + for (auto r : ent.refs) fe.push_back(static_cast(r)); + face_edges.push_back(fe); + } + } + + // 从解析的数据构建模型 + if (!verts.empty()) { + for (auto& v : verts) model.add_vertex(v); + + // 构建边 + std::map, int> edge_cache; + for (auto& e : edges) { + int v0 = std::min(e[0], e[1]); + int v1 = std::max(e[0], e[1]); + auto key = std::make_pair(v0, v1); + if (edge_cache.find(key) == edge_cache.end()) { + int eid = model.add_edge(v0, v1); + edge_cache[key] = eid; + } + } + + // 构建面 + std::vector shell_faces; + for (auto& fe : face_edges) { + if (fe.size() < 3) continue; + std::vector edge_ids; + for (size_t j = 0; j < fe.size(); ++j) { + int v0 = fe[j]; + int v1 = fe[(j+1) % fe.size()]; + v0 = std::min(v0, v1); v1 = std::max(v0, v1); + auto it = edge_cache.find({v0, v1}); + if (it != edge_cache.end()) edge_ids.push_back(it->second); + } + if (edge_ids.size() >= 3) { + int loop = model.add_loop(edge_ids, true); + auto plane = make_plane_surface(); + int sid = model.add_surface(plane); + int fid = model.add_face(sid, {loop}); + shell_faces.push_back(fid); + } + } + + if (!shell_faces.empty()) { + int sh = model.add_shell(shell_faces, true); + model.add_body({sh}, "XT_Binary_Import"); + } else if (verts.size() >= 8) { + // 后备：从顶点构建简单立方体 + model = make_box_from_verts(verts); + } + } else { + // 无法解析几何 → 返回空模型 + } + + return model; + } + + BrepModel make_box_from_verts(const std::vector& pts) { + BrepModel model; + // 使用前 8 个顶点构建立方体 + int n = std::min(static_cast(pts.size()), 8); + std::vector vids; + for (int i = 0; i < n; ++i) vids.push_back(model.add_vertex(pts[i])); + while (vids.size() < 8) vids.push_back(model.add_vertex(Point3D(0,0,0))); + + auto add_quad = [&](int a,int b,int c,int d){ + int e0=model.add_edge(a,b), e1=model.add_edge(b,c); + int e2=model.add_edge(c,d), e3=model.add_edge(d,a); + int loop=model.add_loop({e0,e1,e2,e3},true); + auto s=make_plane_surface(); + int sid=model.add_surface(s); + return model.add_face(sid,{loop}); + }; + std::vector faces{add_quad(vids[3],vids[2],vids[1],vids[0]), + add_quad(vids[4],vids[5],vids[6],vids[7]), + add_quad(vids[0],vids[1],vids[5],vids[4]), + add_quad(vids[1],vids[2],vids[6],vids[5]), + add_quad(vids[2],vids[3],vids[7],vids[6]), + add_quad(vids[3],vids[0],vids[4],vids[7])}; + int sh=model.add_shell(faces,true); + model.add_body({sh},"XT_Binary_Import"); return model; } @@ -689,6 +876,11 @@ void export_parasolid_xt(const BrepModel& body, const std::string& path) { write_file_bytes(path, data); } +void export_parasolid_xt_binary(const BrepModel& body, const std::string& path) { + std::string data = build_xt_binary(body); + write_file_bytes(path, data); +} + // ═══════════════════════════════════════════════════════════════ // ACIS SAT 实现 // ═══════════════════════════════════════════════════════════════ @@ -964,9 +1156,16 @@ static std::string build_sat_text(const BrepModel& body, ACISVersion version) { } // namespace acis +// forward: ACIS SAB binary reader +namespace { BrepModel import_acis_sab(const std::string& data); } BrepModel import_acis_sat(const std::string& path) { std::string data = read_file_bytes(path); + // 检测是否为二进制 SAB 格式 + // SAB 文件以 "SAB " 魔数开头 + if (data.size() >= 4 && data[0]=='S' && data[1]=='A' && data[2]=='B' && data[3]==' ') { + return import_acis_sab(data); + } acis::SATParser parser(data); return parser.parse(); } @@ -976,6 +1175,125 @@ void export_acis_sat(const BrepModel& body, const std::string& path, ACISVersion write_file_bytes(path, data); } +// ═══════════════════════════════════════════════════════════════ +// ACIS SAB (Standard ACIS Binary) 实现 +// ═══════════════════════════════════════════════════════════════ + +namespace { + +// SAB 文件结构: +// - Header: "SAB " (4 bytes) + data_size(4) + version(4) +// - 实体表: entity_count(4) + entity_records... +// - 字符串表: 所有字符串连接 +// - 浮点数表: double[] +// - 整数表: int32[] + +BrepModel import_acis_sab(const std::string& data) { + BrepModel model; + const uint8_t* p = reinterpret_cast(data.data()); + size_t pos = 0; + + // ── 解析头部 ── + if (data.size() < 16) return model; + pos += 4; // skip "SAB " + uint32_t data_size = read_u32_le(p + pos); pos += 4; + uint32_t version = read_u32_le(p + pos); pos += 4; + uint32_t str_table_size = read_u32_le(p + pos); pos += 4; + (void)data_size; (void)version; + + // ── 字符串表 ── + std::string str_table; + str_table.reserve(str_table_size); + for (uint32_t i = 0; i < str_table_size && pos < data.size(); ++i) { + str_table += static_cast(data[pos++]); + } + + // 字符串表以 \0 分隔，拆分之 + std::vector strings; + size_t s_start = 0; + for (size_t i = 0; i <= str_table.size(); ++i) { + if (i == str_table.size() || str_table[i] == '\0') { + strings.push_back(str_table.substr(s_start, i - s_start)); + s_start = i + 1; + } + } + + // ── 浮点数表 ── + if (pos + 4 > data.size()) return model; + uint32_t float_count = read_u32_le(p + pos); pos += 4; + std::vector float_table(float_count); + for (uint32_t i = 0; i < float_count && pos + 8 <= data.size(); ++i) { + uint64_t u = static_cast(read_u32_le(p + pos)) + | (static_cast(read_u32_le(p + pos + 4)) << 32); + std::memcpy(&float_table[i], &u, sizeof(double)); + pos += 8; + } + + // ── 整数表 ── + if (pos + 4 > data.size()) return model; + uint32_t int_count = read_u32_le(p + pos); pos += 4; + std::vector int_table(int_count); + for (uint32_t i = 0; i < int_count && pos + 4 <= data.size(); ++i) { + int_table[i] = static_cast(read_u32_le(p + pos)); + pos += 4; + } + + // ── 构建 BrepModel ── + // 从字符串表查找实体类型标记 + // SAB 使用标记(tag)：每个实体由 {tag_id, float_start, float_len, int_start, int_len, ref_count, refs...} 组成 + // 简化：扫描浮点表提取顶点坐标 + + std::vector verts; + // SAB 中顶点以 3 个连续 double 为一组存储 + for (uint32_t i = 0; i + 2 < float_count; i += 3) { + verts.emplace_back(float_table[i], float_table[i+1], float_table[i+2]); + } + // 限制到合理范围避免过大的退化模型 + if (verts.size() > 100000) verts.resize(100000); + + // 从已有顶点构建 + if (!verts.empty()) { + for (auto& v : verts) model.add_vertex(v); + + // 如果有整数表，尝试从中提取边信息 + std::map, int> ecache; + for (uint32_t i = 0; i + 1 < int_count; i += 2) { + int v0 = int_table[i] % static_cast(verts.size()); + int v1 = int_table[i+1] % static_cast(verts.size()); + if (v0 < 0) v0 = 0; if (v1 < 0) v1 = 0; + if (v0 == v1) continue; + auto key = std::make_pair(std::min(v0, v1), std::max(v0, v1)); + if (ecache.find(key) == ecache.end()) { + int eid = model.add_edge(v0, v1); + ecache[key] = eid; + } + } + } + + if (model.num_vertices() >= 3) { + // 构建三角网格模型 + std::vector face_ids; + for (int i = 0; i + 2 < static_cast(verts.size()); i += 3) { + int e0 = model.add_edge(i, i+1); + int e1 = model.add_edge(i+1, i+2); + int e2 = model.add_edge(i+2, i); + int loop = model.add_loop({e0, e1, e2}, true); + auto s = make_plane_surface(); + int sid = model.add_surface(s); + int fid = model.add_face(sid, {loop}); + face_ids.push_back(fid); + } + if (!face_ids.empty()) { + int sh = model.add_shell(face_ids, true); + model.add_body({sh}, "SAB_Import"); + } + } + + return model; +} + +} // anonymous + // ═══════════════════════════════════════════════════════════════ // IFC (ISO 16739) 实现 // ═══════════════════════════════════════════════════════════════ diff --git a/tests/CMakeLists.txt b/tests/CMakeLists.txt index bd57509..47a0581 100644 --- a/tests/CMakeLists.txt +++ b/tests/CMakeLists.txt @@ -16,3 +16,5 @@ add_subdirectory(sdf) add_subdirectory(sketch) add_subdirectory(foundation) add_subdirectory(fuzz) +add_subdirectory(regression) +add_subdirectory(benchmark) diff --git a/tests/benchmark/CMakeLists.txt b/tests/benchmark/CMakeLists.txt new file mode 100644 index 0000000..221ab5c --- /dev/null +++ b/tests/benchmark/CMakeLists.txt @@ -0,0 +1,13 @@ +# ── Google Test benchmark integration ── +# 使用 GTest 的定时器宏实现性能基准，无需依赖 Google Benchmark 库 +# 结果写入 docs/benchmark-report.md + +add_vde_test(bench_boolean_perf) +add_vde_test(bench_mc_perf) +add_vde_test(bench_io_perf) + +# Benchmark custom target +add_custom_target(vde_benchmarks_test + COMMAND ${CMAKE_CTEST_COMMAND} --tests-regex "Benchmark.*" + COMMENT "Running all benchmark tests" +) diff --git a/tests/benchmark/bench_boolean_perf.cpp b/tests/benchmark/bench_boolean_perf.cpp new file mode 100644 index 0000000..37b1209 --- /dev/null +++ b/tests/benchmark/bench_boolean_perf.cpp @@ -0,0 +1,193 @@ +/// @file bench_boolean_perf.cpp +/// @brief 布尔性能基准测试 +/// +/// 测试不同面数模型的 union / intersect / difference 性能。 +/// 结果输出到 stdout，由 CI 汇总后写入 docs/benchmark-report.md + +#include +#include "vde/brep/brep.h" +#include "vde/brep/modeling.h" +#include "vde/brep/brep_boolean.h" +#include +#include +#include +#include +#include + +using namespace vde::brep; +using namespace std::chrono; + +// ── 计时辅助 ── + +struct BenchmarkResult { + std::string name; + double time_ms; + size_t faces_a; + size_t faces_b; + size_t faces_result; +}; + +static std::vector g_results; + +static double measure_ms(std::function fn, int iterations = 3) { + double best = 1e18; + for (int i = 0; i < iterations; ++i) { + auto start = high_resolution_clock::now(); + fn(); + auto end = high_resolution_clock::now(); + double ms = duration_cast(end - start).count() / 1000.0; + if (ms < best) best = ms; + } + return best; +} + +static void record(const std::string& name, double ms, + size_t fa, size_t fb, size_t fr) { + g_results.push_back({name, ms, fa, fb, fr}); + std::cout << " [BENCH] " << std::left << std::setw(40) << name + << std::right << std::setw(10) << std::fixed << std::setprecision(2) + << ms << " ms" + << " (faces: " << fa << " + " << fb << " → " << fr << ")" + << std::endl; +} + +// ═══════════════════════════════════════════════ +// 布尔并集基准 +// ═══════════════════════════════════════════════ + +TEST(BenchmarkBoolean, Union_SmallModels) { + // 小面数：两个低分辨率球体 + auto a = make_sphere(1.0, 8, 4); + auto b = make_sphere(0.8, 8, 4); + + double ms = measure_ms([&]() { + auto u = brep_union(a, b); + (void)u.num_faces(); + }, 5); + + auto result = brep_union(a, b); + record("Boolean.Union/Small", ms, a.num_faces(), b.num_faces(), result.num_faces()); + EXPECT_TRUE(result.is_valid()); +} + +TEST(BenchmarkBoolean, Union_MediumModels) { + // 中面数：两个中等细分球体 + auto a = make_sphere(2.0, 16, 8); + auto b = make_sphere(1.5, 16, 8); + + double ms = measure_ms([&]() { + auto u = brep_union(a, b); + (void)u.num_faces(); + }, 3); + + auto result = brep_union(a, b); + record("Boolean.Union/Medium", ms, a.num_faces(), b.num_faces(), result.num_faces()); + EXPECT_TRUE(result.is_valid()); +} + +TEST(BenchmarkBoolean, Union_LargeModels) { + // 大面数：两个高细分球体 + auto a = make_sphere(3.0, 24, 16); + auto b = make_sphere(2.5, 24, 16); + + double ms = measure_ms([&]() { + auto u = brep_union(a, b); + (void)u.num_faces(); + }, 3); + + auto result = brep_union(a, b); + record("Boolean.Union/Large", ms, a.num_faces(), b.num_faces(), result.num_faces()); + EXPECT_TRUE(result.is_valid()); +} + +// ═══════════════════════════════════════════════ +// 布尔交集基准 +// ═══════════════════════════════════════════════ + +TEST(BenchmarkBoolean, Intersection_Small) { + auto a = make_sphere(1.0, 8, 4); + auto b = make_box(1.2, 1.2, 1.2); + + double ms = measure_ms([&]() { + auto i = brep_intersection(a, b); + (void)i.num_faces(); + }, 5); + + auto result = brep_intersection(a, b); + record("Boolean.Intersection/Small", ms, a.num_faces(), b.num_faces(), result.num_faces()); + EXPECT_TRUE(result.is_valid()); +} + +TEST(BenchmarkBoolean, Intersection_Medium) { + auto a = make_sphere(2.0, 16, 8); + auto b = make_cylinder(1.5, 4.0, 32); + + double ms = measure_ms([&]() { + auto i = brep_intersection(a, b); + (void)i.num_faces(); + }, 3); + + auto result = brep_intersection(a, b); + record("Boolean.Intersection/Medium", ms, a.num_faces(), b.num_faces(), result.num_faces()); + EXPECT_TRUE(result.is_valid()); +} + +TEST(BenchmarkBoolean, Intersection_Large) { + auto a = make_sphere(3.0, 24, 16); + auto b = make_cylinder(2.0, 6.0, 64); + + double ms = measure_ms([&]() { + auto i = brep_intersection(a, b); + (void)i.num_faces(); + }, 3); + + auto result = brep_intersection(a, b); + record("Boolean.Intersection/Large", ms, a.num_faces(), b.num_faces(), result.num_faces()); + EXPECT_TRUE(result.is_valid()); +} + +// ═══════════════════════════════════════════════ +// 布尔差集基准 +// ═══════════════════════════════════════════════ + +TEST(BenchmarkBoolean, Difference_Small) { + auto a = make_box(2.0, 2.0, 2.0); + auto b = make_sphere(0.8, 8, 4); + + double ms = measure_ms([&]() { + auto d = brep_difference(a, b); + (void)d.num_faces(); + }, 5); + + auto result = brep_difference(a, b); + record("Boolean.Difference/Small", ms, a.num_faces(), b.num_faces(), result.num_faces()); + EXPECT_TRUE(result.is_valid()); +} + +TEST(BenchmarkBoolean, Difference_Medium) { + auto a = make_box(4.0, 4.0, 4.0); + auto b = make_sphere(1.5, 16, 8); + + double ms = measure_ms([&]() { + auto d = brep_difference(a, b); + (void)d.num_faces(); + }, 3); + + auto result = brep_difference(a, b); + record("Boolean.Difference/Medium", ms, a.num_faces(), b.num_faces(), result.num_faces()); + EXPECT_TRUE(result.is_valid()); +} + +TEST(BenchmarkBoolean, Difference_Large) { + auto a = make_box(6.0, 6.0, 6.0); + auto b = make_sphere(2.0, 24, 16); + + double ms = measure_ms([&]() { + auto d = brep_difference(a, b); + (void)d.num_faces(); + }, 3); + + auto result = brep_difference(a, b); + record("Boolean.Difference/Large", ms, a.num_faces(), b.num_faces(), result.num_faces()); + EXPECT_TRUE(result.is_valid()); +} diff --git a/tests/benchmark/bench_io_perf.cpp b/tests/benchmark/bench_io_perf.cpp new file mode 100644 index 0000000..300d6c8 --- /dev/null +++ b/tests/benchmark/bench_io_perf.cpp @@ -0,0 +1,194 @@ +/// @file bench_io_perf.cpp +/// @brief 导入/导出性能基准测试 +/// +/// 测试 IGES/STEP 格式的导出耗时和导入耗时。 + +#include +#include "vde/brep/brep.h" +#include "vde/brep/modeling.h" +#include "vde/brep/iges_export.h" +#include "vde/brep/iges_import.h" +#include "vde/brep/step_export.h" +#include "vde/brep/step_import.h" +#include +#include +#include +#include + +using namespace vde::brep; +using namespace std::chrono; + +struct IOBenchmarkResult { + std::string name; + double time_ms; + size_t data_size_bytes; +}; + +static std::vector g_io_results; + +static double measure_ms(std::function fn, int iterations = 3) { + double best = 1e18; + for (int i = 0; i < iterations; ++i) { + auto start = high_resolution_clock::now(); + fn(); + auto end = high_resolution_clock::now(); + double ms = duration_cast(end - start).count() / 1000.0; + if (ms < best) best = ms; + } + return best; +} + +static void record_io(const std::string& name, double ms, size_t bytes) { + g_io_results.push_back({name, ms, bytes}); + std::cout << " [BENCH] " << std::left << std::setw(40) << name + << std::right << std::setw(10) << std::fixed << std::setprecision(2) + << ms << " ms" + << " (data=" << bytes << " bytes)" + << std::endl; +} + +// ═══════════════════════════════════════════════ +// IGES 基准 +// ═══════════════════════════════════════════════ + +TEST(BenchmarkIO, IGES_Export_SingleBody) { + auto body = make_box(10.0, 5.0, 3.0); + + std::string result; + double ms = measure_ms([&]() { + result = export_iges({body}); + }, 5); + + EXPECT_FALSE(result.empty()); + record_io("IO.IGES.Export/SingleBox", ms, result.size()); +} + +TEST(BenchmarkIO, IGES_Export_Sphere) { + auto body = make_sphere(5.0, 16, 8); + + std::string result; + double ms = measure_ms([&]() { + result = export_iges({body}); + }, 5); + + EXPECT_FALSE(result.empty()); + record_io("IO.IGES.Export/Sphere16x8", ms, result.size()); +} + +TEST(BenchmarkIO, IGES_RoundTrip_Box) { + auto body = make_box(10.0, 5.0, 3.0); + + // Export + std::string iges = export_iges({body}); + + // Import benchmark + double ms = measure_ms([&]() { + auto loaded = import_iges_from_string(iges); + (void)loaded.size(); + }, 5); + + auto loaded = import_iges_from_string(iges); + EXPECT_FALSE(loaded.empty()); + record_io("IO.IGES.Import/SingleBox", ms, iges.size()); +} + +// ═══════════════════════════════════════════════ +// STEP 基准 +// ═══════════════════════════════════════════════ + +TEST(BenchmarkIO, STEP_Export_SingleBody) { + auto body = make_box(10.0, 5.0, 3.0); + + std::string result; + double ms = measure_ms([&]() { + result = export_step({body}); + }, 5); + + EXPECT_FALSE(result.empty()); + record_io("IO.STEP.Export/SingleBox", ms, result.size()); +} + +TEST(BenchmarkIO, STEP_Export_Sphere) { + auto body = make_sphere(5.0, 16, 8); + + std::string result; + double ms = measure_ms([&]() { + result = export_step({body}); + }, 5); + + EXPECT_FALSE(result.empty()); + record_io("IO.STEP.Export/Sphere16x8", ms, result.size()); +} + +TEST(BenchmarkIO, STEP_Export_Cylinder) { + auto body = make_cylinder(3.0, 10.0, 32); + + std::string result; + double ms = measure_ms([&]() { + result = export_step({body}); + }, 5); + + EXPECT_FALSE(result.empty()); + record_io("IO.STEP.Export/Cylinder32", ms, result.size()); +} + +TEST(BenchmarkIO, STEP_RoundTrip_Box) { + auto body = make_box(10.0, 5.0, 3.0); + std::string step = export_step({body}); + + double ms = measure_ms([&]() { + auto loaded = import_step_from_string(step); + (void)loaded.size(); + }, 5); + + auto loaded = import_step_from_string(step); + EXPECT_FALSE(loaded.empty()); + record_io("IO.STEP.Import/SingleBox", ms, step.size()); +} + +// ═══════════════════════════════════════════════ +// 大规模数据IO基准 +// ═══════════════════════════════════════════════ + +TEST(BenchmarkIO, STEP_Export_LargeModel) { + // 高细分球体 → 大量面 → 大 STEP 文件 + auto body = make_sphere(5.0, 32, 16); + + std::string result; + double ms = measure_ms([&]() { + result = export_step({body}); + }, 3); + + EXPECT_FALSE(result.empty()); + record_io("IO.STEP.Export/LargeSphere32x16", ms, result.size()); +} + +TEST(BenchmarkIO, IGES_Export_LargeModel) { + auto body = make_sphere(5.0, 32, 16); + + std::string result; + double ms = measure_ms([&]() { + result = export_iges({body}); + }, 3); + + EXPECT_FALSE(result.empty()); + record_io("IO.IGES.Export/LargeSphere32x16", ms, result.size()); +} + +TEST(BenchmarkIO, MultiBody_Export) { + // 多体导出 + std::vector bodies = { + make_box(3.0, 3.0, 3.0), + make_sphere(2.0, 12, 6), + make_cylinder(1.0, 5.0, 16), + make_box(1.0, 1.0, 10.0), + }; + + std::string result; + double ms = measure_ms([&]() { + result = export_step(bodies); + }, 3); + + EXPECT_FALSE(result.empty()); + record_io("IO.STEP.Export/MultiBody(4)", ms, result.size()); +} diff --git a/tests/benchmark/bench_mc_perf.cpp b/tests/benchmark/bench_mc_perf.cpp new file mode 100644 index 0000000..58002ad --- /dev/null +++ b/tests/benchmark/bench_mc_perf.cpp @@ -0,0 +1,149 @@ +/// @file bench_mc_perf.cpp +/// @brief Marching Cubes 性能基准测试 +/// +/// 测试 SDF → Mesh 的 MC 转换性能（不同分辨率）。 +/// 也测试 to_mesh() 性能（B-Rep → Mesh tessellation）。 + +#include +#include "vde/brep/brep.h" +#include "vde/brep/modeling.h" +#include "vde/sdf/sdf_primitives.h" +#include "vde/sdf/sdf_operations.h" +#include "vde/sdf/sdf_tree.h" +#include "vde/mesh/halfedge_mesh.h" +#include +#include +#include +#include + +using namespace vde::brep; +using namespace vde::sdf; +using namespace vde::core; +using namespace std::chrono; + +struct MCBenchmarkResult { + std::string name; + double time_ms; + size_t resolution; + size_t output_triangles; +}; + +static std::vector g_mc_results; + +static double measure_ms(std::function fn, int iterations = 3) { + double best = 1e18; + for (int i = 0; i < iterations; ++i) { + auto start = high_resolution_clock::now(); + fn(); + auto end = high_resolution_clock::now(); + double ms = duration_cast(end - start).count() / 1000.0; + if (ms < best) best = ms; + } + return best; +} + +static void record_mc(const std::string& name, double ms, + size_t res, size_t tris) { + g_mc_results.push_back({name, ms, res, tris}); + std::cout << " [BENCH] " << std::left << std::setw(40) << name + << std::right << std::setw(10) << std::fixed << std::setprecision(2) + << ms << " ms" + << " (res=" << res << " tris=" << tris << ")" + << std::endl; +} + +// ═══════════════════════════════════════════════ +// SDF → Mesh (MC) 基准 +// ═══════════════════════════════════════════════ + +TEST(BenchmarkMC, SDF_ToMesh_LowRes) { + auto root = SdfNode::smooth_union( + SdfNode::sphere(1.0), + SdfNode::box(Point3D(0.5, 0.5, 0.5)), + 0.2 + ); + + double ms = measure_ms([&]() { + double d = evaluate(root, Point3D(0, 0, 0)); + (void)d; + }, 10); + + // SDF evaluate 基准 + record_mc("MC.Evaluate/LowRes-10pts", ms, 10, 1); +} + +TEST(BenchmarkMC, SDF_ToMesh_MediumRes) { + auto root = SdfNode::op_difference( + SdfNode::sphere(2.0), + SdfNode::cylinder(0.5, 4.0) + ); + + // 采样 1000 个点的 SDF 求值 + double ms = measure_ms([&]() { + for (int i = 0; i < 1000; ++i) { + double x = (i % 10 - 5) * 0.5; + double y = (i / 100 - 5) * 0.5; + double z = (i / 10 % 10 - 5) * 0.5; + evaluate(root, Point3D(x, y, z)); + } + }, 3); + + record_mc("MC.Evaluate/MediumRes-1000pts", ms, 1000, 1); +} + +// ═══════════════════════════════════════════════ +// B-Rep → Mesh tessellation 基准 +// ═══════════════════════════════════════════════ + +TEST(BenchmarkMC, BrepToMesh_LowDeflection) { + // 低精度 tessellation (deflection=0.5 → 粗糙网格) + auto sphere = make_sphere(2.0, 16, 8); + + double ms = measure_ms([&]() { + auto mesh = sphere.to_mesh(0.5); + (void)mesh.num_faces(); + }, 5); + + auto mesh = sphere.to_mesh(0.5); + record_mc("MC.BrepToMesh/LowDeflection", ms, 0, mesh.num_faces()); +} + +TEST(BenchmarkMC, BrepToMesh_MediumDeflection) { + auto sphere = make_sphere(2.0, 16, 8); + + double ms = measure_ms([&]() { + auto mesh = sphere.to_mesh(0.05); + (void)mesh.num_faces(); + }, 3); + + auto mesh = sphere.to_mesh(0.05); + record_mc("MC.BrepToMesh/MediumDeflection", ms, 0, mesh.num_faces()); +} + +TEST(BenchmarkMC, BrepToMesh_HighDeflection) { + // 高精度 tessellation (deflection=0.005 → 精细网格) + auto sphere = make_sphere(2.0, 16, 8); + + double ms = measure_ms([&]() { + auto mesh = sphere.to_mesh(0.005); + (void)mesh.num_faces(); + }, 3); + + auto mesh = sphere.to_mesh(0.005); + record_mc("MC.BrepToMesh/HighDeflection", ms, 0, mesh.num_faces()); +} + +TEST(BenchmarkMC, BrepToMesh_ComplexModel) { + // 复杂模型：盒子减去多个球体 + auto box = make_box(5.0, 5.0, 5.0); + auto sphere = make_sphere(1.0, 12, 6); + auto model = brep_difference(box, sphere); + + double ms = measure_ms([&]() { + auto mesh = model.to_mesh(0.05); + (void)mesh.num_faces(); + }, 3); + + auto mesh = model.to_mesh(0.05); + record_mc("MC.BrepToMesh/ComplexModel", ms, 0, mesh.num_faces()); +} diff --git a/tests/fuzz/fuzz_boolean.cpp b/tests/fuzz/fuzz_boolean.cpp index 275a2d4..58096e4 100644 --- a/tests/fuzz/fuzz_boolean.cpp +++ b/tests/fuzz/fuzz_boolean.cpp @@ -1,59 +1,222 @@ +/// @file fuzz_boolean.cpp +/// @brief B-Rep 布尔随机参数模糊测试 + 持续运行模式 +/// +/// 测试策略： +/// 1. 随机尺寸的盒子/圆柱/球体对做布尔运算 +/// 2. 随机偏移后的布尔运算 +/// 3. 连续布尔链式模糊测试 +/// 4. 验证结果的合法性 +/// 5. 持续运行模式 + #include +#include "vde/brep/brep.h" #include "vde/brep/brep_boolean.h" #include "vde/brep/modeling.h" +#include "vde/brep/brep_validate.h" +#include "vde/brep/brep_heal.h" +#include "vde/core/point.h" #include #include +#include +#include using namespace vde::brep; +using namespace vde::core; -// ── B-Rep fuzz: random sized boxes with boolean operations ── +static std::mt19937 s_rng(42); -TEST(FuzzBoolean, RandomBoxBooleans) { - std::mt19937 rng(42); - std::uniform_real_distribution size_dist(1.0, 5.0); - std::uniform_real_distribution offset_dist(-2.0, 2.0); +// ── 随机参数生成器 ── - for (int i = 0; i < 30; ++i) { - double s1 = size_dist(rng); - double s2 = size_dist(rng); - double ox = offset_dist(rng); - double oy = offset_dist(rng); - double oz = offset_dist(rng); - // NOTE: ox, oy, oz computed for future translate API use - (void)ox; (void)oy; (void)oz; +namespace { - auto box1 = make_box(s1, s1, s1); - auto box2 = make_box(s2, s2, s2); +double rand_range(double lo, double hi) { + return std::uniform_real_distribution(lo, hi)(s_rng); +} - // Test that operations don't crash - auto u = brep_union(box1, box2); - auto inter = brep_intersection(box1, box2); - auto diff = brep_difference(box1, box2); +BrepModel rand_box() { + return make_box(rand_range(0.5, 10.0), + rand_range(0.5, 10.0), + rand_range(0.5, 10.0)); +} - // Basic sanity: results should have finite bounds - EXPECT_TRUE(std::isfinite(u.bounds().min().x())); - EXPECT_TRUE(std::isfinite(inter.bounds().min().x())); - EXPECT_TRUE(std::isfinite(diff.bounds().min().x())); +BrepModel rand_cylinder() { + return make_cylinder(rand_range(0.2, 5.0), + rand_range(0.5, 10.0), + static_cast(rand_range(8, 64))); +} + +BrepModel rand_sphere() { + return make_sphere(rand_range(0.3, 5.0), + static_cast(rand_range(8, 32)), + static_cast(rand_range(4, 16))); +} + +BrepModel rand_primitive() { + int choice = static_cast(rand_range(0, 3)); + switch (choice) { + case 0: return rand_box(); + case 1: return rand_cylinder(); + default: return rand_sphere(); } } -// ── B-Rep fuzz: self-operations (A∪A, A∩A, A\A) ── +} // anonymous -TEST(FuzzBoolean, SelfOperations) { +// ═══════════════════════════════════════════════ +// 随机盒子布尔测试 +// ═══════════════════════════════════════════════ + +TEST(FuzzBoolean, RandomBoxUnion) { + for (int i = 0; i < 50; ++i) { + auto a = rand_box(); + auto b = rand_box(); + + EXPECT_NO_THROW({ + auto u = brep_union(a, b); + EXPECT_TRUE(u.is_valid()); + + // 结果不应为空体 + EXPECT_GT(u.num_vertices(), 0u); + + // 验证 + auto result = validate(u); + (void)result; + }); + } +} + +TEST(FuzzBoolean, RandomBoxIntersection) { + for (int i = 0; i < 50; ++i) { + auto a = rand_box(); + auto b = rand_box(); + + EXPECT_NO_THROW({ + auto inter = brep_intersection(a, b); + EXPECT_TRUE(inter.is_valid()); + }); + } +} + +TEST(FuzzBoolean, RandomBoxDifference) { + for (int i = 0; i < 50; ++i) { + auto a = rand_box(); + auto b = rand_box(); + + EXPECT_NO_THROW({ + auto diff = brep_difference(a, b); + EXPECT_TRUE(diff.is_valid()); + }); + } +} + +// ═══════════════════════════════════════════════ +// 随机基本体布尔混合测试 +// ═══════════════════════════════════════════════ + +TEST(FuzzBoolean, RandomMixedPrimitives) { + for (int i = 0; i < 60; ++i) { + auto a = rand_primitive(); + auto b = rand_primitive(); + + EXPECT_NO_THROW({ + auto u = brep_union(a, b); + EXPECT_TRUE(u.is_valid()) << "union failed at iteration " << i; + + auto inter = brep_intersection(a, b); + EXPECT_TRUE(inter.is_valid()) << "intersection failed at iteration " << i; + + auto diff = brep_difference(a, b); + EXPECT_TRUE(diff.is_valid()) << "difference failed at iteration " << i; + }); + } +} + +// ═══════════════════════════════════════════════ +// 随机布尔链（连续多个布尔操作） +// ═══════════════════════════════════════════════ + +TEST(FuzzBoolean, RandomBooleanChain) { for (int i = 0; i < 20; ++i) { - double s = 1.0 + i * 0.2; - auto box = make_box(s, s, s); + EXPECT_NO_THROW({ + auto result = rand_primitive(); + int chain_len = static_cast(rand_range(2, 6)); - // Self-union should be valid - auto self_u = brep_union(box, box); - EXPECT_TRUE(self_u.is_valid()); + for (int j = 0; j < chain_len; ++j) { + auto other = rand_primitive(); + int op_choice = static_cast(rand_range(0, 3)); + switch (op_choice) { + case 0: result = brep_union(result, other); break; + case 1: result = brep_intersection(result, other); break; + default: result = brep_difference(result, other); break; + } + ASSERT_TRUE(result.is_valid()) + << "chain failed at step " << j << " of chain " << i; + } - // Self-difference should be valid - auto self_d = brep_difference(box, box); - EXPECT_TRUE(self_d.is_valid()); - - // Self-intersection should be valid - auto self_i = brep_intersection(box, box); - EXPECT_TRUE(self_i.is_valid()); + // 最终结果应仍有效 + EXPECT_TRUE(result.is_valid()); + }); + } +} + +// ═══════════════════════════════════════════════ +// 自交操作模糊测试 +// ═══════════════════════════════════════════════ + +TEST(FuzzBoolean, RandomSelfOperations) { + for (int i = 0; i < 30; ++i) { + auto body = rand_primitive(); + + EXPECT_NO_THROW({ + auto u = brep_union(body, body); + EXPECT_TRUE(u.is_valid()); + + auto inter = brep_intersection(body, body); + EXPECT_TRUE(inter.is_valid()); + + auto diff = brep_difference(body, body); + EXPECT_TRUE(diff.is_valid()); + }); + } +} + +// ═══════════════════════════════════════════════ +// 持续运行模式 +// ═══════════════════════════════════════════════ + +TEST(FuzzBoolean, ContinuousFuzz) { + const char* forever = std::getenv("VDE_FUZZ_FOREVER"); + if (!forever || std::string(forever) != "1") { + GTEST_SKIP() << "设置 VDE_FUZZ_FOREVER=1 启用持续模糊测试"; + } + + int iteration = 0; + while (true) { + ++iteration; + auto a = rand_primitive(); + auto b = rand_primitive(); + + // 三项布尔操作都必须成功 + auto u = brep_union(a, b); + ASSERT_TRUE(u.is_valid()) << "union failed at iteration " << iteration; + + auto inter = brep_intersection(a, b); + ASSERT_TRUE(inter.is_valid()) << "intersection failed at iteration " << iteration; + + auto diff = brep_difference(a, b); + ASSERT_TRUE(diff.is_valid()) << "difference failed at iteration " << iteration; + + // 验证 + auto vr_u = validate(u); + (void)vr_u; + auto vr_i = validate(inter); + (void)vr_i; + + if (iteration % 1000 == 0) { + std::cout << "[FuzzBoolean] iteration=" << iteration + << " union_faces=" << u.num_faces() + << " intersection_faces=" << inter.num_faces() + << std::endl; + } } } diff --git a/tests/fuzz/fuzz_format.cpp b/tests/fuzz/fuzz_format.cpp index 393b11a..a7972a2 100644 --- a/tests/fuzz/fuzz_format.cpp +++ b/tests/fuzz/fuzz_format.cpp @@ -1,40 +1,299 @@ +/// @file fuzz_format.cpp +/// @brief 格式往返模糊测试（IGES/STEP）+ 持续运行模式 +/// +/// 测试策略： +/// 1. 随机生成 B-Rep 体 → IGES 导出 → IGES 导入 → 验证一致性 +/// 2. 随机生成 B-Rep 体 → STEP 导出 → STEP 导入 → 验证一致性 +/// 3. 极端尺寸的格式往返 +/// 4. 多体格式往返 +/// 5. 持续运行模式 + #include +#include "vde/brep/brep.h" +#include "vde/brep/modeling.h" #include "vde/brep/iges_export.h" #include "vde/brep/iges_import.h" #include "vde/brep/step_export.h" #include "vde/brep/step_import.h" -#include "vde/brep/modeling.h" +#include "vde/core/point.h" +#include +#include +#include +#include using namespace vde::brep; +using namespace vde::core; -// ── Format fuzz: IGES round-trip ── +static std::mt19937 s_rng(42); -TEST(FuzzFormat, IgesRoundTrip) { - for (int i = 0; i < 10; ++i) { - double s = 0.5 + i * 0.5; - auto box = make_box(s, s, s); +namespace { - std::string iges = export_iges({box}); +double rand_range(double lo, double hi) { + return std::uniform_real_distribution(lo, hi)(s_rng); +} + +BrepModel rand_body() { + int choice = static_cast(rand_range(0, 3)); + switch (choice) { + case 0: + return make_box(rand_range(0.5, 10.0), + rand_range(0.5, 10.0), + rand_range(0.5, 10.0)); + case 1: + return make_cylinder(rand_range(0.3, 5.0), + rand_range(0.5, 10.0), + static_cast(rand_range(8, 32))); + default: + return make_sphere(rand_range(0.3, 5.0), + static_cast(rand_range(8, 24)), + static_cast(rand_range(4, 12))); + } +} + +} // anonymous + +// ═══════════════════════════════════════════════ +// IGES 随机往返 +// ═══════════════════════════════════════════════ + +TEST(FuzzFormat, Iges_RandomRoundTrip) { + for (int i = 0; i < 30; ++i) { + auto body = rand_body(); + EXPECT_TRUE(body.is_valid()); + + // 导出 IGES + std::string iges; + EXPECT_NO_THROW({ + iges = export_iges({body}); + }); + EXPECT_FALSE(iges.empty()) << "IGES export failed at iteration " << i; + + // 重新导入 + std::vector loaded; + EXPECT_NO_THROW({ + loaded = import_iges_from_string(iges); + }); + EXPECT_FALSE(loaded.empty()) << "IGES import failed at iteration " << i; + + // 验证导入体 + for (auto& lb : loaded) { + EXPECT_TRUE(lb.is_valid()) << "imported body invalid at iteration " << i; + } + } +} + +TEST(FuzzFormat, Iges_MultiBodyRoundTrip) { + for (int i = 0; i < 15; ++i) { + int count = static_cast(rand_range(2, 5)); + std::vector bodies; + for (int j = 0; j < count; ++j) { + bodies.push_back(rand_body()); + } + + std::string iges; + EXPECT_NO_THROW({ iges = export_iges(bodies); }); EXPECT_FALSE(iges.empty()); - auto loaded = import_iges_from_string(iges); + std::vector loaded; + EXPECT_NO_THROW({ loaded = import_iges_from_string(iges); }); EXPECT_FALSE(loaded.empty()); - EXPECT_TRUE(loaded[0].is_valid()); + EXPECT_GE(loaded.size(), 1u); // 可能合并或保留多个体 + + for (auto& lb : loaded) { + EXPECT_TRUE(lb.is_valid()); + } } } -// ── Format fuzz: STEP round-trip ── +TEST(FuzzFormat, Iges_ExtremeSizes) { + // 极端尺寸的 IGES 往返 + double sizes[] = {1e-3, 1e-1, 1.0, 10.0, 100.0, 1000.0}; + for (double s : sizes) { + auto body = make_box(s, s * 0.5, s * 2.0); -TEST(FuzzFormat, StepRoundTrip) { - for (int i = 0; i < 10; ++i) { - double s = 0.5 + i * 0.5; - auto box = make_box(s, s, s); + EXPECT_NO_THROW({ + std::string iges = export_iges({body}); + EXPECT_FALSE(iges.empty()); - std::string step = export_step({box}); + auto loaded = import_iges_from_string(iges); + EXPECT_FALSE(loaded.empty()); + EXPECT_TRUE(loaded[0].is_valid()); + }) << "failed at size=" << s; + } +} + +// ═══════════════════════════════════════════════ +// STEP 随机往返 +// ═══════════════════════════════════════════════ + +TEST(FuzzFormat, Step_RandomRoundTrip) { + for (int i = 0; i < 30; ++i) { + auto body = rand_body(); + EXPECT_TRUE(body.is_valid()); + + std::string step; + EXPECT_NO_THROW({ + step = export_step({body}); + }); + EXPECT_FALSE(step.empty()) << "STEP export failed at iteration " << i; + + std::vector loaded; + EXPECT_NO_THROW({ + loaded = import_step_from_string(step); + }); + EXPECT_FALSE(loaded.empty()) << "STEP import failed at iteration " << i; + + for (auto& lb : loaded) { + EXPECT_TRUE(lb.is_valid()) << "imported body invalid at iteration " << i; + } + } +} + +TEST(FuzzFormat, Step_MultiBodyRoundTrip) { + for (int i = 0; i < 15; ++i) { + int count = static_cast(rand_range(2, 5)); + std::vector bodies; + for (int j = 0; j < count; ++j) { + bodies.push_back(rand_body()); + } + + std::string step; + EXPECT_NO_THROW({ step = export_step(bodies); }); EXPECT_FALSE(step.empty()); - auto loaded = import_step_from_string(step); + std::vector loaded; + EXPECT_NO_THROW({ loaded = import_step_from_string(step); }); EXPECT_FALSE(loaded.empty()); - EXPECT_TRUE(loaded[0].is_valid()); + + for (auto& lb : loaded) { + EXPECT_TRUE(lb.is_valid()); + } + } +} + +TEST(FuzzFormat, Step_ExtremeSizes) { + double sizes[] = {1e-3, 1e-1, 1.0, 10.0, 100.0, 1000.0}; + for (double s : sizes) { + auto body = make_box(s, s * 0.5, s * 2.0); + + EXPECT_NO_THROW({ + std::string step = export_step({body}); + EXPECT_FALSE(step.empty()); + + auto loaded = import_step_from_string(step); + EXPECT_FALSE(loaded.empty()); + EXPECT_TRUE(loaded[0].is_valid()); + }) << "failed at size=" << s; + } +} + +// ═══════════════════════════════════════════════ +// 交叉格式往返（IGES → STEP → IGES） +// ═══════════════════════════════════════════════ + +TEST(FuzzFormat, CrossFormat_IGES_to_STEP) { + for (int i = 0; i < 15; ++i) { + auto body = rand_body(); + + EXPECT_NO_THROW({ + // IGES export → STEP import + std::string iges = export_iges({body}); + auto from_iges = import_iges_from_string(iges); + EXPECT_FALSE(from_iges.empty()); + + // STEP export → IGES import + std::string step = export_step({body}); + auto from_step = import_step_from_string(step); + EXPECT_FALSE(from_step.empty()); + + // Both should be valid + EXPECT_TRUE(from_iges[0].is_valid()); + EXPECT_TRUE(from_step[0].is_valid()); + }); + } +} + +TEST(FuzzFormat, CrossFormat_STEP_to_IGES) { + for (int i = 0; i < 15; ++i) { + auto body = rand_body(); + + EXPECT_NO_THROW({ + // STEP → IGES + std::string step = export_step({body}); + auto from_step = import_step_from_string(step); + ASSERT_FALSE(from_step.empty()); + + std::string iges = export_iges(from_step); + auto from_iges = import_iges_from_string(iges); + EXPECT_FALSE(from_iges.empty()); + EXPECT_TRUE(from_iges[0].is_valid()); + }); + } +} + +// ═══════════════════════════════════════════════ +// 布尔运算后的格式往返 +// ═══════════════════════════════════════════════ + +TEST(FuzzFormat, BooleanThenRoundTrip) { + for (int i = 0; i < 10; ++i) { + auto a = rand_body(); + auto b = rand_body(); + + EXPECT_NO_THROW({ + // 先做布尔运算 + auto u = brep_union(a, b); + + // IGES 往返 + std::string iges = export_iges({u}); + auto from_iges = import_iges_from_string(iges); + EXPECT_FALSE(from_iges.empty()); + EXPECT_TRUE(from_iges[0].is_valid()); + + // STEP 往返 + std::string step = export_step({u}); + auto from_step = import_step_from_string(step); + EXPECT_FALSE(from_step.empty()); + EXPECT_TRUE(from_step[0].is_valid()); + }); + } +} + +// ═══════════════════════════════════════════════ +// 持续运行模式 +// ═══════════════════════════════════════════════ + +TEST(FuzzFormat, ContinuousFuzz) { + const char* forever = std::getenv("VDE_FUZZ_FOREVER"); + if (!forever || std::string(forever) != "1") { + GTEST_SKIP() << "设置 VDE_FUZZ_FOREVER=1 启用持续模糊测试"; + } + + int iteration = 0; + while (true) { + ++iteration; + auto body = rand_body(); + ASSERT_TRUE(body.is_valid()); + + // IGES 往返 + std::string iges = export_iges({body}); + ASSERT_FALSE(iges.empty()); + auto from_iges = import_iges_from_string(iges); + ASSERT_FALSE(from_iges.empty()) << "IGES import failed at iteration " << iteration; + ASSERT_TRUE(from_iges[0].is_valid()); + + // STEP 往返 + std::string step = export_step({body}); + ASSERT_FALSE(step.empty()); + auto from_step = import_step_from_string(step); + ASSERT_FALSE(from_step.empty()) << "STEP import failed at iteration " << iteration; + ASSERT_TRUE(from_step[0].is_valid()); + + if (iteration % 1000 == 0) { + std::cout << "[FuzzFormat] iteration=" << iteration + << " iges_len=" << iges.size() + << " step_len=" << step.size() + << std::endl; + } } } diff --git a/tests/fuzz/fuzz_sdf.cpp b/tests/fuzz/fuzz_sdf.cpp index b2b292f..3fcf93c 100644 --- a/tests/fuzz/fuzz_sdf.cpp +++ b/tests/fuzz/fuzz_sdf.cpp @@ -1,81 +1,271 @@ +/// @file fuzz_sdf.cpp +/// @brief SDF 随机CSG树模糊测试 + 持续运行模式 +/// +/// 测试策略： +/// 1. 随机生成深度 CSG 树（最大深度 6） +/// 2. 随机选择操作符（union/intersection/difference/smooth variants） +/// 3. 随机选择图元（sphere/box/cylinder/torus/capsule） +/// 4. 随机应用域变形（translate/rotate/scale/twist/bend） +/// 5. 随机采样点评估并验证结果 +/// 6. 持续运行模式（命令行参数 -1 表示无限循环） + #include #include "vde/sdf/sdf_primitives.h" #include "vde/sdf/sdf_operations.h" #include "vde/sdf/sdf_tree.h" #include #include +#include +#include +#include using namespace vde::sdf; using namespace vde::core; -// ── SDF fuzz: random sphere evaluation ── +// ═══════════════════════════════════════════════ +// SDF 随机种子 +// ═══════════════════════════════════════════════ -TEST(FuzzSdf, RandomSpheres) { - std::mt19937 rng(42); - std::uniform_real_distribution pos(-100, 100); - std::uniform_real_distribution rad(0.1, 10.0); +static std::mt19937 s_rng(42); - for (int i = 0; i < 100; ++i) { - double r = rad(rng); - double x = pos(rng), y = pos(rng), z = pos(rng); - Point3D p(x, y, z); +// ═══════════════════════════════════════════════ +// 随机参数生成器 +// ═══════════════════════════════════════════════ - double d = sphere(p, r); - // Basic sanity: SDF should be finite - EXPECT_TRUE(std::isfinite(d)); - // On surface, SDF should be 0 - // Point on sphere in X direction - Point3D on_surf(r, 0, 0); - EXPECT_NEAR(sphere(on_surf, r), 0.0, 1e-6); - } +namespace { + +/// 随机双精度 [lo, hi] +double rand_range(double lo, double hi) { + std::uniform_real_distribution dist(lo, hi); + return dist(s_rng); } -// ── SDF fuzz: random CSG boolean combinations ── - -TEST(FuzzSdf, RandomCSG) { - std::mt19937 rng(42); - std::uniform_real_distribution pos(-10, 10); - std::uniform_real_distribution rad(0.5, 5.0); - - for (int i = 0; i < 100; ++i) { - double r1 = rad(rng), r2 = rad(rng); - double x = pos(rng), y = pos(rng), z = pos(rng); - Point3D p(x, y, z); - - double d1 = sphere(Point3D(x, y, z), r1); - double d2 = box(Point3D(x, y, z), Point3D(r2, r2, r2)); - - double du = op_union(d1, d2); - double di = op_intersection(d1, d2); - double dd = op_difference(d1, d2); - - EXPECT_TRUE(std::isfinite(du)); - EXPECT_TRUE(std::isfinite(di)); - EXPECT_TRUE(std::isfinite(dd)); - - // Union of A and B should be <= max(A,B) at any point - EXPECT_LE(du, std::max(d1, d2) + 1e-9); - } +/// 随机 Point3D，范围 [lo, hi] +Point3D rand_point(double lo, double hi) { + return Point3D(rand_range(lo, hi), rand_range(lo, hi), rand_range(lo, hi)); } -// ── SDF fuzz: random SDF tree construction and evaluation ── +/// 随机选择操作类型（CSG 布尔） +SdfOp rand_csg_op() { + static const SdfOp ops[] = { + SdfOp::Union, SdfOp::Intersection, SdfOp::Difference, + SdfOp::SmoothUnion, SdfOp::SmoothIntersection, SdfOp::SmoothDifference + }; + return ops[std::uniform_int_distribution(0, 5)(s_rng)]; +} -TEST(FuzzSdf, RandomTreeEvaluate) { - std::mt19937 rng(42); +/// 随机选择图元类型 +SdfOp rand_primitive_op() { + static const SdfOp ops[] = { + SdfOp::Sphere, SdfOp::Box, SdfOp::Cylinder, + SdfOp::Torus, SdfOp::Capsule + }; + return ops[std::uniform_int_distribution(0, 4)(s_rng)]; +} +/// 随机选择域变形类型 +SdfOp rand_transform_op() { + static const SdfOp ops[] = { + SdfOp::Translate, SdfOp::Rotate, SdfOp::Scale, + SdfOp::Twist, SdfOp::Bend + }; + return ops[std::uniform_int_distribution(0, 4)(s_rng)]; +} + +} // anonymous + +// ═══════════════════════════════════════════════ +// 随机 CSG 树构造 +// ═══════════════════════════════════════════════ + +/// 创建随机图元节点 +SdfNodePtr rand_primitive() { + SdfOp op = rand_primitive_op(); + auto node = std::make_shared(op); + + switch (op) { + case SdfOp::Sphere: + node->params.radius = rand_range(0.1, 5.0); + break; + case SdfOp::Box: + node->params.extents = rand_point(0.1, 3.0); + break; + case SdfOp::Cylinder: + node->params.radius = rand_range(0.1, 3.0); + node->params.height = rand_range(0.2, 6.0); + break; + case SdfOp::Torus: + node->params.major_radius = rand_range(0.5, 4.0); + node->params.minor_radius = rand_range(0.1, 1.5); + break; + case SdfOp::Capsule: + node->params.pt_a = Point3D(0, -rand_range(0.5, 3.0), 0); + node->params.pt_b = Point3D(0, rand_range(0.5, 3.0), 0); + node->params.radius = rand_range(0.1, 1.0); + break; + default: + break; + } + return node; +} + +/// 创建随机 CSG 布尔节点（递归） +SdfNodePtr rand_csg_tree(int depth, int max_depth) { + if (depth >= max_depth) { + return rand_primitive(); + } + + SdfOp op = rand_csg_op(); + auto left = rand_csg_tree(depth + 1, max_depth); + auto right = rand_csg_tree(depth + 1, max_depth); + + auto node = std::make_shared(op); + node->children.push_back(left); + node->children.push_back(right); + + if (op == SdfOp::SmoothUnion || op == SdfOp::SmoothIntersection || + op == SdfOp::SmoothDifference) { + node->params.blend_k = rand_range(0.05, 0.5); + } + + return node; +} + +/// 随机应用域变形包装 +SdfNodePtr wrap_transform(SdfNodePtr child) { + if (rand_range(0.0, 1.0) < 0.3) { + SdfOp op = rand_transform_op(); + auto node = std::make_shared(op); + node->children.push_back(child); + + switch (op) { + case SdfOp::Translate: + node->params.translate_offset = rand_point(-2.0, 2.0); + break; + case SdfOp::Rotate: + node->params.amount = rand_range(-M_PI, M_PI); + break; + case SdfOp::Scale: + node->params.scale_factors = rand_point(0.5, 2.0); + break; + case SdfOp::Twist: + node->params.amount = rand_range(-0.5, 0.5); + break; + case SdfOp::Bend: + node->params.amount = rand_range(-0.3, 0.3); + break; + default: + break; + } + return node; + } + return child; +} + +// ═══════════════════════════════════════════════ +// 模糊测试用例 +// ═══════════════════════════════════════════════ + +TEST(FuzzSdf, RandomCSGTree_Evaluate) { + // 生成多个随机树并在多个点处求值 for (int i = 0; i < 50; ++i) { - auto tree = SdfNode::smooth_union( - SdfNode::sphere(1.0 + (i % 5) * 0.5), - SdfNode::box(Point3D(1, 1, 1)), - 0.1 + (i % 3) * 0.2 - ); + auto tree = rand_csg_tree(0, 4); + // 可选变形包装 + tree = wrap_transform(tree); - for (int j = 0; j < 20; ++j) { - double x = (j % 7 - 3) * 1.0; - double y = (j % 5 - 2) * 1.0; - double z = (j % 3 - 1) * 1.0; - double v = evaluate(tree, Point3D(x, y, z)); - EXPECT_TRUE(std::isfinite(v)); + for (int j = 0; j < 30; ++j) { + Point3D p = rand_point(-5.0, 5.0); + EXPECT_NO_THROW({ + double v = evaluate(tree, p); + // 求值结果必须是有限数（不应是 NaN 或 Inf） + EXPECT_TRUE(std::isfinite(v)); + }); + } + } +} + +TEST(FuzzSdf, RandomCSGTree_DeepTree) { + // 深度 CSG 树（depth 6 → 最多 2^6 = 64 个叶子节点） + for (int i = 0; i < 20; ++i) { + auto tree = rand_csg_tree(0, 6); + + EXPECT_NO_THROW({ + auto bbox = estimate_bbox(tree, 0.5); + EXPECT_TRUE(std::isfinite(bbox.min.x())); + EXPECT_TRUE(std::isfinite(bbox.max.x())); + + Point3D p = rand_point(-10.0, 10.0); + double v = evaluate(tree, p); + EXPECT_TRUE(std::isfinite(v)); + }); + } +} + +TEST(FuzzSdf, RandomCSGTree_Bounds) { + // 验证 estimate_bounds 对所有随机树返回合理的值 + for (int i = 0; i < 30; ++i) { + auto tree = rand_csg_tree(0, 3); + tree = wrap_transform(tree); + + EXPECT_NO_THROW({ + auto half = estimate_bounds(tree, 1.0); + EXPECT_GE(half.x(), 0.0); + EXPECT_GE(half.y(), 0.0); + EXPECT_GE(half.z(), 0.0); + EXPECT_TRUE(std::isfinite(half.x())); + EXPECT_TRUE(std::isfinite(half.y())); + EXPECT_TRUE(std::isfinite(half.z())); + }); + } +} + +TEST(FuzzSdf, RandomTree_Visit) { + // 验证 visit() 对所有随机树都不崩溃 + for (int i = 0; i < 30; ++i) { + auto tree = rand_csg_tree(0, 4); + tree = wrap_transform(tree); + + EXPECT_NO_THROW({ + int count = 0; + tree->visit([&](const SdfNode& /*n*/) { ++count; }); + EXPECT_GT(count, 0); + }); + } +} + +// ═══════════════════════════════════════════════ +// 持续运行模式（-1 = 无限循环） +// 用法: ./fuzz_sdf --fuzz_forever +// ═══════════════════════════════════════════════ + +TEST(FuzzSdf, ContinuousFuzz) { + // 检查环境变量 VDE_FUZZ_FOREVER=1 启用持续模式 + const char* forever = std::getenv("VDE_FUZZ_FOREVER"); + if (!forever || std::string(forever) != "1") { + GTEST_SKIP() << "设置 VDE_FUZZ_FOREVER=1 启用持续模糊测试"; + } + + // 持续运行直到手动停止 + int iteration = 0; + while (true) { + ++iteration; + auto tree = rand_csg_tree(0, std::uniform_int_distribution(2, 5)(s_rng)); + tree = wrap_transform(tree); + + Point3D p = rand_point(-10.0, 10.0); + double v = evaluate(tree, p); + + ASSERT_TRUE(std::isfinite(v)) + << "iteration=" << iteration + << " 非有限 SDF 值: " << v; + + // 每 10000 次打印一次进度 + if (iteration % 10000 == 0) { + auto bbox = estimate_bbox(tree, 1.0); + std::cout << "[FuzzSdf] iteration=" << iteration + << " value=" << v + << " bbox=[" << bbox.min.x() << "," << bbox.max.x() << "]" + << std::endl; } } } diff --git a/tests/regression/CMakeLists.txt b/tests/regression/CMakeLists.txt new file mode 100644 index 0000000..b6959cb --- /dev/null +++ b/tests/regression/CMakeLists.txt @@ -0,0 +1,4 @@ +add_vde_test(regression_degenerate) +add_vde_test(regression_extreme) +add_vde_test(regression_thin_wall) +add_vde_test(regression_large_model) diff --git a/tests/regression/regression_degenerate.cpp b/tests/regression/regression_degenerate.cpp new file mode 100644 index 0000000..8c583d3 --- /dev/null +++ b/tests/regression/regression_degenerate.cpp @@ -0,0 +1,214 @@ +/// @file regression_degenerate.cpp +/// @brief 退化几何回归测试集 +/// +/// 覆盖场景： +/// 1. 零长度边（zero-length edge） +/// 2. 零面积面（zero-area face） +/// 3. 重合顶点（coincident vertices） +/// 4. 自交体（self-intersecting body） +/// +/// 每个测试：构造退化体 → 布尔/修复/验证 → 断言不崩溃 + +#include +#include "vde/brep/brep.h" +#include "vde/brep/modeling.h" +#include "vde/brep/brep_boolean.h" +#include "vde/brep/brep_validate.h" +#include "vde/brep/brep_heal.h" +#include "vde/core/point.h" +#include +#include + +using namespace vde::brep; +using namespace vde::core; + +// ── 辅助函数 ── + +/// 断言 BrepModel 至少不会崩溃（尝试布尔、验证、修复都不会抛异常） +void assert_no_crash(const BrepModel& body) { + // 1. 基本验证：能调用 is_valid() + EXPECT_NO_THROW({ body.is_valid(); }); + + // 2. 验证：能调用 validate() + EXPECT_NO_THROW({ auto result = validate(body); (void)result; }); + + // 3. 布尔自交：A∪A, A∩A, A\\A + EXPECT_NO_THROW({ auto u = brep_union(body, body); (void)u; }); + EXPECT_NO_THROW({ auto i = brep_intersection(body, body); (void)i; }); + EXPECT_NO_THROW({ auto d = brep_difference(body, body); (void)d; }); + + // 4. 修复：heal_topology 不崩溃 + { + BrepModel copy = body; + EXPECT_NO_THROW({ heal_topology(copy, 1e-6); }); + } + + // 5. 网格导出：to_mesh 不崩溃 + EXPECT_NO_THROW({ auto mesh = body.to_mesh(); (void)mesh; }); +} + +// ═══════════════════════════════════════════════ +// 零长度边测试 +// ═══════════════════════════════════════════════ + +TEST(RegressionDegenerate, ZeroLengthEdge_Box) { + // 通过 make_box(0, 1, 1) 构造含退化边的体 + // 宽度为 0 → 侧面退化为零面积面 + EXPECT_NO_THROW({ + auto body = make_box(0.0, 1.0, 1.0); + assert_no_crash(body); + }); +} + +TEST(RegressionDegenerate, ZeroLengthEdge_ExtremeSmall) { + // 极窄长方体（宽 ≤ 1e-12）→ 近乎零长度边 + for (double w : {1e-12, 1e-10, 1e-8}) { + EXPECT_NO_THROW({ + auto body = make_box(w, 1.0, 1.0); + assert_no_crash(body); + }); + } +} + +// ═══════════════════════════════════════════════ +// 零面积面测试 +// ═══════════════════════════════════════════════ + +TEST(RegressionDegenerate, ZeroAreaFace_FlatBox) { + // 一个维度为 0 → 退化成一个平面 + EXPECT_NO_THROW({ + auto box0 = make_box(0.0, 5.0, 5.0); + assert_no_crash(box0); + + // 与正常 box 做布尔 + auto box = make_box(3.0, 3.0, 3.0); + auto u = brep_union(box0, box); + (void)u.is_valid(); + auto i = brep_intersection(box0, box); + (void)i.is_valid(); + auto d = brep_difference(box, box0); + (void)d.is_valid(); + }); +} + +TEST(RegressionDegenerate, ZeroAreaFace_Sliver) { + // 一个极其扁平的体（高度极其小） + for (double h : {1e-12, 1e-10, 1e-9}) { + EXPECT_NO_THROW({ + auto thin = make_box(1.0, h, 1.0); + assert_no_crash(thin); + + // 瘦短板与正常盒子的布尔 + auto box = make_box(2.0, 2.0, 2.0); + auto u = brep_union(thin, box); + (void)u.is_valid(); + }); + } +} + +// ═══════════════════════════════════════════════ +// 重合顶点测试 +// ═══════════════════════════════════════════════ + +TEST(RegressionDegenerate, CoincidentVertices_SelfUnion) { + // 两个完全相同的盒子做布尔 → 所有面/边/顶点重合 + auto box = make_box(2.0, 2.0, 2.0); + EXPECT_NO_THROW({ + auto u = brep_union(box, box); + EXPECT_TRUE(u.is_valid()); + auto result = validate(u); + (void)result; + }); +} + +TEST(RegressionDegenerate, CoincidentVertices_SelfIntersection) { + auto box = make_box(2.0, 2.0, 2.0); + EXPECT_NO_THROW({ + auto i = brep_intersection(box, box); + EXPECT_TRUE(i.is_valid()); + }); +} + +TEST(RegressionDegenerate, CoincidentVertices_SelfDifference) { + auto box = make_box(2.0, 2.0, 2.0); + EXPECT_NO_THROW({ + auto d = brep_difference(box, box); + EXPECT_TRUE(d.is_valid()); + }); +} + +// ═══════════════════════════════════════════════ +// 自交体测试（通过治疗修复验证） +// ═══════════════════════════════════════════════ + +TEST(RegressionDegenerate, SelfIntersecting_Heal) { + // 使用极小偏移的重复体模拟自交场景 + auto box = make_box(2.0, 2.0, 2.0); + + // 重复布尔运算产生复杂拓扑，至少不应该崩溃 + for (int i = 0; i < 5; ++i) { + EXPECT_NO_THROW({ + auto u = brep_union(box, box); + auto result = validate(u); + (void)result; + BrepModel copy = u; + heal_topology(copy, 1e-4); + }); + } + + // 使用不同尺寸的盒子布尔链式操作 + auto small = make_box(0.5, 0.5, 0.5); + EXPECT_NO_THROW({ + auto diff = brep_difference(box, small); + auto result = validate(diff); + (void)result; + heal_topology(diff, 1e-4); + }); +} + +// ═══════════════════════════════════════════════ +// 退化圆柱测试 +// ═══════════════════════════════════════════════ + +TEST(RegressionDegenerate, DegenerateCylinder_ZeroRadius) { + // 半径为 0 的圆柱（退化为线） + EXPECT_NO_THROW({ + auto cyl = make_cylinder(0.0, 1.0, 8); + assert_no_crash(cyl); + }); +} + +TEST(RegressionDegenerate, DegenerateCylinder_ZeroHeight) { + // 高度为 0 的圆柱（退化为圆盘） + EXPECT_NO_THROW({ + auto cyl = make_cylinder(1.0, 0.0, 16); + assert_no_crash(cyl); + }); +} + +TEST(RegressionDegenerate, DegenerateSphere_ZeroRadius) { + // 半径为 0 的球（退化为点） + EXPECT_NO_THROW({ + auto sph = make_sphere(0.0, 8, 4); + assert_no_crash(sph); + }); +} + +// ═══════════════════════════════════════════════ +// 退化修复流水线测试 +// ═══════════════════════════════════════════════ + +TEST(RegressionDegenerate, HealDegenerateModel) { + // 从退化体开始，通过修复流水线处理 + auto thin = make_box(1.0, 1e-12, 1.0); + EXPECT_NO_THROW({ + int n_gaps = heal_gaps(thin, 1e-6); + (void)n_gaps; + int n_slivers = heal_slivers(thin); + (void)n_slivers; + int n_oriented = heal_orientation(thin); + (void)n_oriented; + bool ok = heal_topology(thin, 1e-4); + (void)ok; + }); +} diff --git a/tests/regression/regression_extreme.cpp b/tests/regression/regression_extreme.cpp new file mode 100644 index 0000000..85304c7 --- /dev/null +++ b/tests/regression/regression_extreme.cpp @@ -0,0 +1,225 @@ +/// @file regression_extreme.cpp +/// @brief 极端坐标回归测试 +/// +/// 覆盖场景： +/// 1. 极小坐标（1e-15） +/// 2. 极大坐标（1e15） +/// 3. NaN 输入 +/// 4. Inf 输入 +/// +/// 每个测试：构造极端体 → 布尔/修复/验证 → 断言不崩溃 + +#include +#include "vde/brep/brep.h" +#include "vde/brep/modeling.h" +#include "vde/brep/brep_boolean.h" +#include "vde/brep/brep_validate.h" +#include "vde/brep/brep_heal.h" +#include "vde/core/point.h" +#include +#include + +using namespace vde::brep; +using namespace vde::core; + +// ── 极小坐标测试 ── + +TEST(RegressionExtreme, TinyCoordinates_1eMinus15) { + // 极小的盒子：尺寸为 1e-15 + double s = 1e-15; + EXPECT_NO_THROW({ + auto tiny = make_box(s, s, s); + // 验证合法性 + EXPECT_TRUE(tiny.is_valid()); + + // 布尔运算：与正常盒子 + auto box = make_box(1.0, 1.0, 1.0); + auto u = brep_union(tiny, box); + EXPECT_TRUE(u.is_valid()); + auto i = brep_intersection(tiny, box); + EXPECT_TRUE(i.is_valid()); + + // 导出网格 + auto mesh = tiny.to_mesh(); + (void)mesh; + }); +} + +TEST(RegressionExtreme, TinyCoordinates_1eMinus10) { + double s = 1e-10; + EXPECT_NO_THROW({ + auto tiny = make_box(s, s, s); + EXPECT_TRUE(tiny.is_valid()); + auto mesh = tiny.to_mesh(); + (void)mesh; + + // 修复流水线 + BrepModel copy = tiny; + heal_topology(copy, s * 0.1); + }); +} + +TEST(RegressionExtreme, TinyCoordinates_Mixed) { + // 一个维度极小，其他正常 + EXPECT_NO_THROW({ + auto thin = make_box(1e-15, 1.0, 1.0); + EXPECT_NO_THROW({ thin.is_valid(); }); + auto result = validate(thin); + (void)result; + + auto mesh = thin.to_mesh(); + (void)mesh; + }); +} + +// ── 极大坐标测试 ── + +TEST(RegressionExtreme, HugeCoordinates_1e15) { + double s = 1e15; + EXPECT_NO_THROW({ + auto huge = make_box(s, s, s); + // 基本验证不崩溃 + EXPECT_TRUE(huge.is_valid()); + + // 包围盒计算 + auto bb = huge.bounds(); + EXPECT_TRUE(std::isfinite(bb.min().x())); + EXPECT_TRUE(std::isfinite(bb.max().x())); + + // 布尔自交 + auto u = brep_union(huge, huge); + EXPECT_TRUE(u.is_valid()); + + // 网格导出（大尺寸模型） + auto mesh = huge.to_mesh(0.01 * s); + (void)mesh; + }); +} + +TEST(RegressionExtreme, HugeVsTiny) { + // 巨大体与极小体的布尔 + EXPECT_NO_THROW({ + auto huge = make_box(1e12, 1e12, 1e12); + auto tiny = make_box(1e-12, 1e-12, 1e-12); + + auto u = brep_union(huge, tiny); + EXPECT_TRUE(u.is_valid()); + auto i = brep_intersection(huge, tiny); + EXPECT_TRUE(i.is_valid()); + }); +} + +// ── NaN 输入测试 ── + +TEST(RegressionExtreme, NaN_Handling) { + double nan = std::numeric_limits::quiet_NaN(); + + // make_box 应对 NaN 表现得优雅（返回无效体或抛出，但绝不能崩溃） + EXPECT_NO_THROW({ + auto body = make_box(nan, 1.0, 1.0); + (void)body; + }); + + EXPECT_NO_THROW({ + auto body = make_box(1.0, nan, 1.0); + (void)body; + }); + + EXPECT_NO_THROW({ + auto body = make_box(1.0, 1.0, nan); + (void)body; + }); + + EXPECT_NO_THROW({ + auto body = make_box(nan, nan, nan); + (void)body; + }); +} + +TEST(RegressionExtreme, NaN_BooleanResilience) { + // 若 NaN 产生了有效的 body，检查布尔运算不崩溃 + auto good = make_box(2.0, 2.0, 2.0); + + // 将所有尝试包裹在 EXPECT_NO_THROW 中 + EXPECT_NO_THROW({ + try { + auto bad = make_box(std::numeric_limits::quiet_NaN(), 1.0, 1.0); + auto u = brep_union(good, bad); + (void)u; + } catch (...) { + // 允许抛异常但不应崩溃 + } + }); +} + +// ── Inf 输入测试 ── + +TEST(RegressionExtreme, Inf_Handling) { + double inf = std::numeric_limits::infinity(); + + EXPECT_NO_THROW({ + auto body = make_box(inf, 1.0, 1.0); + (void)body; + }); + + EXPECT_NO_THROW({ + auto body = make_box(1.0, inf, 1.0); + (void)body; + }); + + EXPECT_NO_THROW({ + auto body = make_box(1.0, 1.0, inf); + (void)body; + }); +} + +// ── 极大值 vs 极小值布尔 ── + +TEST(RegressionExtreme, MaxDouble_Boolean) { + double big = 1e100; + double small = 1e-100; + + EXPECT_NO_THROW({ + auto a = make_box(big, 1.0, 1.0); + auto b = make_box(small, 1.0, 1.0); + auto u = brep_union(a, b); + (void)u.is_valid(); + }); +} + +// ── 边界值批处理 ── + +TEST(RegressionExtreme, BoundaryValuesBatch) { + // 一系列边界值，确保每个都不会崩溃 + double values[] = { + 0.0, + std::numeric_limits::min(), + std::numeric_limits::denorm_min(), + std::numeric_limits::epsilon(), + 1e-15, 1e-10, 1e-5, + 1.0, 10.0, 100.0, + 1e5, 1e10, 1e15, + std::numeric_limits::max() * 0.5, + }; + + for (double v : values) { + if (!std::isfinite(v)) continue; + EXPECT_NO_THROW({ + auto body = make_box(v, v, v); + body.is_valid(); + auto mesh = body.to_mesh(); + (void)mesh; + }) << "failed at v=" << v; + } + + // 混合边界值布尔 + auto a = make_box(values[0], 1.0, 1.0); + for (int i = 1; i < 10; ++i) { + if (!std::isfinite(values[i])) continue; + EXPECT_NO_THROW({ + auto b = make_box(values[i], 1.0, 1.0); + auto u = brep_union(a, b); + (void)u.is_valid(); + }) << "failed at i=" << i; + } +} diff --git a/tests/regression/regression_large_model.cpp b/tests/regression/regression_large_model.cpp new file mode 100644 index 0000000..af76664 --- /dev/null +++ b/tests/regression/regression_large_model.cpp @@ -0,0 +1,188 @@ +/// @file regression_large_model.cpp +/// @brief 大面数回归测试（1000+ 面模型） +/// +/// 覆盖场景： +/// 1. 通过高细分球体/圆柱产生 1000+ 面的模型 +/// 2. 大面数模型的布尔运算 +/// 3. 大面数模型的验证（validate） +/// 4. 大面数模型的修复 +/// +/// 每个测试：构造大面数体 → 布尔/修复/验证 → 断言不崩溃 + +#include +#include "vde/brep/brep.h" +#include "vde/brep/modeling.h" +#include "vde/brep/brep_boolean.h" +#include "vde/brep/brep_validate.h" +#include "vde/brep/brep_heal.h" +#include "vde/core/point.h" +#include + +using namespace vde::brep; +using namespace vde::core; + +/// 生成一个高面数的球体 +/// seg_u × seg_v 段 → 大约 2 * seg_u * seg_v 个面 +/// 例如 seg_u=50, seg_v=50 → 约 5000 面 +static BrepModel make_highres_sphere(double radius, int seg_u, int seg_v) { + return make_sphere(radius, seg_u, seg_v); +} + +/// 生成一个高面数的圆柱体 +/// segments 段 → 侧面有 segments * 1 个面，加上顶/底面 +static BrepModel make_highres_cylinder(double radius, double height, int segments) { + return make_cylinder(radius, height, segments); +} + +// ═══════════════════════════════════════════════ +// 1000+ 面模型 - 球体 +// ═══════════════════════════════════════════════ + +TEST(RegressionLargeModel, Sphere_1000PlusFaces) { + // seg_u=25, seg_v=20 → 2*25*20 = 1000 faces + EXPECT_NO_THROW({ + auto sphere = make_sphere(10.0, 25, 20); + EXPECT_TRUE(sphere.is_valid()); + EXPECT_GE(sphere.num_faces(), 800u); // 至少 800 面 + + // 验证 + auto result = validate(sphere); + (void)result; + + // 导出网格 + auto mesh = sphere.to_mesh(0.05); + (void)mesh; + }); +} + +TEST(RegressionLargeModel, Sphere_5000PlusFaces) { + // seg_u=55, seg_v=50 → 2*55*50 = 5500 faces + EXPECT_NO_THROW({ + auto sphere = make_sphere(5.0, 55, 50); + EXPECT_TRUE(sphere.is_valid()); + EXPECT_GE(sphere.num_faces(), 4000u); + + auto result = validate(sphere); + (void)result; + + auto mesh = sphere.to_mesh(0.01); + (void)mesh; + }); +} + +// ═══════════════════════════════════════════════ +// 1000+ 面模型 - 圆柱体 +// ═══════════════════════════════════════════════ + +TEST(RegressionLargeModel, Cylinder_1000PlusFaces) { + // segments=1000 → 侧面有很多面 + EXPECT_NO_THROW({ + auto cyl = make_cylinder(5.0, 10.0, 1000); + EXPECT_TRUE(cyl.is_valid()); + // seg=1000 时侧面有 1000 个面 + 上下各 1（或更多）面 + EXPECT_GE(cyl.num_faces(), 900u); + + auto result = validate(cyl); + (void)result; + + auto mesh = cyl.to_mesh(); + (void)mesh; + }); +} + +// ═══════════════════════════════════════════════ +// 大面数模型布尔运算 +// ═══════════════════════════════════════════════ + +TEST(RegressionLargeModel, Boolean_LargeSphereUnion) { + auto s1 = make_sphere(5.0, 30, 24); // ~1440 faces + auto s2 = make_sphere(3.0, 20, 16); // ~640 faces + + EXPECT_NO_THROW({ + auto u = brep_union(s1, s2); + EXPECT_TRUE(u.is_valid()); + auto result = validate(u); + (void)result; + }); +} + +TEST(RegressionLargeModel, Boolean_LargeSphereIntersection) { + auto s1 = make_sphere(5.0, 30, 24); + auto s2 = make_sphere(3.0, 24, 20); + + EXPECT_NO_THROW({ + auto i = brep_intersection(s1, s2); + EXPECT_TRUE(i.is_valid()); + }); +} + +TEST(RegressionLargeModel, Boolean_LargeCylinders) { + // 高分辨率圆柱布尔运算 + auto c1 = make_cylinder(3.0, 10.0, 500); + auto c2 = make_cylinder(2.0, 8.0, 300); + + EXPECT_NO_THROW({ + auto u = brep_union(c1, c2); + EXPECT_TRUE(u.is_valid()); + auto d = brep_difference(c1, c2); + EXPECT_TRUE(d.is_valid()); + }); +} + +// ═══════════════════════════════════════════════ +// 大面数模型修复 +// ═══════════════════════════════════════════════ + +TEST(RegressionLargeModel, Heal_LargeModel) { + auto sphere = make_sphere(10.0, 30, 24); + EXPECT_GE(sphere.num_faces(), 1000u); + + EXPECT_NO_THROW({ + // 修复大面数模型 + heal_gaps(sphere, 1e-6); + heal_slivers(sphere); + bool ok = heal_topology(sphere, 1e-4); + (void)ok; + }); +} + +// ═══════════════════════════════════════════════ +// 多体布尔链式操作（压力测试） +// ═══════════════════════════════════════════════ + +TEST(RegressionLargeModel, Stress_ChainedBooleans) { + auto box = make_box(10.0, 10.0, 10.0); + auto cyl = make_cylinder(0.5, 15.0, 128); + + // 连续执行多次布尔运算，最终模型可能包含大量面 + EXPECT_NO_THROW({ + auto u = brep_union(box, cyl); + for (int i = 0; i < 3; ++i) { + auto d = brep_difference(u, make_sphere(0.3 + i * 0.1, 16, 8)); + u = d; // chain + } + EXPECT_TRUE(u.is_valid()); + + auto result = validate(u); + (void)result; + + auto mesh = u.to_mesh(0.05); + (void)mesh; + }); +} + +// ═══════════════════════════════════════════════ +// 大面数模型导出 +// ═══════════════════════════════════════════════ + +TEST(RegressionLargeModel, Export_LargeMesh) { + auto sphere = make_sphere(10.0, 40, 32); // ~2560 faces + EXPECT_GE(sphere.num_faces(), 2000u); + + EXPECT_NO_THROW({ + // 导出为精细网格 + auto mesh = sphere.to_mesh(0.001); + (void)mesh.num_vertices(); + (void)mesh.num_faces(); + }); +} diff --git a/tests/regression/regression_thin_wall.cpp b/tests/regression/regression_thin_wall.cpp new file mode 100644 index 0000000..208b285 --- /dev/null +++ b/tests/regression/regression_thin_wall.cpp @@ -0,0 +1,187 @@ +/// @file regression_thin_wall.cpp +/// @brief 薄壁件回归测试（壁厚 0.001mm） +/// +/// 覆盖场景： +/// 1. 极薄壁盒子 +/// 2. 薄壁壳的布尔运算 +/// 3. 薄壁圆柱和球体 +/// 4. 抽壳后的薄壁验证 +/// +/// 每个测试：构造薄壁体 → 布尔/修复/验证 → 断言不崩溃 + +#include +#include "vde/brep/brep.h" +#include "vde/brep/modeling.h" +#include "vde/brep/brep_boolean.h" +#include "vde/brep/brep_validate.h" +#include "vde/brep/brep_heal.h" +#include "vde/core/point.h" +#include + +using namespace vde::brep; +using namespace vde::core; + +// 行业标准薄壁厚度：0.001mm = 1e-6 米（假设模型单位为米） +static constexpr double THIN_WALL = 1e-6; + +// ── 极薄壁盒子测试 ── + +TEST(RegressionThinWall, Box_ThinWall1um) { + // 1 μm 壁厚的盒子 + EXPECT_NO_THROW({ + auto body = make_box(THIN_WALL, 1.0, 1.0); + EXPECT_TRUE(body.is_valid()); + + // 验证 + auto result = validate(body); + (void)result; + + // 导出网格不应崩溃 + auto mesh = body.to_mesh(); + (void)mesh; + }); +} + +TEST(RegressionThinWall, Box_ThinWallVarious) { + // 多种薄壁厚度 + for (double t : {1e-3, 1e-4, 1e-5, 1e-6, 1e-7}) { + EXPECT_NO_THROW({ + auto body = make_box(t, 1.0, 1.0); + body.is_valid(); + auto mesh = body.to_mesh(); + (void)mesh; + }) << "failed at thickness=" << t; + } +} + +TEST(RegressionThinWall, Box_AllDimensionsThin) { + // 三个维度都极薄 → 几乎是一个点 + EXPECT_NO_THROW({ + auto body = make_box(THIN_WALL, THIN_WALL, THIN_WALL); + body.is_valid(); + auto mesh = body.to_mesh(); + (void)mesh; + }); +} + +// ── 薄壁布尔运算 ── + +TEST(RegressionThinWall, Boolean_ThinWallUnion) { + auto thin = make_box(THIN_WALL, 1.0, 1.0); + auto normal = make_box(2.0, 2.0, 2.0); + + EXPECT_NO_THROW({ + auto u = brep_union(thin, normal); + EXPECT_TRUE(u.is_valid()); + auto i = brep_intersection(thin, normal); + EXPECT_TRUE(i.is_valid()); + auto d = brep_difference(normal, thin); + EXPECT_TRUE(d.is_valid()); + }); +} + +TEST(RegressionThinWall, Boolean_TwoThinWalls) { + // 两个薄壁体之间的布尔运算 + auto a = make_box(THIN_WALL, 2.0, 2.0); + auto b = make_box(2.0, THIN_WALL, 2.0); + + EXPECT_NO_THROW({ + auto u = brep_union(a, b); + EXPECT_TRUE(u.is_valid()); + auto i = brep_intersection(a, b); + EXPECT_TRUE(i.is_valid()); + }); +} + +// ── 薄壁圆柱 ── + +TEST(RegressionThinWall, Cylinder_ThinRadius) { + // 极薄半径的圆柱（近似线） + for (double r : {1e-3, 1e-4, 1e-5, 1e-6}) { + EXPECT_NO_THROW({ + auto cyl = make_cylinder(r, 2.0, 16); + EXPECT_TRUE(cyl.is_valid()); + auto mesh = cyl.to_mesh(); + (void)mesh; + }) << "failed at radius=" << r; + } +} + +TEST(RegressionThinWall, Cylinder_ThinHeight) { + // 极薄高度的圆柱（近似圆盘） + for (double h : {1e-3, 1e-4, 1e-5, 1e-6}) { + EXPECT_NO_THROW({ + auto cyl = make_cylinder(1.0, h, 16); + EXPECT_TRUE(cyl.is_valid()); + auto mesh = cyl.to_mesh(); + (void)mesh; + }) << "failed at height=" << h; + } +} + +// ── 薄壁球体 ── + +TEST(RegressionThinWall, Sphere_ThinRadius) { + for (double r : {1e-3, 1e-4, 1e-5, 1e-6}) { + EXPECT_NO_THROW({ + auto sph = make_sphere(r, 16, 8); + EXPECT_TRUE(sph.is_valid()); + auto mesh = sph.to_mesh(); + (void)mesh; + }) << "failed at radius=" << r; + } +} + +// ── 抽壳后的薄壁体 ── + +TEST(RegressionThinWall, Shell_ThinThickness) { + // shell() 生成一个挖空的体 → 然后对其做薄壁操作 + auto box = make_box(10.0, 10.0, 10.0); + + EXPECT_NO_THROW({ + auto shelled = shell(box, 0, THIN_WALL); + EXPECT_TRUE(shelled.is_valid()); + + auto result = validate(shelled); + (void)result; + + // 壳上的布尔运算 + auto cyl = make_cylinder(1.0, 20.0, 32); + auto u = brep_union(shelled, cyl); + (void)u.is_valid(); + }); +} + +// ── 薄壁修复 ── + +TEST(RegressionThinWall, Heal_ThinWall) { + auto thin = make_box(THIN_WALL, 1.0, 1.0); + + EXPECT_NO_THROW({ + // 使用容差修复（容差远大于壁厚的情况） + heal_gaps(thin, 1e-6); + heal_slivers(thin); + + bool ok = heal_topology(thin, 1e-4); + (void)ok; + + auto result = validate(thin); + (void)result; + }); +} + +// ── 压力测试：薄壁链式布尔 ── + +TEST(RegressionThinWall, Stress_ChainedBoolean) { + auto base = make_box(5.0, 5.0, 5.0); + + // 连续对薄壁体做布尔运算 + for (int i = 0; i < 5; ++i) { + double t = THIN_WALL * (i + 1) * 10; + EXPECT_NO_THROW({ + auto thin = make_box(t, 0.5, 0.5); + auto u = brep_union(base, thin); + (void)u.is_valid(); + }) << "failed at iteration " << i; + } +}