Ordered Statistics Vertex Extraction and Tracing Algorithm (OSVETA)
Bata Vasic

TL;DR
OSVETA is a novel algorithm that identifies and ranks the most important vertices in 3D meshes based on local curvature and topological features, aiding applications like watermarking and mesh optimization.
Contribution
The paper introduces OSVETA, a new method for extracting and ranking critical vertices in 3D meshes using curvature and topology analysis.
Findings
Effective identification of key vertices based on curvature.
Accurate ranking of vertices by importance.
Potential applications in watermarking and mesh optimization.
Abstract
We propose an algorithm for identifying vertices from three dimensional (3D) meshes that are most important for a geometric shape creation. Extracting such a set of vertices from a 3D mesh is important in applications such as digital watermarking, but also as a component of optimization and triangulation. In the first step, the Ordered Statistics Vertex Extraction and Tracing Algorithm (OSVETA) estimates precisely the local curvature, and most important topological features of mesh geometry. Using the vertex geometric importance ranking, the algorithm traces and extracts a vector of vertices, ordered by decreasing index of importance.
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.
