<scp>PIMesh</scp>: An automatic point cloud and unstructured mesh generation algorithm for meshless methods and finite element analysis–with applications in surgical simulations
Bibliographic record
Abstract
We propose a point cloud and mesh generation algorithm, particle injection mesh generator (PIMesh), that can be used to generate optimized high-quality point clouds and unstructured meshes for domains in any shape with minimum (or even no) user intervention. The domains can be scanned images in OBJ format in 2D and 3D or just a line drawing in 2D. Mesh grading can also be easily controlled. The PIMesh is robust and easy to be implemented and is useful for a variety of applications, ranging from generating point clouds for meshless methods, mesh generation for finite element methods, computer graphics applications and surgical simulators. The core idea of the PIMesh is that a mesh domain is considered as an "airtight container" into which particles are "injected" at one or multiple selected interior points. The motion of the particles is controlled by a pseudo-molecular dynamics (PMD) formulation with a pairwise purely repelling "force" moderated by an absolute velocity dependent drag force. The particles repel each other and occupy the whole domain somewhat like blowing up a balloon. When the container is full of particles and the motion is stopped (the particles can be considered as a point cloud), a Delaunay triangulation algorithm is employed to link the particles together to generate an unstructured mesh. The performance of the PIMesh and the comparison with other unstructured mesh generation approaches are demonstrated through generating node distributions and meshes for several 2D and 3D object domains including a scanned image of bones and others.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.019 | 0.008 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".