Click to open the HelpDesk interface
AECE - Front page banner

Menu:


FACTS & FIGURES

JCR Impact Factor: 0.650
JCR 5-Year IF: 0.639
Issues per year: 4
Current issue: Nov 2019
Next issue: Feb 2020
Avg review time: 72 days


PUBLISHER

Stefan cel Mare
University of Suceava
Faculty of Electrical Engineering and
Computer Science
13, Universitatii Street
Suceava - 720229
ROMANIA

Print ISSN: 1582-7445
Online ISSN: 1844-7600
WorldCat: 643243560
doi: 10.4316/AECE


TRAFFIC STATS

2,449,614 unique visits
634,140 downloads
Since November 1, 2009



No robots online now


SJR SCImago RANK

SCImago Journal & Country Rank




TEXT LINKS

Anycast DNS Hosting
MOST RECENT ISSUES

 Volume 19 (2019)
 
     »   Issue 4 / 2019
 
     »   Issue 3 / 2019
 
     »   Issue 2 / 2019
 
     »   Issue 1 / 2019
 
 
 Volume 18 (2018)
 
     »   Issue 4 / 2018
 
     »   Issue 3 / 2018
 
     »   Issue 2 / 2018
 
     »   Issue 1 / 2018
 
 
 Volume 17 (2017)
 
     »   Issue 4 / 2017
 
     »   Issue 3 / 2017
 
     »   Issue 2 / 2017
 
     »   Issue 1 / 2017
 
 
 Volume 16 (2016)
 
     »   Issue 4 / 2016
 
     »   Issue 3 / 2016
 
     »   Issue 2 / 2016
 
     »   Issue 1 / 2016
 
 
  View all issues  








LATEST NEWS

2019-Dec-16
Starting on the 15th of December 2019 all paper authors are required to enter their SCOPUS IDs. You may use the free SCOPUS ID lookup form to find yours in case you don't remember it.

2019-Jun-20
Clarivate Analytics published the InCites Journal Citations Report for 2018. The JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.650, and the JCR 5-Year Impact Factor is 0.639.

2018-May-31
Starting today, the minimum number a pages for a paper is 8, so all submitted papers should have 8, 10 or 12 pages. No exceptions will be accepted.

2018-Jun-27
Clarivate Analytics published the InCites Journal Citations Report for 2017. The JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.699, and the JCR 5-Year Impact Factor is 0.674.

Read More »


    
 

  4/2012 - 4

Ordered Statistics Vertex Extraction and Tracing Algorithm (OSVETA)

VASIC, B. See more information about VASIC, B. on SCOPUS See more information about VASIC, B. on IEEExplore See more information about VASIC, B. on Web of Science
 
Click to see author's profile in See more information about the author on SCOPUS SCOPUS, See more information about the author on IEEE Xplore IEEE Xplore, See more information about the author on Web of Science Web of Science

Download PDF pdficon (1,170 KB) | Citation | Downloads: 375 | Views: 2,944

Author keywords
3D shape, curvature estimation, discrete geometry, mesh optimization, vertex extraction

References keywords
graphics(10), simplification(6), siggraph(6), techniques(5), interactive(5), geometry(5), surfaces(4), surface(4), polygonal(4), mesh(4)
No common words between the references section and the paper title.

About this article
Date of Publication: 2012-11-30
Volume 12, Issue 4, Year 2012, On page(s): 25 - 32
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2012.04004
Web of Science Accession Number: 000312128400004
SCOPUS ID: 84872815537

Abstract
Quick view
Full text preview
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.


References | Cited By  «-- Click to see who has cited this paper

[1] F. Attneave, "Some informational aspects of visual perception", Psychological review, vol. 61, no 3, pp. 183 - 193, 1954. [CiteSeerX]

[2] F. Attneave and M. D. Arnoult, "The quantitative study of shape and pattern perception," Psychological bulletin, vol. 53, no 6, pp. 452 - 471, 1956, [CiteSeerX]

[3] P. Dombrowski, 150 years after Gauss' "Disquisitiones generales circa superficies curvas": with the original text of Gauss, no 62, Societe mathematique de France, 1979.

[4] A. D. Aleksandrov and V. A. Zalgaller, Intrinsic geometry of surfaces, vol. 15, of Translations of Mathematical Monographs, American Mathematical Society, 1967.

[5] J. J. Koenderink. Solid Shape, The MIT Press, Cambridge, Massachusetts, May 1990.

[6] J. P. Thirion, "The extremal mesh and understanding of 3D surfaces," International Jurnal of Computer Vision, vol. 19, no 2, pp. 115 - 128, August 1996.
[CrossRef] [Web of Science Times Cited 45] [SCOPUS Times Cited 53]


[7] M. Spivak. A comprehensive introduction to differential geometry, vol. 1, ED-3, Publish or Perish, January 1999.

[8] M. Meyer, M. Desbrun, P. Schröder, and A.H. Barr, "Discrete differential-geometry operators for triangulated 2-manifolds," Visualization and Mathematics III, ED-12, pp. 35 - 57, Springer, August 2003. [CiteSeerX]

[9] A. M. McIvor and R. J. Valkenburg, "A comparison of local surface geometry estimation methods," Machine Vision and Applications, vol. 10, no 1, pp. 17 - 26, May 1997. [CiteSeerX]

[10] S. Petitjean, "A Survey of methods for recovering quadrics in triangle meshes," ACM Computing Surveys, vol. 34, no 2, pp. 211 - 262, June 2002.
[CrossRef] [Web of Science Times Cited 112] [SCOPUS Times Cited 178]


[11] D. Cohen-Steiner and J. M. Morvan. "Restricted Delaunay triangulations and normal cycle.", in Proc. 19th Ann. Symp. Computational geometry - SCG '03, San Diego, June 2003, pp. 312 - 321.
[CrossRef]


[12] P. Alliez, D. Cohen-Steiner, O. Devillers, B. Levy, and M. Desbrun, "Anisotropic polygonal remeshing," ACM Transactions on Graphics, vol. 22, no 3, pp. 485 - 493, July 2003.
[CrossRef] [SCOPUS Times Cited 294]


[13] R. V. Garimella and B. K. Swartz, "Curvature Estimation for Unstructured Triangulations of Surfaces," Technical Report LA-UR-03-8240, Los Alamos National Laboratory, Los Alamos, New Mexico, USA, 2003.

[14] K. Watanabe and A. G. Belyaev, "Detection of Salient Curvature Features on Polygonal Surfaces," in Proc. Computer Graphics Forum - EUROGRAPHICS 2001, Manchester, September 2001, vol. 20, no 3, pp. 385 - 392.
[CrossRef]


[15] C. H. Lee, A. Varshney, and D. W. Jacobs, "Mesh saliency," ACM Transactions on Graphics, vol. 24, no 3, pp. 659-666, July 2005. [CiteSeerX]

[16] H. Hoppe, T. DeRose, T. Duchamp, J. McDonald, and W. Stuetzle, "Mesh optimization," in Proc. 20th Annu. Conf. Computer graphics and interactive techniques - SIGGRAPH '93, Anaheim, August 1993, pp. 19-26. [CiteSeerX]

[17] H. Hoppe, "Progressive meshes," in Proc. 23rd Annu. Conf. Computer graphics and interactive techniques - SIGGRAPH '96, New Orleans, August 1996, pp. 99-108. [CiteSeerX]

[18] J. Cohen, A. Varshney, D. Manocha, G. Turk, H. Weber, P. Agarwal, F. Brooks, and W. Wright, "Simplification envelopes," in Proc. 23rd Annu. Conf. Computer graphics and interactive techniques - SIGGRAPH '96, New Orleans, August 1996, pp. 119 - 128.
[CrossRef] [SCOPUS Times Cited 5]


[19] M. Garland and P.S. Heckbert, "Surface simplification using Quadric Error Metrics," in Proc. 24th Annu. Conf. Computer graphics and interactive techniques - SIGGRAPH '97, Los Angeles, August 1997, pp. 209 - 216. [CiteSeerX]

[20] P. Lindstrom and G. Turk, "Fast and memory efficient polygonal simplification," in Proc. Visualization '98, Research Triangle Park, October 1998, IEEE Computer Soc. Press, pages 279 - 286.
[CrossRef] [Web of Science Times Cited 109]


[21] M. Garland and Y. Zhou, "Quadric-based simplification in any dimension," ACM Transactions on Graphics, vol. 24, no 2, pp. 209 - 239, April 2005. [CiteSeerX]

[22] P. Heckbert and M. Garland, "Survey of polygonal surface simplification algorithms," Multiresolution Surface Modeling Course - SIGGRAPH ’97, Los Angeles, August 1997. [CiteSeerX]

[23] P. Cignonia, C. Montania, and R. Scopignob, "A comparison of mesh simplification algorithms," Computers & Graphics, vol. 22, no 1, pp. 37 - 54, February 1998. [CiteSeerX]

[24] W. J. Schroeder, J. A. Zarge, and W. E. Lorensen, "Decimation of triangle meshes," in Proc. 19th Annu. Conf. Computer graphics and interactive techniques - SIGGRAPH '92, Chicago, July 1992, pp. 65 - 70. [CiteSeerX]

[25] D. Zorin, "Curvature-based energy for simulation and variational modeling," in Proc. International IEEE Conf. on Shape Modeling and Applications - SMI '05, Cambridge, June 2005, pp. 196 - 204.
[CrossRef] [Web of Science Times Cited 7] [SCOPUS Times Cited 14]


[26] Serbian Film Center, Naissa Trophy, [Online] Available: Temporary on-line reference link removed - see the PDF document

[27] Autodesk free 3D models, Autodesk 123C, [Online] Available: Temporary on-line reference link removed - see the PDF document

[28] B. Vasic, Ordered Statistic Vertex Extraction and Tracing Algorithm (OSVETA) - MatLab Software, [Online] Available: Temporary on-line reference link removed - see the PDF document

[29] M. Kauffman, "Optimizing Your Autodesk 3ds Max Design Models for Project Newport", Autodesk University 2009, [Online] Available: Temporary on-line reference link removed - see the PDF document



References Weight

Web of Science® Citations for all references: 273 TCR
SCOPUS® Citations for all references: 544 TCR

Web of Science® Average Citations per reference: 9 ACR
SCOPUS® Average Citations per reference: 18 ACR

TCR = Total Citations for References / ACR = Average Citations per Reference

We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more

Citations for references updated on 2020-01-17 14:35 in 63 seconds.




Note1: Web of Science® is a registered trademark of Clarivate Analytics.
Note2: SCOPUS® is a registered trademark of Elsevier B.V.
Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site.

Copyright ©2001-2020
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania


All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.

Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.

Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.




Website loading speed and performance optimization powered by: