Ordered Statistics Vertex Extraction and Tracing Algorithm (OSVETA)
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 triang...
Main Author: | VASIC, B. |
---|---|
Format: | Article |
Language: | English |
Published: |
Stefan cel Mare University of Suceava
2012-11-01
|
Series: | Advances in Electrical and Computer Engineering |
Subjects: | |
Online Access: | http://dx.doi.org/10.4316/AECE.2012.04004 |
Similar Items
-
Iterated Clique Reductions in Vertex Weighted Coloring for Large Sparse Graphs
by: Yi Fan, et al.
Published: (2023-09-01) -
The Referenced Vertex Ordering Problem: Theory, Applications, and Solution Methods
by: Omer, Jérémy, et al.
Published: (2021-08-01) -
A Deviation-Based Dynamic Vertex Reordering Technique for 2D Mesh Quality Improvement
by: Junhyeok Choi, et al.
Published: (2019-07-01) -
On the roots and stability of Vertex connectivity polynomial of graphs
by: Priya Krishnan, et al.
Published: (2022-06-01) -
On group vertex magic graphs
by: N. Kamatchi, et al.
Published: (2020-01-01)