Log in

Relevant bibliographies by topics / Vertex merge / Journal articles

To see the other types of publications on this topic, follow the link: Vertex merge.

Journal articles on the topic 'Vertex merge'

Author: Grafiati

Published: 3 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Vertex merge.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Handrizal. "PERBANDINGAN ALGORITMA DSATUR DAN ALGORITMA VERTEX MERGE UNTUK MENENTUKAN CHANNEL WLAN." Jurasik (Jurnal Riset Sistem Informasi dan Teknik Informatika) 1, no. 1 (2016): 14–20. https://doi.org/10.5281/zenodo.546757.

Full text

Abstract:

Along with technological development, the need for the availability of access internet through a wireless local area network (WLAN) will also increase. more and more the growing number of WLAN it will affect the quality of the WLAN itself, for it needed a way to resolve the issue. Dsatur algorithms and algorithms Merge Vertex are two algorithms that can be used to help the above problems. Both algorithms work based on the concept of graph coloring, every vertex in the graph is analogous to an access point in a WLAN. result This study showed that the algorithm works better Merge Vertex compared

APA, Harvard, Vancouver, ISO, and other styles

2

Handrizal, Handrizal. "PERBANDINGAN ALGORITMA DSATUR DAN ALGORITMA VERTEX MERGE UNTUK MENENTUKAN CHANNEL WLAN." Jurasik (Jurnal Riset Sistem Informasi dan Teknik Informatika) 1, no. 1 (2017): 14. http://dx.doi.org/10.30645/jurasik.v1i1.4.

Full text

Abstract:

Seiring dengan perkembangan teknologi maka kebutuhan akan ketersedian akses internet melalui wireless lokal area network (WLAN) akan ikut meningkat. Semakin bertambahnya jumlah WLAN maka akan mempengaruhi kualitas dari WLAN itu sendiri, untuk itu diperlukan cara mengatasi masalah tersebut. Algoritma Dsatur dan algoritma Vertex Merge adalah dua buah algoritma yang dapat digunakan untuk membantu masalah diatas. Kedua algoritma ini bekerja berdasarkan konsep pewarnaan graf, setiap vertex dalam graf dianalogikan sebagai akses point dalam WLAN. Hasil penelitian ini menunjukkan bahwa Algoritma Verte

APA, Harvard, Vancouver, ISO, and other styles

3

Handrizal. "Comparison between Vertex Merge Algorithm and Dsatur Algorithm." Journal of Computer Science 7, no. 5 (2011): 664–70. http://dx.doi.org/10.3844/jcssp.2011.664.670.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Petrichenko, Mihail R., and Ol’ga A. Solov’yova. "Merging and splitting flows in a tee: the Pavlovsky method." Vestnik MGSU, no. 11 (November 2020): 1546–55. http://dx.doi.org/10.22227/1997-0935.2020.11.1546-1555.

Full text

Abstract:

Introduction. The Pavlovsky method is employed to consider the flows that merge and split inside a tee. Materials and methods. The problem of flows, merging and splitting inside a simple straight tee, is reduced to the problem of limits in a theory of functions applied to the characteristic function of a flow. The influence of the geometric parameter of a tee (a module), head losses and an external power source, produced on the flow rate coefficient in a tee, is identified in the work. Results. The co-authors identified a relation between the geometric parameters of a tee and its c

APA, Harvard, Vancouver, ISO, and other styles

5

Handrizal, A. Noraziah, and Ahmed N. Abd.Alla. "Channel Allocation for Direct Sequence Spread Spectrum Using Vertex Merge Algorithm." International Journal of Computer Science and Information Technology 3, no. 1 (2011): 139–50. http://dx.doi.org/10.5121/ijcsit.2011.3110.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

LIVNY, YOTAM, NETA SOKOLOVSKY, and JIHAD EL-SANA. "DUAL ADAPTIVE PATHS FOR MULTIRESOLUTION HIERARCHIES." International Journal of Image and Graphics 07, no. 02 (2007): 273–90. http://dx.doi.org/10.1142/s0219467807002726.

Full text

Abstract:

The recent increase in the generated polygonal dataset sizes has outpaced the performance of graphics hardware. Several solutions such as multiresolution hierarchies and level-of-detail rendering have been developed to bridge the increasing gap. However, the discrete levels of detail generate annoying popping effects, the preliminaries multiresolution schemes cannot perform drastic changes on the selected level of detail within the span of small number of frames, and the current cluster-based hierarchies suffer from the high-detailed representation of the boundaries between clusters. In this p

APA, Harvard, Vancouver, ISO, and other styles

7

East, James. "THE FACTORIZABLE BRAID MONOID." Proceedings of the Edinburgh Mathematical Society 49, no. 3 (2006): 609–36. http://dx.doi.org/10.1017/s0013091504001452.

Full text

Abstract:

AbstractIn this paper we study the factorizable braid monoid (also known as the merge-and-part braid monoid) introduced by Easdown, East and FitzGerald in 2004. We find several presentations of this monoid, and uncover an interesting connection with the singular braid monoid. This leads to the definition of the flexible singular braid monoid, which consists of ‘flexible-vertex-isotopy’ classes of singular braids. We conclude by defining and studying the pure factorizable braid monoid, the maximal subgroups of which are (isomorphic to) quotients of the pure braid group.

APA, Harvard, Vancouver, ISO, and other styles

8

Long, Jun, Lei Zhu, Zhan Yang, Chengyuan Zhang, and Xinpan Yuan. "Temporal Activity Path Based Character Correction in Heterogeneous Social Networks via Multimedia Sources." Advances in Multimedia 2018 (2018): 1–16. http://dx.doi.org/10.1155/2018/2058670.

Full text

Abstract:

Vast amount of multimedia data contains massive and multifarious social information which is used to construct large-scale social networks. In a complex social network, a character should be ideally denoted by one and only one vertex. However, it is pervasive that a character is denoted by two or more vertices with different names; thus it is usually considered as multiple, different characters. This problem causes incorrectness of results in network analysis and mining. The factual challenge is that character uniqueness is hard to correctly confirm due to lots of complicated factors, for exam

APA, Harvard, Vancouver, ISO, and other styles

9

Wu, Yan, Weipeng Kong, Zhiyuan Guo, Shizhan Han, and Zhaoyang Li. "A Fast Reconstruction Algorithm for Stereolithography File Topology Based on Hash Tables." Journal of Physics: Conference Series 2558, no. 1 (2023): 012001. http://dx.doi.org/10.1088/1742-6596/2558/1/012001.

Full text

Abstract:

Abstract Aiming at the problem of redundant data and loss of original topological relations in the conversion of 3D models into STL files in the engineering manufacturing process, a hash table structure based on the square-taking method and the chain table method is established based on extracting the information storage characteristics of STL files, and a fast reconstruction algorithm based on the hash table for the topological relations of STL files is proposed. The hash table is used to merge redundant point data, and the topological reconstruction of the model is completed by using the poi

APA, Harvard, Vancouver, ISO, and other styles

10

Maity, A. K., T. Inoue, Y. Fukui, et al. "Cloud–Cloud Collision: Formation of Hub-filament Systems and Associated Gas Kinematics. Mass-collecting Cone—A New Signature of Cloud–Cloud Collision." Astrophysical Journal 974, no. 2 (2024): 229. http://dx.doi.org/10.3847/1538-4357/ad7098.

Full text

Abstract:

Abstract Massive star-forming regions (MSFRs) are commonly associated with hub-filament systems (HFSs) and sites of cloud–cloud collision (CCC). Recent observational studies of some MSFRs suggest a possible connection between CCC and the formation of HFSs. To understand this connection, we analyzed the magnetohydrodynamic simulation data from Inoue et al. This simulation involves the collision of a spherical turbulent molecular cloud with a plane-parallel sea of dense molecular gas at a relative velocity of about 10 km s−1. Following the collision, the turbulent and nonuniform cloud undergoes

APA, Harvard, Vancouver, ISO, and other styles

11

Cao, Hao, Rong Mo, Neng Wan, Fang Shang, Chunlei Li, and Dongliang Zhang. "A subassembly identification method for truss structures manufacturing based on community detection." Assembly Automation 35, no. 3 (2015): 249–58. http://dx.doi.org/10.1108/aa-02-2015-011.

Full text

Abstract:

Purpose – The purpose of this paper is to present an automated method for complicated truss structure subassembly identification. Design/methodology/approach – A community-detecting algorithm is introduced and adapted to reach the target. The ratio between oriented bounding boxes of parts is used as the weight to reflect the compact degree of assembly relationships. The authors also propose a method to merge nodes together at cut-vertex in model, by which the solving process could be accelerated. Findings – This method could identify the subassemblies of complex truss structures according to t

APA, Harvard, Vancouver, ISO, and other styles

12

Cheng, Jianjun, Wenbo Zhang, Haijuan Yang, Xing Su, Tao Ma, and Xiaoyun Chen. "A Seed-Expanding Method Based on TOPSIS for Community Detection in Complex Networks." Complexity 2020 (March 23, 2020): 1–14. http://dx.doi.org/10.1155/2020/9017239.

Full text

Abstract:

The centrality plays an important role in many community-detection algorithms, which depend on various kinds of centralities to identify seed vertices of communities first and then expand each of communities based on the seeds to get the resulting community structure. The traditional algorithms always use a single centrality measure to recognize seed vertices from the network, but each centrality measure has both pros and cons when being used in this circumstance; hence seed vertices identified using a single centrality measure might not be the best ones. In this paper, we propose a framework

APA, Harvard, Vancouver, ISO, and other styles

13

Becker, David A. "Tending to the Facial Surfaces of a Mathematical Biology Head-Scratcher: Why Does the Head of the Sea Turtle Natator depressus Resemble a Convex Zygomorphic Dodecahedron?" Animals 15, no. 1 (2025): 100. https://doi.org/10.3390/ani15010100.

Full text

Abstract:

Two convex polyhedra that markedly resemble the head of the flatback sea turtle hatchling are identified. The first example is a zygomorphic tetragonal dodecahedron, while the other, an even better matching structure, is a related tetradecahedron, herein speculated to arise from this particular dodecahedron via known mechanisms gleaned from studies of the behavior of foams. A segmented, biomorphic, convex polyhedral model to address cephalic topology is thus presented stemming from solid geometry, anatomical observations, and a recently computed densest local packing arrangement of fifteen sli

APA, Harvard, Vancouver, ISO, and other styles

14

Bari, M., S. Belforte, A. Cerri, et al. "The Merger board of the CDF Silicon Vertex Tracker." IEEE Transactions on Nuclear Science 49, no. 4 (2002): 1841–44. http://dx.doi.org/10.1109/tns.2002.801663.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Antony Arockiasamy, M., and A. Manivasagam. "Prime cordial labeling of n-chain vertex merged staircase graphs." Journal of Physics: Conference Series 1597 (July 2020): 012010. http://dx.doi.org/10.1088/1742-6596/1597/1/012010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Badcock, J. M., and R. A. Jarvist. "Wire-frame modelling of polyhedral objects from rangefinder data." Robotica 12, no. 1 (1994): 65–75. http://dx.doi.org/10.1017/s0263574700018208.

Full text

Abstract:

Methods are described for computer analysis of image-data from a coded-stripe rangefinder. The main objective is to find vertex coordinates and connectivity information for a polyhedral object, enabling it to be represented by a wire-frame model. For each of several rangefinder viewpoints, the data is processed to extract three-dimensional edge and vertex positions. The emphasis is on estimation techniques that make good use of fairly sparse data-points. Results from different viewpoints are merged to produce a 3D model of the object.

APA, Harvard, Vancouver, ISO, and other styles

17

Silitonga, Anggi Natanael, and Dicky Apdillah. "Penjadwalan Perkuliahan Dengan Metode Vertex Graph Coloring Dan Simulated Annealing." JOURNAL OF INDUSTRIAL AND MANUFACTURE ENGINEERING 1, no. 2 (2019): 56. http://dx.doi.org/10.31289/jime.v1i2.2328.

Full text

Abstract:

<p><em>In college, lecture scheduling is very important in lecturing process, because the activities of lecturers and students depend on lecture schedule. To solve the problem, use Vertex GraphColoring and Simulated Annealing. In Vertex Graph Coloring, look for neighboring and neighboring vertices. While on Simulated Annealing, look for space and exchange positions randomly. The merger of Vertex Graph Coloring and Simulated Annealing aims to create optimum lecture schedule by looking at hard constraint and soft constraint. Testing is done at Faculty of Pharmacy University of North

APA, Harvard, Vancouver, ISO, and other styles

18

Shen, Wenfei, Liang Huo, Tao Shen, Miao Zhang, and Yucai Li. "Optimization of Texture Rendering of 3D Building Model Based on Vertex Importance." International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLVIII-2-2024 (June 11, 2024): 371–78. http://dx.doi.org/10.5194/isprs-archives-xlviii-2-2024-371-2024.

Full text

Abstract:

Abstract. In 3D building models, a large number of texture maps with different sizes increase the number of model data loading and drawing batches, which greatly reduces the drawing efficiency of the model. Therefore, this paper proposes a texture set mapping method based on vertex importance. Firstly, based on the 2D space boxing algorithm, the texture maps are merged and a series of Mipmap texture maps are generated, and then the vertex curvature, texture variability and location information of each vertex are calculated, normalized, and weighted to get the importance of each vertex, and the

APA, Harvard, Vancouver, ISO, and other styles

19

Chibuye, Gabriel, Jackson Phiri, and Faustin Banda. "A Spatial Framework for Managing Sewer and Water Networks Using Sensor Networks: A Case of the University of Zambia." International Journal of Recent Contributions from Engineering, Science & IT (iJES) 8, no. 1 (2020): 48. http://dx.doi.org/10.3991/ijes.v8i1.13983.

Full text

Abstract:

The University of Zambia like any public institution has a lot of infrastructure which require maintenance and management. There’s however uncertainty of the utility lines locations and their depths. This causes destruction of water pipes and sewer lines when undertaking new constructions or any excavations. The lack of accurate location of underground and un-updated lines makes maintenance, management and planning of the utilities very difficult. Therefore this study aimed to build a framework for Managing Sewer and Water Networks Using Sensor Networks at the University of Zambia. The Residen

APA, Harvard, Vancouver, ISO, and other styles

20

Wang, Yong. "A Genetic Algorithm with the Mixed Heuristics for Traveling Salesman Problem." International Journal of Computational Intelligence and Applications 14, no. 01 (2015): 1550003. http://dx.doi.org/10.1142/s1469026815500030.

Full text

Abstract:

Traveling salesman problem (TSP) is one of well-known discrete optimization problems. The genetic algorithm is improved with the mixed heuristics to resolve TSP. The first heuristics is the four vertices and three lines inequality, which is applied to the 4-vertex paths to generate the shorter Hamiltonian cycles (HC). The second local heuristics is executed to reverse the i-vertex paths with more than two vertices, which also generates the shorter HCs. It is necessary that the two heuristics coordinate with each other in the optimization process. The time complexity of the first and second heu

APA, Harvard, Vancouver, ISO, and other styles

21

Müller, Hanne. "Å merke verden: Arbeid som kunnskap og eksistens." Norsk antropologisk tidsskrift 15, no. 03 (2004): 145–57. http://dx.doi.org/10.18261/issn1504-2898-2004-03-03.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Burger, W. "Om inteendeel te sê: oor selfskepping - wanneer lewe en vertel deurmekaar raak." Literator 16, no. 1 (1995): 111–26. http://dx.doi.org/10.4102/lit.v16i1.596.

Full text

Abstract:

To say ‘on the contrary’: On self-creation - when life and narration mergeIn Brink’s novel, Inteendeel (On the Contrary) of 1993, Estienne Barbier rewrites his life while imprisoned in the Dark Hole. A close relationship between life and narration thus develops. This problematic relation is often foregrounded in metafictional texts. On the one hand, mimetic representation of reality is undermined, while on the other, the textuaiity, the linguistic quality of life, is emphasized. The dialogic character of self-creation prevents this metafictional text, in which self-creation also plays an impor

APA, Harvard, Vancouver, ISO, and other styles

23

Yuan, Ling, Jiali Bin, and Peng Pan. "Optimized Distributed Subgraph Matching Algorithm Based on Partition Replication." Electronics 9, no. 1 (2020): 184. http://dx.doi.org/10.3390/electronics9010184.

Full text

Abstract:

At present, with the explosive growth of data scale, subgraph matching for massive graph data is difficult to satisfy with efficiency. Meanwhile, the graph index used in existing subgraph matching algorithm is difficult to update and maintain when facing dynamic graphs. We propose a distributed subgraph matching algorithm based on Partition Replica (noted as PR-Match) to process the partition and storage of large-scale data graphs. The PR-Match algorithm first splits the query graph into sub-queries, then assigns the sub-query to each node for sub-graph matching, and finally merges the matchin

APA, Harvard, Vancouver, ISO, and other styles

24

XU, ELVIS H. W., and PAK MING HUI. "Efficient detection of communities with significant overlaps in networks: Partial community merger algorithm." Network Science 6, no. 1 (2017): 71–96. http://dx.doi.org/10.1017/nws.2017.32.

Full text

Abstract:

AbstractDetecting communities in large-scale social networks is a challenging task where each vertex may belong to multiple communities. Such behavior of vertices and the implied strong overlaps among communities render many detection algorithms invalid. We develop a Partial Community Merger Algorithm (PCMA) for detecting communities with significant overlaps as well as slightly overlapping and disjoint ones. It is a bottom-up approach based on properly reassembling partial information of communities revealed in ego networks of vertices to reconstruct complete communities. We propose a novel s

APA, Harvard, Vancouver, ISO, and other styles

25

Brisson, Jean Denis, Claude Simard, Jean Brodeur, and David Martineau. "Premières mentions des araignées (Araneae) Phidippus audax Hentz, 1845 (Salticidae) et Tetragnatha viridis Walckenaer, 1841 (Tetragnathidae) au Québec." Entomologie 137, no. 1 (2012): 33–38. http://dx.doi.org/10.7202/1013187ar.

Full text

Abstract:

Nous rapportons, pour la première fois au Québec, la présence de l’araignée sauteuse Phidippus audax Hentz, 1845 (Salticidae Blackwall, 1841) et de la tétragnathe verte Tetragnatha viridis Walckenaer, 1841 (Tetragnathidae Menge, 1866). Nous décrivons les conditions de leur découverte et commentons leur répartition. Nos observations concernant l’araignée P. audax suggèrent que cette espèce soit à la fois une espèce indigène (trouvée en milieu naturel en Mauricie et à Longueuil), mais aussi une espèce introduite comme en témoigne sa découverte dans des camions importés du Minnesota. La tétragnat

APA, Harvard, Vancouver, ISO, and other styles

26

Liu, Chengjun, Zhuo Peng, Weiguo Zheng, and Lei Zou. "FSM: A Fine-Grained Splitting and Merging Framework for Dual-Balanced Graph Partition." Proceedings of the VLDB Endowment 17, no. 9 (2024): 2378–91. http://dx.doi.org/10.14778/3665844.3665864.

Full text

Abstract:

Partitioning a large graph into smaller subgraphs by minimizing the number of cutting vertices and edges, namely cut size or replication factor, plays a crucial role in distributed graph processing tasks. However, many prior works have primarily focused on optimizing the cut size by considering only vertex balance or edge balance, leading to significant workload imbalance and consequently hindering the performance of downstream tasks. Therefore, in this paper, we address the dual-balanced graph partition problem that minimizes the cut size while simultaneously guaranteeing both vertex and edge

APA, Harvard, Vancouver, ISO, and other styles

27

Ramya, P. Radhika, and Y. Sudha Vani. "Optimization and Implementation of Reversible BCD Adder in Terms of Number of Lines." International Journal of Reconfigurable and Embedded Systems (IJRES) 2, no. 1 (2013): 21. http://dx.doi.org/10.11591/ijres.v2.i1.pp21-26.

Full text

Abstract:

The Reversible logic plays an important role to obtain the minimal energy dissipation. It is the main requirement in the low power digital design. To implement a reversible function some additional lines are required. Sometimes it is more than the primary inputs which leads to increased size of the circuit. Hence the reducing the number of circuit lines is one of the major criterion in reversible logic. The general idea is to merge the garbage output lines with appropriate constant input lines. In this work, Toffoli gate implementation of BCD adder and press gate implementation of BCD adder is

APA, Harvard, Vancouver, ISO, and other styles

28

Hedendahl, Daniel, Ingvar Lindgren, and Sten Salomonson. "Towards numerical implementation of the relativistically covariant many-body perturbation theoryThis paper was presented at the International Conference on Precision Physics of Simple Atomic Systems, held at University of Windsor, Windsor, Ontario, Canada on 21–26 July 2008." Canadian Journal of Physics 87, no. 7 (2009): 817–24. http://dx.doi.org/10.1139/p08-146.

Full text

Abstract:

The standard procedure for relativistic many-body perturbation theory (RMBPT) is not relativistically covariant, and the effects of retardation, virtual-electron-positron-pair, and radiative effects (self-energy, vacuum polarisation, and vertex correction) — the so-called QED effects — are left out. The energy contribution from the QED effects can be evaluated by the covariant evolution operator method, which has a structure that is similar to that of RMBPT, and it can serve as a merger between QED and RMBPT. The new procedure makes it, in principle, possible for the first time to evaluate QED

APA, Harvard, Vancouver, ISO, and other styles

29

Xu, Xiang, Joseph Lambourne, Pradeep Jayaraman, Zhengqing Wang, Karl Willis, and Yasutaka Furukawa. "BrepGen: A B-rep Generative Diffusion Model with Structured Latent Geometry." ACM Transactions on Graphics 43, no. 4 (2024): 1–14. http://dx.doi.org/10.1145/3658129.

Full text

Abstract:

This paper presents BrepGen , a diffusion-based generative approach that directly outputs a Boundary representation (B-rep) Computer-Aided Design (CAD) model. BrepGen represents a B-rep model as a novel structured latent geometry in a hierarchical tree. With the root node representing a whole CAD solid, each element of a B-rep model (i.e., a face, an edge, or a vertex) progressively turns into a child-node from top to bottom. B-rep geometry information goes into the nodes as the global bounding box of each primitive along with a latent code describing the local geometric shape. The B-rep topol

APA, Harvard, Vancouver, ISO, and other styles

30

Liu, Peng Xin, and Yang Wang. "A Novel 3D Mesh Segmentation Method of Algebraic Models in Reverse Engineering." Key Engineering Materials 419-420 (October 2009): 661–64. http://dx.doi.org/10.4028/www.scientific.net/kem.419-420.661.

Full text

Abstract:

Conventional engineering parts usually composed by algebraic surfaces are important investigation objects of reverse engineering. In this paper a step segmentation method for algebraic models is proposed. The mesh normals and curvedness of every vertex are estimated as a shape descriptor. In the first segmentation fourteen directions are chosen initially, and a k-means algorithm according to the normal vectors is used, then the surface is divided to form patches by a region-growing scheme, as well as some sharp edges or flat areas are detected. In order to identify algebraic surface, curvednes

APA, Harvard, Vancouver, ISO, and other styles

31

Chen, Jing, Haitong Zhao, Xinyu Yang, Mingxin Liu, Zeren Yu, and Miaomiao Liu. "Community Evolution Prediction Based on Multivariate Feature Sets and Potential Structural Features." Mathematics 10, no. 20 (2022): 3802. http://dx.doi.org/10.3390/math10203802.

Full text

Abstract:

The current study on community evolution prediction ignores the problem of internal community topology characteristics and does not take feature sets extraction into account. Therefore, the MF-PSF (Multivariate Feature sets and Potential Structural Features) method based on multivariate feature sets and potential structural features for community evolution prediction is proposed in this paper. Firstly, the multivariate feature sets are built from four aspects: community core node features, community structural features, community sequential features and community behavior features. Secondly, t

APA, Harvard, Vancouver, ISO, and other styles

32

Wang, W. X., L. P. Hong, H. S. Huang, et al. "FILLING GAPS BETWEEN MESHES OF TREE CROWN AND TREE TRUNK BASED ON BOUNDARY CONSTRAINTS AND COORDINATE PROJECTION FOR 3D TREE MODELLING." International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLVIII-1/W2-2023 (December 13, 2023): 1081–87. http://dx.doi.org/10.5194/isprs-archives-xlviii-1-w2-2023-1081-2023.

Full text

Abstract:

Abstract. In order to reconstruct high-quality 3D tree models, trunks and crowns could be reconstructed using appropriate methods separately and merged together. During this process, gaps will appear after tree models are spliced, which will affect the models' topological connectivity and visual effects. In this paper, a gap-repair algorithm for tree mesh models based on boundary restriction and coordinates projection is proposed. The algorithm first extracts all the holes in the tree trunk meshes and crown meshes and matched them according to their relative positions. Then, the gaps in the tr

APA, Harvard, Vancouver, ISO, and other styles

33

Ludlam, R. M., E. M. Cackett, J. A. García, et al. "Radius Constraints from Reflection Modeling of Cygnus X-2 with NuSTAR and NICER." Astrophysical Journal 927, no. 1 (2022): 112. http://dx.doi.org/10.3847/1538-4357/ac5028.

Full text

Abstract:

Abstract We present a spectral analysis of NuSTAR and NICER observations of the luminous, persistently accreting neutron star (NS) low-mass X-ray binary Cygnus X-2. The data were divided into different branches that the source traces out on the Z-track of the X-ray color–color diagram; namely, the horizontal branch, the normal branch, and the vertex between the two. The X-ray continuum spectrum was modeled in two different ways that produced comparable quality fits. The spectra showed clear evidence of a reflection component in the form of a broadened Fe K line, as well as a lower-energy emiss

APA, Harvard, Vancouver, ISO, and other styles

34

KOVCHEGOV, YEVGENIY, and ILYA ZALIAPIN. "HORTON LAW IN SELF-SIMILAR TREES." Fractals 24, no. 02 (2016): 1650017. http://dx.doi.org/10.1142/s0218348x16500171.

Full text

Abstract:

Self-similarity of random trees is related to the operation of pruning. Pruning [Formula: see text] cuts the leaves and their parental edges and removes the resulting chains of degree-two nodes from a finite tree. A Horton–Strahler order of a vertex [Formula: see text] and its parental edge is defined as the minimal number of prunings necessary to eliminate the subtree rooted at [Formula: see text]. A branch is a group of neighboring vertices and edges of the same order. The Horton numbers [Formula: see text] and [Formula: see text] are defined as the expected number of branches of order [Form

APA, Harvard, Vancouver, ISO, and other styles

35

Sellheim, Nikolas. "Hakapik. Yoanis Menge . 2016. L’Étang-du-nord: Les édition la Morue verte. 168 p, illustrated, hardcover. ISBN 978-2-924564-02-8. CA$ 59.95." Polar Record 53, no. 2 (2016): 227. http://dx.doi.org/10.1017/s0032247416000450.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Alhevaz, Abdollah, Maryam Baghipur, and Yilun Shang. "Merging the Spectral Theories of Distance Estrada and Distance Signless Laplacian Estrada Indices of Graphs." Mathematics 7, no. 10 (2019): 995. http://dx.doi.org/10.3390/math7100995.

Full text

Abstract:

Suppose that G is a simple undirected connected graph. Denote by D ( G ) the distance matrix of G and by T r ( G ) the diagonal matrix of the vertex transmissions in G, and let α ∈ [ 0 , 1 ] . The generalized distance matrix D α ( G ) is defined as D α ( G ) = α T r ( G ) + ( 1 − α ) D ( G ) , where 0 ≤ α ≤ 1 . If ∂ 1 ≥ ∂ 2 ≥ … ≥ ∂ n are the eigenvalues of D α ( G ) ; we define the generalized distance Estrada index of the graph G as D α E ( G ) = ∑ i = 1 n e ∂ i − 2 α W ( G ) n , where W ( G ) denotes for the Wiener index of G. It is clear from the definition that D 0 E ( G ) = D E E ( G ) an

APA, Harvard, Vancouver, ISO, and other styles

37

Ouazzani Chahdi, Adnane, Anouar Ragragui, Akram Halli, and Khalid Satori. "Per-pixel displacement mapping using cone tracing with correct silhouette." Journal of graphic engineering and design 12, no. 4 (2021): 39–61. http://dx.doi.org/10.24867/jged-2021-4-039.

Full text

Abstract:

Per-pixel displacement mapping is a texture mapping technique that adds the microrelief effect to 3D surfaces without increasing the density of their corresponding meshes. This technique relies on ray tracing algorithms to find the intersection point between the viewing ray and the microrelief stored in a 2D texture called a depth map. This intersection makes it possible to deter- mine the corresponding pixel to produce an illusion of surface displacement instead of a real one. Cone tracing is one of the per-pixel displacement map- ping techniques for real-time rendering that relies on the enc

APA, Harvard, Vancouver, ISO, and other styles

38

Ring, Sebastian. "Play14 – Festival für kreatives Computerspielen." merz | medien + erziehung 58, no. 5 (2014): 79–81. http://dx.doi.org/10.21240/merz/2014.5.19.

Full text

Abstract:

Sehen. Machen. Reden. Feiern. – so gliedert sich das 60 Seiten starke Programmheft der Play14, dem Festival für kreatives Computerspielen. Diese Auflistung von Verben lässt sich ohne Weiteres ergänzen, etwa um Laufen, Lachen, Staunen und natürlich: Spielen. Diese eigenartige Handlungsform ist der Ausgangspunkt und Gegenstand des fünftägigen Festivals in der Elbmetropole – und das Festival führt wirklich eine Vielzahl ganz unterschiedlicher Verständnisse und Praktiken von Spiel vor Augen. Oder lädt eben ein zum Machen, Reden, Feiern und mehr. Das Play-Festival folgt dem Anspruch, ein Festival f

APA, Harvard, Vancouver, ISO, and other styles

39

Bollobás, Béla, Oliver Riordan, Erik Slivken, and Paul Smith. "The Threshold for Jigsaw Percolation on Random Graphs." Electronic Journal of Combinatorics 24, no. 2 (2017). http://dx.doi.org/10.37236/6102.

Full text

Abstract:

Jigsaw percolation is a model for the process of solving puzzles within a social network, which was recently proposed by Brummitt, Chatterjee, Dey and Sivakoff. In the model there are two graphs on a single vertex set (the `people' graph and the `puzzle' graph), and vertices merge to form components if they are joined by an edge of each graph. These components then merge to form larger components if again there is an edge of each graph joining them, and so on. Percolation is said to occur if the process terminates with a single component containing every vertex. In this note we determine the t

APA, Harvard, Vancouver, ISO, and other styles

40

Aliniaeifard, Farid, Shu Xiao Li, and Stephanie van Willigenburg. "Generalized Chromatic Functions." International Mathematics Research Notices, January 8, 2024. http://dx.doi.org/10.1093/imrn/rnad149.

Full text

Abstract:

Abstract We define vertex-colourings for edge-partitioned digraphs, which unify the theory of $P$-partitions and proper vertex-colourings of graphs. We use our vertex-colourings to define generalized chromatic functions, which merge the chromatic symmetric and quasisymmetric functions of graphs and generating functions of $P$-partitions. Moreover, numerous classical bases of symmetric and quasisymmetric functions, both in commuting and noncommuting variables, can be realized as special cases of our generalized chromatic functions. We also establish product and coproduct formulas for our functi

APA, Harvard, Vancouver, ISO, and other styles

41

Konch, Nijara, A. Bharali, H. S. Ramane, and Sumanta Borah. "$A_\alpha$-SPECTRA OF DUPLICATION CORONAS." South East Asian Journal of Mathematics and Mathematical Sciences 20, no. 02 (2024). https://doi.org/10.56827/seajmms.2024.2002.2.

Full text

Abstract:

The convex combination of diagonal matrix $D(G)$ and adjacency matrix $A(G)$ defined as $A_\alpha(G)=\alpha D(G)+(1-\alpha)A(G) \textrm{for} \alpha \in [0,1] $ is indeed a good choice to merge $A$-spectra and $Q$-spectra theories of graphs. In this work, we discuss $A_\alpha$-eigenvalues of duplication corona, duplication edge corona, duplication neighbourhood corona and vertex complemented corona. Motivated by these operations, we have defined duplication vertex complemented corona operation and obtained corresponding $A_\alpha$-eigenvalues. We have also suggested some infinite family of grap

APA, Harvard, Vancouver, ISO, and other styles

42

Tah, Indrajit, Daniel Haertter, Janice M. Crawford, Daniel P. Kiehart, Christoph F. Schmidt, and Andrea J. Liu. "A minimal vertex model explains how the amnioserosa avoids fluidization during Drosophila dorsal closure." Proceedings of the National Academy of Sciences 122, no. 1 (2024). https://doi.org/10.1073/pnas.2322732121.

Full text

Abstract:

Dorsal closure is a process that occurs during embryogenesis of Drosophila melanogaster . During dorsal closure, the amnioserosa (AS), a one-cell thick epithelial tissue that fills the dorsal opening, shrinks as the lateral epidermis sheets converge and eventually merge. During this process, both shape index and aspect ratio of amnioserosa cells increase markedly. The standard 2-dimensional vertex model, which successfully describes tissue sheet mechanics in multiple contexts, would in this case predict that the tissue should fluidize via cell neighbor changes. Surprisingly, however, the amnio

APA, Harvard, Vancouver, ISO, and other styles

43

Peters, Jörg, Kyle Shih-Huang Lo, and Kȩstutis Karčiauskas. "Algorithm ⋆: Bi-cubic splines for polyhedral control nets." ACM Transactions on Mathematical Software, October 31, 2022. http://dx.doi.org/10.1145/3570158.

Full text

Abstract:

For control nets outlining a large class of topological polyhedra, not just tensor-product grids, bi-cubic polyhedral spline s form a piecewise polynomial, first-order differentiable space that associates one function with each vertex. Akin to tensor-product splines, the resulting smooth surface approximates the polyhedron. Admissible polyhedral control net s consist of quadrilateral faces in a grid-like layout, star-configuration where n ≠ 4 quadrilateral faces join around an interior vertex, n -gon configurations, where 2 n quadrilaterals surround an n -gon, polar configurations where a cone

APA, Harvard, Vancouver, ISO, and other styles

44

Chen, Keyu, Jufu Guo, Weijun Wang, Bo Lei, Hui Huang, and Lijing Luo. "A Similar Feature Point Matching Method for Aerial Electric Power Tower Images Based on a One-Ring Neighborhood of Vertices." Science and Technology for Energy Transition, November 14, 2024. http://dx.doi.org/10.2516/stet/2024099.

Full text

Abstract:

Due to the susceptibility of images to various factors such as scale changes, imaging conditions, and image noise, traditional feature point matching methods are difficult to achieve ideal matching accuracy, leading to many challenges in the automatic analysis and processing of power tower images. To improve the matching accuracy of similar feature points in aerial images of electric power tower, this study proposes a method for matching similar feature points in aerial images of electric power tower based on a vertex ring neighborhood, addressing the problem of large matching errors caused by

APA, Harvard, Vancouver, ISO, and other styles

45

Aggarwal, Amol, Alexei Borodin, and Michael Wheeler. "Deformed Polynuclear Growth in (1+1) Dimensions." International Mathematics Research Notices, February 15, 2022. http://dx.doi.org/10.1093/imrn/rnac029.

Full text

Abstract:

Abstract We introduce and study a one parameter deformation of the polynuclear growth (PNG) in (1+1)-dimensions, which we call the $t$-PNG model. It is defined by requiring that, when two expanding islands merge, with probability $t$ they sprout another island on top of the merging location. At $t=0$, this becomes the standard (non-deformed) PNG model that, in the droplet geometry, can be reformulated through longest increasing subsequences of uniformly random permutations or through an algorithm known as patience sorting. In terms of the latter, the $t$-PNG model allows errors to occur in the

APA, Harvard, Vancouver, ISO, and other styles

46

Peter, Grennsol. "New layered air-stable topological crystalline insulator candidate developed by scientists." September 7, 2022. https://doi.org/10.5281/zenodo.7056701.

Full text

Abstract:

Investigating novel topological materials and related stage changes has been a focal examination subject in dense matter physical science and materials science. Topological materials with nontrivial against band intersections stand out enough to be noticed. Hourglass fermion surface state, situated at the vertex in the neck of an hourglass-like scattering, empowers investigation of surprising topological stages, for example, the hourglass Weyl point, development along high balance lines, and hourglass nodal chains or net. By presenting nonsymmorphic balance saved interlayer couplings, the hour

APA, Harvard, Vancouver, ISO, and other styles

47

"Priam-Vertex merger." Microprocessors and Microsystems 9, no. 2 (1985): 99. http://dx.doi.org/10.1016/0141-9331(85)90462-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Kanade, Varun, Frederik Mallmann-Trenn, and Thomas Sauerwald. "On coalescence time in graphs–When is coalescing as fast as meeting?" ACM Transactions on Algorithms, January 17, 2023. http://dx.doi.org/10.1145/3576900.

Full text

Abstract:

Coalescing random walks is a fundamental distributed process, where a set of particles perform independent discrete-time random walks on an undirected graph. Whenever two or more particles meet at a given node, they merge and continue as a single random walk. The coalescence time is defined as the expected time until only one particle remains, starting from one particle at every node. Despite recent progress such as by Cooper et al. [14] and Cooper et al. [19], the coalescence time for graphs such as binary trees, d -dimensional tori, hypercubes and more generally, vertex-transitive graphs, re

APA, Harvard, Vancouver, ISO, and other styles

49

"Verder merges Packo and JEC brands." Pump Industry Analyst 2020, no. 10 (2020): 2. http://dx.doi.org/10.1016/s1359-6128(20)30276-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Forghani, A., S. Kazemi, and D. Bruce. "A Machine-Learning Approach to Generalisation of GIS Data." International Journal of Geoinformatics, April 1, 2021, 41–59. http://dx.doi.org/10.52939/ijg.v17i2.1757.

Full text

Abstract:

The automation of map generalisation in this study involves an expert system approach that consists of four main components including knowledge acquisition, an inference engine, knowledge representation and a user interface. The acquired knowledge was then utilised to build a knowledge-based solution: a ‘Generalisation Expert System’ (GES) developed in Java, Python and C programming environments for the delivery of generalised geographical features. Its capabilities are demonstrated in a case study through generalising several line and polyline databases over the study area in Canberra, Austra

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!