An efficient algorithm to find a set of nearest elements in a mesh
Gleb Novichkov
TL;DR
This paper presents a linear time algorithm designed to efficiently identify a set of nearest elements within a mesh, significantly improving computational performance for mesh analysis.
Contribution
The paper introduces a novel linear time algorithm for finding nearest elements in a mesh, enhancing efficiency over previous methods.
Findings
Algorithm operates in linear time
Effective for large meshes
Outperforms existing approaches
Abstract
A linear time algorithm to find a set of nearest elements in a mesh.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Optimization and Search Problems · Advanced Graph Theory Research