ENH: Use one fast exact duplicate-vertex finder in all duplicate-vertex code
I maintainer di solito rispondono entro 6 giorni
Nessuno ha ancora preso questa issue.
Valutazione
- Difficoltà
- 5/5
- Tempo stimato
- Più di una settimana
- Idoneità per principianti
- 35/100
- Tipo di issue
- Funzionalità
- Chiarezza
- Abbastanza chiara
- Stato di attività
- Attiva
- Stack tecnologico
- cpp
- Ambito
- backend, data, performance
Direzione di ricerca
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.
Scritto dal modello di indicizzazione a partire dal testo della issue.
Descrizione
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.
- Lingua principale
- C++
- Stelle
- 18
- Fork
- 15
- Merge medio
- 4g 23h
- PR unite (30g)
- 42
Preparare l'ambiente
- Nessun Dockerfile né file Docker Compose
- Ha un modello di pull request
- Leggi la guida per i contributori
Come iniziare
- Leggi tutta la issue e poi la guida ai contributi del progetto.
- Commenta sulla issue per dire che te ne occupi tu — evita che due persone facciano lo stesso lavoro.
- Fai un fork del repository e lavora su un branch.
- Apri una pull request che faccia riferimento al numero della issue.
Altre issue di BlueQuartzSoftware/simplnx
-
bug
Difficoltà 2/5 1-3 ore Idoneità per principianti 78/100
BlueQuartzSoftware/simplnx#1987 ·
I maintainer di solito rispondono entro 6 giorni
-
documentation
Difficoltà 2/5 1-3 ore Idoneità per principianti 74/100
BlueQuartzSoftware/simplnx#1980 ·
I maintainer di solito rispondono entro 6 giorni
-
Testing
Difficoltà 2/5 1-3 ore Idoneità per principianti 62/100
BlueQuartzSoftware/simplnx#1979 ·
I maintainer di solito rispondono entro 6 giorni
-
documentation
Difficoltà 2/5 1-3 ore Idoneità per principianti 65/100
BlueQuartzSoftware/simplnx#1978 ·
I maintainer di solito rispondono entro 6 giorni
-
Difficoltà 2/5 1-3 ore Idoneità per principianti 82/100
BlueQuartzSoftware/simplnx#1945 ·
I maintainer di solito rispondono entro 6 giorni
Tutte le issue di BlueQuartzSoftware/simplnx
Issue simili
-
bug triage
Difficoltà 2/5 1-3 ore Idoneità per principianti 75/100
I maintainer di solito rispondono entro 1 giorno
-
26.04 bug dark-mode Easy Hack impress symptom: visual
Difficoltà 2/5 1-3 ore Idoneità per principianti 68/100
CollaboraOnline/online#16421 · 1 commento ·
-
area/cs bug
Difficoltà 2/5 1-3 ore Idoneità per principianti 82/100
ydb-platform/ydb#59881 · 1 commento ·
I maintainer di solito rispondono entro 1 giorno
-
Difficoltà 2/5 1-3 ore Idoneità per principianti 64/100
I maintainer di solito rispondono entro 1 giorno
-
documentation enhancement lua server
Difficoltà 2/5 1-3 ore Idoneità per principianti 66/100