Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "triangulation" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 50
Tytuł:
Short cycles of low weight in normal plane maps with minimum degree 5
Autorzy:
Borodin, Oleg
Woodall, Douglas
Powiązania:
https://bibliotekanauki.pl/articles/744215.pdf
Data publikacji:
1998
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
planar graphs
plane triangulation
Opis:
In this note, precise upper bounds are determined for the minimum degree-sum of the vertices of a 4-cycle and a 5-cycle in a plane triangulation with minimum degree 5: w(C₄) ≤ 25 and w(C₅) ≤ 30. These hold because a normal plane map with minimum degree 5 must contain a 4-star with $w(K_{1,4}) ≤ 30$. These results answer a question posed by Kotzig in 1979 and recent questions of Jendrol' and Madaras.
Źródło:
Discussiones Mathematicae Graph Theory; 1998, 18, 2; 159-164
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Flippable Edges in Triangulations on Surfaces
Autorzy:
Ikegami, Daiki
Nakamoto, Atsuhiro
Powiązania:
https://bibliotekanauki.pl/articles/32222665.pdf
Data publikacji:
2022-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
triangulation
diagonal flip
surface
Opis:
Concerning diagonal flips on triangulations, Gao et al. showed that any triangulation G on the sphere with n ≥ 5 vertices has at least n − 2 flippable edges. Furthermore, if G has minimum degree at least 4 and n ≥ 9, then G has at least 2n + 3 flippable edges. In this paper, we give a simpler proof of their results, and extend them to the case of the projective plane, the torus and the Klein bottle. Finally, we give an estimation for the number of flippable edges of a triangulation on general surfaces, using the notion of irreducible triangulations.
Źródło:
Discussiones Mathematicae Graph Theory; 2022, 42, 4; 1041-1059
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
MyLib : Smart Library Indoor Navigation Using Bluetooth Low Energy with Triangulation Method
Autorzy:
Damayanti, Tri Nopiani
Ramadan, Dadan Nur
Utami, Indah Mutia
Powiązania:
https://bibliotekanauki.pl/articles/2055276.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Indoor Navigation
BLE
RSSI
Triangulation
Opis:
This paper proposes an android-based application to help the users to navigate in finding books in the library easily and interactively. This navigation application is connected to a Bluetooth Low Energy (BLE) device that will emit an RSSI signal received by the Smartphone user and show the desired distance to the bookshelf position. The method of triangulation and mean filter were used to eliminate noise in the test environment to make the position of the bookshelf can be found precisely based on the RSSI BLE Beacon value. The test results showed the largest RSSI value for LOS conditions at -48dBm and NLOS at -63 dBm; while the lowest RRSI values for LOS conditions was at -84dBm and NLOS was at -96dBm.
Źródło:
International Journal of Electronics and Telecommunications; 2022, 68, 2; 293--298
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On light subgraphs in plane graphs of minimum degree five
Autorzy:
Jendrol', Stanislav
Madaras, Tomáš
Powiązania:
https://bibliotekanauki.pl/articles/972033.pdf
Data publikacji:
1996
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
planar graph
light subgraph
star
triangulation
Opis:
A subgraph of a plane graph is light if the sum of the degrees of the vertices of the subgraph in the graph is small. It is well known that a plane graph of minimum degree five contains light edges and light triangles. In this paper we show that every plane graph of minimum degree five contains also light stars $K_{1,3}$ and $K_{1,4}$ and a light 4-path P₄. The results obtained for $K_{1,3}$ and P₄ are best possible.
Źródło:
Discussiones Mathematicae Graph Theory; 1996, 16, 2; 207-217
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The quick measure of a NURBS surface curvature for accurate triangular meshing
Autorzy:
Kniat, A.
Powiązania:
https://bibliotekanauki.pl/articles/258692.pdf
Data publikacji:
2014
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
triangulation
meshing
curvature
NURBS surface
optimization
Opis:
NURBS surfaces are the most widely used surfaces for three-dimensional models in CAD/ CAE programs. When a model for FEM calculation is prepared with a CAD program it is inevitable to mesh it finally. There are many algorithms for meshing planar regions. Some of them may be used for meshing surfaces but it is necessary to take the curvature of the surface under consideration to avoid poor quality mesh. The mesh must be denser in the curved regions of the surface. In this paper, instead of analysing a surface curvature, the method to assess how close is a mesh triangle to the surface to which its vertices belong, is presented. The distance between a mesh triangle and a parallel tangent plane through a point on a surface is the measure of the triangle quality. Finding the surface point whose projection is located inside the mesh triangle and which is the tangency point to the plane parallel to this triangle is an optimization problem. Mathematical description of the problem and the algorithm to find its solution are also presented in the paper.
Źródło:
Polish Maritime Research; 2014, 2; 41-44
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Note on the weight of paths in plane triangulations of minimum degree 4 and 5
Autorzy:
Madaras, Tomás
Powiązania:
https://bibliotekanauki.pl/articles/743763.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
weight of path
plane graph
triangulation
Opis:
The weight of a path in a graph is defined to be the sum of degrees of its vertices in entire graph. It is proved that each plane triangulation of minimum degree 5 contains a path P₅ on 5 vertices of weight at most 29, the bound being precise, and each plane triangulation of minimum degree 4 contains a path P₄ on 4 vertices of weight at most 31.
Źródło:
Discussiones Mathematicae Graph Theory; 2000, 20, 2; 173-180
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Laser triangulation in three-dimensional scanners
Autorzy:
Mikulski, S.
Powiązania:
https://bibliotekanauki.pl/articles/97387.pdf
Data publikacji:
2013
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
triangulation
3D Scanner
reverse engineering
Opis:
Three-dimensional scanners are increasingly used in various fields of science (eg. medicine, computer graphics, architecture) and industry. There are a huge variety of methods to scan objects and their selection depends primarily on the type of the object and its location. Commonly used methods include branch laser triangulation methods. The objectives of this study is to provide a method for laser triangulation. It was described in the measurement system. In particular, this work examines triangulation methods based solely on the measurement system of the rotary motion of the object. The result of this measurement is a cloud of points is described in a Cartesian coordinate system. The work will be characterized examples of mathematical models of laser triangulation scanners.
Źródło:
Computer Applications in Electrical Engineering; 2013, 11; 485-491
1508-4248
Pojawia się w:
Computer Applications in Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficient and low cost PZT network for detection and localization of damage in low curvature panels
Efektywny i ekonomiczny układ sieci piezoelektryków do detekcji i lokalizacji uszkodzeń słabo zakrzywionych paneli
Autorzy:
Constantin, N.
Sorohan, S.
Gavan, M.
Raetchi, V.
Powiązania:
https://bibliotekanauki.pl/articles/279269.pdf
Data publikacji:
2011
Wydawca:
Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej
Tematy:
Lamb wave
PZT patch
signal generator
triangulation
Opis:
The paper presents results obtained in creating an efficient inspection technique, based on the Lamb wave method, by using a powerful central signal generator, a network of receivers and a simple triangulation algorithm for detecting and localizing a defect/damage in metallic or composite panels. This is intended to be done in two variants: (i) with a fixed central PZT patch able to blast powerful omnidirectional waves of the desired frequency, shape and duration and (ii) with a variable angle mobile actuator able to generate powerful guided waves. The first variant is aimed for online monitoring, while the second, for field inspections. At this stage, only numerical simulations of the first variant have been made, with promising results in metallic panels.
W artykule zaprezentowano rezultaty badań dotyczących opracowania efektywnej metody inspekcji materiałów opartej na zastosowaniu fal Lamba wytwarzanych silnym centralnym generatorem sygnału oraz układem sieci czujników umożliwiającym wprowadzenie algorytmu triangulacji do wykrywania i lokalizowania uszkodzeń w pa- nelach metalicznych i kompozytowych. Zbadano dwa warianty realizacji tego celu: (i) poprzez naklejenie centralnego wzbudnika piezoceramicznego pozwalającego wygenerować wielokierunkową falę o zadanej częstotliwości, kształcie i czasie trwania, (ii) poprzez użycie mobilnego aktuatora o sterowanym kącie działania zdolnego do wytworzenia silnej fali prowadzonej. Pierwszy wariant jest przewidziany do ciągłego monitoringu konstrukcji, drugi do badań w terenie. Na obecnym etapie zrealizowano jedynie badania symulacyjne dla pierwszego wariantu, otrzymując obiecujące wyniki w przypadku paneli metalicznych.
Źródło:
Journal of Theoretical and Applied Mechanics; 2011, 49, 3; 685-704
1429-2955
Pojawia się w:
Journal of Theoretical and Applied Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
From Euclids Elements to the methodology of mathematics. Two ways of viewing mathematical theory
Autorzy:
Błaszczyk, Piotr
Powiązania:
https://bibliotekanauki.pl/articles/1791048.pdf
Data publikacji:
2020-01-27
Wydawca:
Uniwersytet Pedagogiczny im. Komisji Edukacji Narodowej w Krakowie
Tematy:
Elements
theory
theorem
triangulation
similar figures
Pythagorean
Opis:
We present two sets of lessons on the history of mathematics designed for prospective teachers: (1) Euclid's Theory of Area, and (2) Euclid's Theory of Similar Figures. They aim to encourage students to think of mathematics by way of analysis of historical texts. Their historical content includes Euclid's Elements, Books I, II, and VI. The mathematical meaning of the discussed propositions is simple enough that we can focus on specific methodological questions, such as (a) what makes a set of propositions a theory, (b) what are the specific objectives of the discussed theories, (c) what are their common features. In spite of many years' experience in teaching Euclid's geometry combined with methodological investigations, we cannot offer any empirical findings on how these lectures have affected the students' views on what a mathematical theory is. Therefore, we can only speculate on the hypothetical impact of these lectures on students.
Źródło:
Annales Universitatis Paedagogicae Cracoviensis. Studia ad Didacticam Mathematicae Pertinentia; 2018, 10; 5-15
2080-9751
2450-341X
Pojawia się w:
Annales Universitatis Paedagogicae Cracoviensis. Studia ad Didacticam Mathematicae Pertinentia
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On short cycles through prescribed vertices of a polyhedral graph
Autorzy:
Hexel, Erhard
Powiązania:
https://bibliotekanauki.pl/articles/744171.pdf
Data publikacji:
2005
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
polyhedral graph
triangulation
short cycle
prescribed vertices
Opis:
Guaranteed upper bounds on the length of a shortest cycle through k ≤ 5 prescribed vertices of a polyhedral graph or plane triangulation are proved.
Źródło:
Discussiones Mathematicae Graph Theory; 2005, 25, 3; 419-426
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Triangulation as the method used in the study of local security
Autorzy:
Štofko, Stanislav
Wałek, Tomas
Powiązania:
https://bibliotekanauki.pl/articles/527009.pdf
Data publikacji:
2016
Wydawca:
Collegium Civitas
Tematy:
safety
local level
research
research methods
triangulation
Opis:
Research on the science of safety can be carried out various scientific methods, al-lowing to obtain the results of both a quantitative as well as qualitative. As part of the research you can use a wide range of methods, techniques and research tools. The publication aims to popularize the method of triangulation in research on local security. The author describes the characteristics and advantages triangulation method over other methods in studies of local security.
Źródło:
Securitologia; 2016, 1 (23); 77-85
1898-4509
Pojawia się w:
Securitologia
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Verification of the predictive segmentation algorithm for the laser triangulation method
Autorzy:
Reiner, J.
Stankiewicz, M.
Powiązania:
https://bibliotekanauki.pl/articles/220548.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
laser triangulation
predictive segmentation
discrete Gaussian curvature
Opis:
Laser triangulation is one of the machine vision measurement methods most commonly used in 3D quality control. However, considering its susceptibility to interference, it cannot be used in certain areas of industrial production e.g. very shiny surfaces. Thus, for the improvement of its applicability, a predictive algorithm of light profile segmentation was designed, where - as a result of using a'priori knowledge - the method becomes resistant to secondary reflexes. The developed technique has been tested on selected parts with surfaces typical for the machine-building industry. The evaluation has been presented based on the surface representation (mapping) error analysis, using the difference between the obtained cloud of points and the nominal surface as processing data, as well as scatter of the discrete Gauss curvature.
Źródło:
Metrology and Measurement Systems; 2011, 18, 4; 667-678
0860-8229
Pojawia się w:
Metrology and Measurement Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Some recent results on domination in graphs
Autorzy:
Plummer, Michael
Powiązania:
https://bibliotekanauki.pl/articles/743609.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
domination
matching
toughness
cubic graph
triangulation
genus
Opis:
In this paper, we survey some new results in four areas of domination in graphs, namely:
(1) the toughness and matching structure of graphs having domination number 3 and which are "critical" in the sense that if one adds any missing edge, the domination number falls to 2;
(2) the matching structure of graphs having domination number 3 and which are "critical" in the sense that if one deletes any vertex, the domination number falls to 2;
(3) upper bounds on the domination number of cubic graphs; and
(4) upper bounds on the domination number of graphs embedded in surfaces.
Źródło:
Discussiones Mathematicae Graph Theory; 2006, 26, 3; 457-474
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Development of a topology-based current-flux characteristic approximation in a Hamiltonian model of a reluctance machine
Autorzy:
Burlikowski, W.
Kowalik, Z.
Powiązania:
https://bibliotekanauki.pl/articles/141438.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Hamiltonian model
simplicial approximation
reluctance machine
triangulation refinement
Opis:
The paper presents an algorithm for the construction of an approximation of a highly nonlinear current-flux characteristic of a synchronous reluctance machine. Such an approximation is required in a Hamiltonian model of an electric machine and the constructed approximation is suited to be used in such a model. It employs a simplicial approximation based on irregular points sets in the spaces of currents and fluxes. The sets are constructed by the iterative insertion of new points. Initially the sets contain an arbitrarily small number of elements. The insertion is based on an approximation error calculation. Based on the sets containing possibly small number of elements, the proposed procedure leads to smooth and precise approximation. Due to the nonlinearity of the approximated characteristics, ambiguities can occur. A method for the triangulation refinement of the sets of currents and fluxes that eliminates them is also presented. In the paper, a reluctance machine model using the constructed approximation is described and compared with a model using the approximation based on regular sets.
Źródło:
Archives of Electrical Engineering; 2015, 64, 2; 277-289
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Triangulation as a method of the research in jurisprudence
Autorzy:
Gurbiel, Agnieszka
Powiązania:
https://bibliotekanauki.pl/articles/1162988.pdf
Data publikacji:
2018
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
jurisprudence
mixed methods
paradigm
pragmatism
social science
triangulation
Opis:
The purpose of the article is proposing new possibilities in using the triangulation in jurisprudence. This paper consists of two main substantial parts ended in summarizing conclusion. The first component discusses the paradigm of the social science in the context of using the research methods. After that, the essence and meaning of the triangulation were explained. It was the foundation to suggest triangulation as a research method in jurisprudence.
Źródło:
World Scientific News; 2018, 110; 119-128
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 50

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies