Showing posts with label triangulation. Show all posts
Showing posts with label triangulation. Show all posts

Friday, 9 February 2024

Integrating Intraoral Scanners in Dental Practice | Chapter 12 | Advancement and New Understanding in Medical Science Vol. 4

Conventional impression techniques have been used to register the three-dimensional geometry of the oral hard and soft tissues, since the inception of the era of dentistry. Despite the advancements in impression materials over the years, volumetric changes of impression materials and expansion of dental stone seem to be highly error-prone, and thus the process requires the services of an excellent dental laboratory. To overcome these difficulties associated with traditional techniques, impressions with intraoral scanner (IOS) and computer-aided design and manufacturing (CAD/CAM) technologies were developed for dental practice. Recently, there has been a surge in the number of optical IOS devices, and each of these are based on different technologies; the choice of which may have an impact on clinical use. This article throws light on the different technologies currently used for distance object determination, and the basic clinical considerations such as operator handling, steepness of learning curve, and the recommended scanning paths.


Author(s) Details:

Shweta Poovani,
Department of Prosthodontics, Raja Rajeswari Dental College and Hospital, Bangalore 74, India.

Rashmi C. V.,
Department of Prosthodontics, Raja Rajeswari Dental College and Hospital, Bangalore 74, India.

Please see the link here: https://stm.bookpi.org/ANUMS-V4/article/view/13217

Sunday, 15 January 2023

Process Evaluation of Secondary Prevention by Structured Semi-Interactive Stroke Prevention Package in India| Chapter 10 | Perspective of Recent Advances in Medical Research Vol. 2

 Smoking is individual of the major causes of mortality general with any of 8 million reported dying each year. Smokers are more prone to zealous and bacterial respiratory contaminations like chronic obstructive pulmonary ailment (COPD) resulting in acute respiring failure and stated to have higher mortality rates in the former outbreak of Middle East Respiratory Syndrome Coronavirus (MERS-CoV). Smoking was found to have a statistically important relationship accompanying the severity of severe severe respiratory syndrome-coronavirus-2 (SARS-CoV-2) effects among sufferers, including ICU admission, smokestack for building use, and higher mortality rates. The larger expression of the angiotensin-changing enzyme-2 (ACE2) receptor, a novel site of SARS-CoV-2 adhesiveness that causes COVID-19 infection in humans, with smokers further supported this link and established them in the zone of exposure for SARS-CoV-2 infection.

Author(s) Details:

Shweta Jain Verma,
Department of Neurology, Christian Medical College, Ludhiana, Punjab, India.

Puja Gulati,
School of Pharmacy, Desh Bhagat University, Mandi Gobindgarh, Punjab, India.

Himani Khatter,
Department of Neurology, Christian Medical College, Ludhiana, Punjab, India.

Deepti Arora,
Department of Neurology, Christian Medical College, Ludhiana, Punjab, India.s

Aneesh Dhasan,
Department of Neurology, Sree Chitra Tirunal Institute for Medical Sciences and Technology, Thiruvananthapuram, Kerala, India.

Meenakshi Sharma,
Non-Communicable Diseases Section, Indian Council of Medical Research, New Delhi, India.

P. N. Sylaja,
Department of Neurology, Sree Chitra Tirunal Institute for Medical Sciences and Technology, Thiruvananthapuram, Kerala, India.

Jeyaraj Durai Pandian,
Department of Neurology, Christian Medical College, Ludhiana, Punjab, India.

Please see the link here: https://stm.bookpi.org/PRAMR-V2/article/view/9018

Tuesday, 11 October 2022

Enumeration of Abstract Complexes of a Given Kind (Labeled vs. Unlabeled): A Mathematical Approach| Chapter 7 | Novel Research Aspects in Mathematical and Computer Science Vol. 8

 The utilisation of our enumeration polynomial P(x), a link between the labelled and unlabeled settings, is covered in the current chapter. Using the decomposition of the set of complexes into orbits, we demonstrate how to use the enumeration polynomial P(x) proposed for abstract (simplicial) complexes of a particular form, such as trees with a given number of vertices or torus triangulations with a specified network. Following a demonstration for trees, the enumeration polynomial P(x) is then applied to the triangulations of the torus with the vertex-labeled complete four-partite graph G = K2,2,2,2, where P(x) specifically equals x31. The triangulation T(G) of the graph G embeds it in the torus. In the current chapter we review the use of our enumeration polynomial P(x) which is a bridge between the labeled and unlabeled settings. We show how to apply the enumeration polynomial P(x) introduced for abstract (simplicial) complexes of a specific form, such as trees with a given number of vertices or torus triangulations with a specified network, using the decomposition of the set of complexes into orbits. The enumeration polynomial P(x) is demonstrated for trees and then is applied to the triangulations of the torus with the vertex-labeled complete four-partite graphG=K_2,2,2,2, in which specific case P(x)=x^31. The graph G embeds in the torus as a triangulation,T(G). The automorphism group of G naturally acts on the set of triangulations of the torus with the vertex-labeled graph G. There are twelve vertex-labeled triangulations of the torus with the graph G; they are classified intelligently, uniformly, and systematically without the use of computational technology. This is done by using algebraic and symmetry approaches. It is helpful to notice that the graph G can be converted to the Cayley graph of the quaternion group Q_8 with the three imaginary quaternions i,j,k as generators. The set of triangulations of the torus with the vertex-labeled graph G is naturally affected by the automorphism group of G. The torus with the graph G has twelve vertex-labeled triangulations, which are intelligently, uniformly, and systematically classified without the aid of computing technology. Using symmetry and algebraic methods, this is accomplished. It is useful to note that by using the three hypothetical quaternions I j, and k as generators, the graph G can be transformed into the Cayley graph of the quaternion group Q8.


Author(s) Details:

S. Lawrencenko,
Institute of Service Technologies, Russian State University of Tourism and Service, 99 Glavnaya Street, Cherkizovo, Pushkinsky District, Moscow Region, 141221, Russia.

A. M. Magomedov,
Department of Discrete Mathematics and Informatics, Dagestan State University, 43-A Gadjieva, Makhachkala, 367000, Russia.

Please see the link here: https://stm.bookpi.org/NRAMCS-V8/article/view/8361

Friday, 4 June 2021

Study on Obstacle Avoidance Method for Highly Redundant Robotic Arms| Chapter 6 | Advanced Aspects of Engineering Research Vol. 14

 When a robotic system is put in an area, obstacle avoidance is a key notion to consider. Obstacles in a robotic system's working space can hinder the robot from correctly accomplishing the duties assigned to it; as a result, the robotic system's designer must programme the robot to follow an emergency strategy that allows it to avoid any contact with a possible obstacle. anywhere within the robot's working space at any time This activity is significantly easier for mobile robots to complete since these robots have the freedom to vary their routes and pick less-obstructed alternatives. The scenario is even more complicated for fixed robotic manipulators because the only method to avoid an obstruction is to modify the spatial configuration of the robotic manipulator, which necessitates a sophisticated solution to the inverse kinematics problem of such a robot. Robotic systems that are redundant However, this is not a simple task. We focus solely on obstacle avoidance techniques in this paper, and we present a real-time obstacle avoidance method for fixed, highly redundant robotic manipulators that combines the benefits of both global and local techniques in that it can be used in both static and dynamic environments while requiring less computational effort.

Author (s) Details

Firas S. Hameed
The Iraqi Ministry of Science and Technology Baghdad, Iraq


View Book :  https://stm.bookpi.org/AAER-V14/article/view/1265