ENH: Use one fast exact duplicate-vertex finder in all duplicate-vertex code
维护者通常 6 天内回复
还没有人认领这个 Issue。
评估
- 难度
- 5/5
- 预计耗时
- 一周以上
- 新手友好度
- 35/100
- Issue 类型
- 功能
- 描述清晰度
- 基本清楚
- 活跃度
- 活跃
- 技术栈
- cpp
- 领域
- backend, data, performance
调研方向
Start by reading GeometryUtilities::EliminateDuplicateNodes in src/simplnx/Utilities/GeometryUtilities.cpp and MeshingUtilities::OrderSharedVertices / HasDuplicateVertices in src/simplnx/Utilities/Meshing/VertexUtilities.cpp, along with issue #1908 item L19. The issue leaves the algorithm and memory budget open, so first compare the existing paths against the exact-equality, parallel, cancellable, out-of-core requirements. Done means one shared finder is used by all listed filters and keeps the first vertex in each duplicate group.
由索引模型根据 Issue 内容生成。
描述
Summary
Request: one shared, fast duplicate-vertex finder that every filter which looks for duplicate vertices uses. It should find vertices whose X, Y and Z coordinates are exactly equal, run in parallel, scale with the number of vertices, and work with out-of-core (OOC) data.
Why it is needed
simplnx has two separate duplicate-vertex finders. They have different weaknesses:
GeometryUtilities::EliminateDuplicateNodes(GeometryUtilities.hpp:119, FindUniqueIdsImpl) puts each vertex into a spatial bin and compares, in parallel, every pair of vertices inside each bin with exact==. It is fast for typical STL files, but:- The grid always has 100 × 100 × 100 bins, whatever the number of vertices. The comparison inside a bin is O(k²). A flat mesh uses only one layer of 100 × 100 bins, and dense lattice meshes (surface meshes made from voxel data) put many vertices into each bin.
- The bins (one
std::vectorper bin, about 24 MB when empty) and theInt64DataStoreof unique IDs are always in memory, so the memory use is about 16 bytes or more per vertex, with no OOC path. - A NaN coordinate makes the bin index cast undefined behavior, and an infinite coordinate breaks the bounding box. Neither case is checked.
MeshingUtilities::OrderSharedVertices/HasDuplicateVertices(VertexUtilities.cpp) sort the vertex indices and compare neighbors. Issue #1908 item L19 (same defect as #1783) changes this code to exact equality with a sort on (x, y, z, input index). That sort is O(N log N), single threaded, and reads each coordinate through the DataStore's virtual accessor. With an OOC store, these reads come in random order through the chunk cache, because the sort compares vertices in random order.
Filters affected
- Through
EliminateDuplicateNodes: Read STL File, Combine STL Files (it runs Read STL File for each file), Slice Triangle Geometry and Extract Feature Boundaries 2D. - Through
OrderSharedVertices/HasDuplicateVertices: Identify Duplicate Vertices and Verify Triangle Winding.
Expected behavior (the rule chosen for L19)
- Two vertices are duplicates only when X, Y and Z are exactly equal (
==, so -0.0 equals +0.0). A vertex with a NaN coordinate is never a duplicate. - In each group of equal vertices, the first vertex in input order is kept.
- The run can be cancelled.
Measurements (from the L19 review, macOS ARM64, in memory, one thread, about 4 million vertices on a 200³ lattice in random order, no duplicates): the old one-axis sort took 0.42 s (but it misses duplicates), and the L19 sort takes 1.30 s. A scan that compares all vertices with the same primary coordinate took about 117 s.
Still open: the algorithm (hash on the exact coordinate bits, bins sized from the vertex count, or a sort that runs on chunks and then merges them for OOC data) and the memory budget that is allowed.
- 主要语言
- C++
- 星标
- 18
- 派生
- 15
- 平均合并
- 4 天 23 小时
- 30 天内合并 PR
- 42
环境准备
- 没有 Dockerfile 或 Docker Compose 文件
- 有 Pull Request 模板
- 阅读贡献指南
从这里开始
- 先读完整个 Issue,再读项目的贡献指南。
- 在 Issue 下留言说明你要接手 —— 这能避免两个人做同样的事。
- Fork 仓库,在一个分支上完成修改。
- 提交 Pull Request,并在描述里引用这个 Issue 编号。
BlueQuartzSoftware/simplnx 的其他 Issue
-
bug
难度 2/5 1-3 小时 新手友好度 78/100
BlueQuartzSoftware/simplnx#1987 ·
维护者通常 6 天内回复
-
documentation
难度 2/5 1-3 小时 新手友好度 74/100
BlueQuartzSoftware/simplnx#1980 ·
维护者通常 6 天内回复
-
Testing
难度 2/5 1-3 小时 新手友好度 62/100
BlueQuartzSoftware/simplnx#1979 ·
维护者通常 6 天内回复
-
documentation
难度 2/5 1-3 小时 新手友好度 65/100
BlueQuartzSoftware/simplnx#1978 ·
维护者通常 6 天内回复
-
难度 2/5 1-3 小时 新手友好度 82/100
BlueQuartzSoftware/simplnx#1945 ·
维护者通常 6 天内回复
查看 BlueQuartzSoftware/simplnx 的全部 Issue
相似的 Issue
-
bug triage
难度 2/5 1-3 小时 新手友好度 75/100
维护者通常 1 天内回复
-
26.04 bug dark-mode Easy Hack impress symptom: visual
难度 2/5 1-3 小时 新手友好度 68/100
CollaboraOnline/online#16421 · 1 条评论 ·
-
area/cs bug
难度 2/5 1-3 小时 新手友好度 82/100
ydb-platform/ydb#59881 · 1 条评论 ·
维护者通常 1 天内回复
-
难度 2/5 1-3 小时 新手友好度 64/100
维护者通常 1 天内回复
-
documentation enhancement lua server
难度 2/5 1-3 小时 新手友好度 66/100