A bipartite graph approach to retrieve similar 3D models with different resolution and types of cardiomyopathies

2022 ◽  
pp. 116422
Author(s):  
Leila Cristina C. Bergamasco ◽  
Karla R.P.S. Lima ◽  
Carlos E. Rochitte ◽  
Fátima L.S. Nunes
Keyword(s):  
2017 ◽  
Vol 34 (1) ◽  
pp. 174-188 ◽  
Author(s):  
Jihua Wang ◽  
Huayu Wang

Purpose This study aims to compute 3D model similarity by extracting and comparing shape features from the neutral files. Design/methodology/approach In this work, the clear text encoding document STEP (Standard for The Exchange of Product model data) of 3D models was analysed, and the models were characterized by two-depth trees consisting of both surface and shell nodes. All surfaces in the STEP files can be subdivided into three kinds, namely, free, analytical and loop surfaces. Surface similarity is defined by the variation coefficients of distances between data points on two surfaces, and subsequently, the shell similarity and 3D model similarity are determined using an optimal algorithm for bipartite graph matching. Findings This approach is used to experimentally verify the effectiveness of the 3D model similarity algorithm. Originality/value The novelty of this study research lies in the computation of 3D model similarity by comparison of all surfaces. In addition, the study makes several key observations: surfaces reflect the most information concerning the functions and attributes of a 3D model and so the similarity between surfaces generates more comprehensive content (both external and internal); semantic-based 3D retrieval can be obtained under the premise of comparison of surface semantics; and more accurate similarity of 3D models can be obtained using the optimal algorithm of bipartite graph matching for all surfaces.


2020 ◽  
pp. 11-15
Author(s):  
A. A. Zubrilin ◽  
M. N. Makarov

The historical perspective provides an overview of how to study flowcharts in a school informatics course. Computer applications and Internet services are considered that automate the development of flowcharts. It is shown how 3D technologies can help an informatics teacher in preparing 3D models for the study of flowcharts.


2018 ◽  
Vol 9 (12) ◽  
pp. 2147-2152
Author(s):  
V. Raju ◽  
M. Paruvatha vathana

2018 ◽  
Vol 23 (6) ◽  
pp. 99-113
Author(s):  
Sha LIU ◽  
Feng YANG ◽  
Shunxi WANG ◽  
Yu CHEN

10.37236/1748 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
Nagi H. Nahas

The best lower bound known on the crossing number of the complete bipartite graph is : $$cr(K_{m,n}) \geq (1/5)(m)(m-1)\lfloor n/2 \rfloor \lfloor(n-1)/2\rfloor$$ In this paper we prove that: $$cr(K_{m,n}) \geq (1/5)m(m-1)\lfloor n/2 \rfloor \lfloor (n-1)/2 \rfloor + 9.9 \times 10^{-6} m^2n^2$$ for sufficiently large $m$ and $n$.


2002 ◽  
Author(s):  
Michael H. Ritzwoller ◽  
Nikolai M. Shapiro ◽  
Anatoli L. Levshin ◽  
Eric A. Bergman ◽  
Eric R. Engdahl
Keyword(s):  

2014 ◽  
Vol 1 (2) ◽  
pp. 85-5 ◽  
Author(s):  
Njainday Jobe ◽  
Daniel Rosel ◽  
Ondrej Tolde ◽  
Jan Kosla ◽  
Jan Brabek
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document