35 lines
1.2 KiB
C++
35 lines
1.2 KiB
C++
// 探针:顶点 3 条边圆角后是否水密(H1 角点汇聚缺口验证)
|
|
#include "vde/brep/modeling.h"
|
|
#include "vde/brep/advanced_blend.h"
|
|
#include "vde/brep/brep.h"
|
|
#include <cstdio>
|
|
using namespace vde::brep;
|
|
|
|
static void report(const char* tag, const BrepModel& m) {
|
|
int free_edges = 0, multi = 0;
|
|
for (int i = 0; i < m.num_edges(); ++i) {
|
|
int nf = static_cast<int>(m.edge_faces(i).size());
|
|
if (nf == 1) ++free_edges;
|
|
if (nf > 2) ++multi;
|
|
}
|
|
printf("%s: faces=%zu edges=%d verts=%d free=%d multi=%d is_valid=%d\n",
|
|
tag, m.num_faces(), m.num_edges(), m.num_vertices(),
|
|
free_edges, multi, m.is_valid() ? 1 : 0);
|
|
}
|
|
|
|
int main() {
|
|
auto box = make_box(10, 10, 10);
|
|
report("box", box);
|
|
// 汇聚于顶点 (5,5,5) 的三条边:x=5 顶面两条 + 一条侧棱
|
|
// 用 fillet_edges 依次圆角
|
|
auto r = fillet_edges(box, {0, 1, 2}, {1.0, 1.0, 1.0});
|
|
report("fillet3(edges0-2)", r);
|
|
// B-Rep 级 brep_fillet 单条边
|
|
auto bf = brep_fillet(box, 0, 1.0);
|
|
report("brep_fillet(e0)", bf);
|
|
// fillet_edges 4 条顶边成环
|
|
auto ring = fillet_edges(box, {0, 1, 2, 3}, {1.0, 1.0, 1.0, 1.0});
|
|
report("fillet4(ring)", ring);
|
|
return 0;
|
|
}
|