Log in

Relevant bibliographies by topics / Triangular mesh / Journal articles

To see the other types of publications on this topic, follow the link: Triangular mesh.

Journal articles on the topic 'Triangular mesh'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 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 'Triangular mesh.'

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

Bai, Xiao Liang, Shu Sheng Zhang, Yuan Kui Ma, and Kai Xing Zhang. "Sphere Image Representation of Triangular Mesh and its Application." Advanced Materials Research 139-141 (October 2010): 1158–63. http://dx.doi.org/10.4028/www.scientific.net/amr.139-141.1158.

Full text

Abstract:

Image processing algorithms are based on the idea that all pixels of it ranked over the orderly rows, which make the algorithms easier to be implemented. Extending image processing algorithms to triangular mesh is always an important idea for triangular mesh processing. But since the topology of a triangular mesh is not as simple as an image, triangular mesh processing is relatively difficult. This paper presented a new sphere image representation of a triangular mesh, which is an image as well as a graphic, and based on it, image processing algorithms can be easily extended to a triangular me

APA, Harvard, Vancouver, ISO, and other styles

2

Perumal, Logah. "A New Triangular Mesh Generation Technique." International Journal of Machine Learning and Computing 9, no. 5 (2019): 644–49. http://dx.doi.org/10.18178/ijmlc.2019.9.5.852.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

RAMASWAMI, SUNEETA, MARCELO SIQUEIRA, TESSA SUNDARAM, JEAN GALLIER, and JAMES GEE. "CONSTRAINED QUADRILATERAL MESHES OF BOUNDED SIZE." International Journal of Computational Geometry & Applications 15, no. 01 (2005): 55–98. http://dx.doi.org/10.1142/s0218195905001609.

Full text

Abstract:

We introduce a new algorithm to convert triangular meshes of polygonal regions, with or without holes, into strictly convex quadrilateral meshes of small bounded size. Our algorithm includes all vertices of the triangular mesh in the quadrilateral mesh, but may add extra vertices (called Steiner points). We show that if the input triangular mesh has t triangles, our algorithm produces a mesh with at most [Formula: see text] quadrilaterals by adding at most t+2 Steiner points, one of which may be placed outside the triangular mesh domain. We also describe an extension of our algorithm to conver

APA, Harvard, Vancouver, ISO, and other styles

4

Erlebacher, Gordon, and Peter R. Eiseman. "Adaptive triangular mesh generation." AIAA Journal 25, no. 10 (1987): 1356–64. http://dx.doi.org/10.2514/3.9790.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Liu, Huai Hui. "An Improved Refinement Algorithm of Triangular Mesh Subdivision Based on Minimum Weight Theory." Applied Mechanics and Materials 513-517 (February 2014): 2552–55. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.2552.

Full text

Abstract:

The triangular mesh subdivision to any planar field has been widely adopted in such applicable fields as configurable engineer, computer graphics, and scientific computation visualization and so on because of its well approach to the borderline. Thus, developing and researching on one certain effective and reliable triangular mesh subdivision algorithm has important theoretical and practical meanings. This paper firstly describes a refined algorithm about triangular mesh based on geometrical multi-grid method, and discusses its advantages and disadvantages. Secondly a new refined algorithm abo

APA, Harvard, Vancouver, ISO, and other styles

6

Gao, Mengran, Ningjun Ruan, Junpeng Shi, and Wanli Zhou. "Deep Neural Network for 3D Shape Classification Based on Mesh Feature." Sensors 22, no. 18 (2022): 7040. http://dx.doi.org/10.3390/s22187040.

Full text

Abstract:

Virtual reality, driverless cars, and robotics all make extensive use of 3D shape classification. One of the most popular ways to represent 3D data is with polygonal meshes. In particular, triangular mesh is frequently employed. A triangular mesh has more features than 3D data formats such as voxels, multi-views, and point clouds. The current challenge is to fully utilize and extract useful information from mesh data. In this paper, a 3D shape classification network based on triangular mesh and graph convolutional neural networks was suggested. The triangular face of this model was viewed as a

APA, Harvard, Vancouver, ISO, and other styles

7

Dong, Chen-shi, and Guo-zhao Wang. "Curvatures estimation on triangular mesh." Journal of Zhejiang University-SCIENCE A 6, S1 (2005): 128–36. http://dx.doi.org/10.1631/jzus.2005.as0128.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Pourazady, M., and M. Radhakrishnan. "Optimization of a triangular mesh." Computers & Structures 40, no. 3 (1991): 795–804. http://dx.doi.org/10.1016/0045-7949(91)90246-i.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

C. J. Deeni, D. A. Xavier. "Preclusion for Radix Triangular Mesh." Mapana - Journal of Sciences 12, no. 3 (2013): 39–48. http://dx.doi.org/10.12723/mjs.26.9.

Full text

Abstract:

In this paper we find the values of mp(T n ) and mp 1 (T n ) when n(n+1)≡0 (mod 4). Every minimum matching preclusion set in an n-triangular mesh network is trivial. Also, mp(G) ≤ δ(G), where δ(G) is the minimum degree of G and mp 1 (G) ≤ v e (G).

APA, Harvard, Vancouver, ISO, and other styles

10

Hongwei, Lin, Wang Guojin, Liu Ligang, and Bao Hujun. "Parameterization for fitting triangular mesh." Progress in Natural Science 16, no. 11 (2006): 1214–21. http://dx.doi.org/10.1080/10020070612330132.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Borouchaki, Houman, and Pascal J. Frey. "Adaptive triangular-quadrilateral mesh generation." International Journal for Numerical Methods in Engineering 41, no. 5 (1998): 915–34. http://dx.doi.org/10.1002/(sici)1097-0207(19980315)41:5<915::aid-nme318>3.0.co;2-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

McLaurin, David, David Marcum, Mike Remotigue, and Eric Blades. "Repairing unstructured triangular mesh intersections." International Journal for Numerical Methods in Engineering 93, no. 3 (2012): 266–75. http://dx.doi.org/10.1002/nme.4385.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Li, Lin Sheng, Chang Jun Qiu, and Lan Li. "An Integration Scheme of Extended Finite Element Method." Applied Mechanics and Materials 148-149 (December 2011): 286–90. http://dx.doi.org/10.4028/www.scientific.net/amm.148-149.286.

Full text

Abstract:

A simple integration scheme is presented for numerical integration in the extended finite element method(XFEM). In this scheme, the integral domain of common triangular mesh is converted to that of standard triangular mesh and the integral domain of standard triangular mesh is converted to that of quadrilateral mesh. By this transformation of integral domain, the strength intensity factors for straight crack are worked out. Finally, the accuracy of this method is analyzed by a typical example. It is concluded that the results obtained by new integral scheme are more accurate and simple than co

APA, Harvard, Vancouver, ISO, and other styles

14

Gustafsson, Tom. "simple technique for unstructured mesh generation via adaptive finite elements." Rakenteiden Mekaniikka 54, no. 2 (2021): 69–79. http://dx.doi.org/10.23998/rm.99648.

Full text

Abstract:

This work describes a concise algorithm for the generation of triangular meshes with the help of standard adaptive finite element methods. We demonstrate that a generic adaptive finite element solver can be repurposed into a triangular mesh generator if a robust mesh smoothing algorithm is applied between the mesh refinement steps. We present an implementation of the mesh generator and demonstrate the resulting meshes via examples.

APA, Harvard, Vancouver, ISO, and other styles

15

Date, Hiroaki, Satoshi Kanai, Takeshi Kishinami, Ichiro Nishigaki, and Takayuki Dohi. "High-Quality and Property Controlled Finite Element Mesh Generation From Triangular Meshes using the Multiresolution Technique." Journal of Computing and Information Science in Engineering 5, no. 4 (2005): 266–76. http://dx.doi.org/10.1115/1.2052847.

Full text

Abstract:

In this paper, we propose a new triangular finite element mesh generation scheme from various kinds of triangular meshes using the multiresolution technique. The proposed scheme consists of two methods: a mesh quality improvement method and a mesh property control method. The basic strategy of these methods is a combination of the mesh subdivision and simplification. Given mesh is first subdivided to obtain enough degree of freedom for a property change, then by simplification using edge collapse for the resulting mesh to change the mesh properties, we can easily improve and control the mesh p

APA, Harvard, Vancouver, ISO, and other styles

16

Zheng, Wenhui, Haiyun Wang, and Xiaofang Huang. "Study on Delaunay Triangular Mesh Delineation for Complex Terrain Based on the Improved Center of Gravity Interpolation Method." Applied Sciences 14, no. 4 (2024): 1370. http://dx.doi.org/10.3390/app14041370.

Full text

Abstract:

Wind energy resources in complex terrain are abundant. However, the default mesh division of various terrains often needs more specificity, particularly in wind resource analysis. The mesh division method can diminish computational efficiency and quality in intricate topographical conditions. This article presents a combined algorithm for generating Delaunay triangular meshes in mountainous terrains with significant variations in terrain. The algorithm considers the uncertainty of inner nodes and mesh quality, addressing both the advantages and drawbacks of the Delaunay triangular mesh. The pr

APA, Harvard, Vancouver, ISO, and other styles

17

Md. Masum Murshed, Md. Morshed Bin Shiraj, Md. Safik Ullah, Md. Mizanur Rahman, and Md. Manik Hossain. "On the Approximation of the Bay of Bengal Domain to be Compatible for the Implementation of Finite Element Method." World Journal of Advanced Engineering Technology and Sciences 9, no. 1 (2023): 290–95. http://dx.doi.org/10.30574/wjaets.2023.9.1.0170.

Full text

Abstract:

In this study, the Bay of Bengal domain has been approximated using triangular mesh so that the finite element method (FEM) can be employed on it. The area between 15º N and 23º N Latitudes and 85º E and 95º E Longitudes is considered as the physical domain. A MATLAB routine and the cubic spline interpolation have been used to extract the coordinates of the points on the boundary of the whole domain and the points on the boundary of the islands from a colour image of the domain. A C++ routine is used to generate an edp file for triangular mesh using the extracted coordinates. Then FreeFem++ is

APA, Harvard, Vancouver, ISO, and other styles

18

Ha, Yujin, Jung-Ho Park, and Seung-Hyun Yoon. "Geodesic Hermite Spline Curve on Triangular Meshes." Symmetry 13, no. 10 (2021): 1936. http://dx.doi.org/10.3390/sym13101936.

Full text

Abstract:

Curves on a polygonal mesh are quite useful for geometric modeling and processing such as mesh-cutting and segmentation. In this paper, an effective method for constructing C1 piecewise cubic curves on a triangular mesh M while interpolating the given mesh points is presented. The conventional Hermite interpolation method is extended such that the generated curve lies on M. For this, a geodesic vector is defined as a straightest geodesic with symmetric property on edge intersections and mesh vertices, and the related geodesic operations between points and vectors on M are defined. By combining

APA, Harvard, Vancouver, ISO, and other styles

19

Zhao, Zheng-Yu, Qing Fang, Wenqing Ouyang, Zheng Zhang, Ligang Liu, and Xiao-Ming Fu. "Developability-driven piecewise approximations for triangular meshes." ACM Transactions on Graphics 41, no. 4 (2022): 1–13. http://dx.doi.org/10.1145/3528223.3530117.

Full text

Abstract:

We propose a novel method to compute a piecewise mesh with a few developable patches and a small approximation error for an input triangular mesh. Our key observation is that a deformed mesh after enforcing discrete developability is easily partitioned into nearly developable patches. To obtain the nearly developable mesh, we present a new edge-oriented notion of discrete developability to define a developability-encouraged deformation energy, which is further optimized by the block nonlinear Gauss-Seidel method. The key to successfully applying this optimizer is three types of auxiliary varia

APA, Harvard, Vancouver, ISO, and other styles

20

LI, Qimin. "Triangular Mesh Segmentation Based Geometry Image." Chinese Journal of Mechanical Engineering 44, no. 05 (2008): 208. http://dx.doi.org/10.3901/jme.2008.05.208.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Bryant, C. "Two dimensional automatic triangular mesh generation." IEEE Transactions on Magnetics 21, no. 6 (1985): 2547–50. http://dx.doi.org/10.1109/tmag.1985.1064213.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Hrádek, Jan, Martin Kuchař, and Václav Skala. "Hash functions and triangular mesh reconstruction." Computers & Geosciences 29, no. 6 (2003): 741–51. http://dx.doi.org/10.1016/s0098-3004(03)00037-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Dudon, M., O. Avaro, and C. Roux. "Triangular active mesh for motion estimation." Signal Processing: Image Communication 10, no. 1-3 (1997): 21–41. http://dx.doi.org/10.1016/s0923-5965(97)00017-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Papageorgiou, Alexandros, and Nikos Platis. "Triangular mesh simplification on the GPU." Visual Computer 31, no. 2 (2014): 235–44. http://dx.doi.org/10.1007/s00371-014-1039-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Kim, Su-Jin, and Min-Yang Yang. "Triangular mesh offset for generalized cutter." Computer-Aided Design 37, no. 10 (2005): 999–1014. http://dx.doi.org/10.1016/j.cad.2004.10.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Ruiz, Oscar E., Daniel Mejia, and Carlos A. Cadavid. "Triangular mesh parameterization with trimmed surfaces." International Journal on Interactive Design and Manufacturing (IJIDeM) 9, no. 4 (2015): 303–16. http://dx.doi.org/10.1007/s12008-015-0276-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Date, Hiroaki, and Masahiko Onosato. "Triangular Mesh Deformation based on Dimensions." Computer-Aided Design and Applications 5, no. 1-4 (2008): 287–95. http://dx.doi.org/10.3722/cadaps.2008.287-295.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Chan, Hei Long, Ho Yeung Hung, and Lok Ming Lui. "Hooke’s Optimization for 3D triangular mesh." Geometry, Imaging and Computing 2, no. 2 (2015): 109–31. http://dx.doi.org/10.4310/gic.2015.v2.n2.a2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Wang, Yimin, and Jianmin Zheng. "Tubular triangular mesh parameterization and applications." Computer Animation and Virtual Worlds 21, no. 2 (2010): 91–102. http://dx.doi.org/10.1002/cav.325.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Nahara, Syeda Sabikun, Md Sadekur Rahman, and Md Shajedul Karim. "Auto Mesh generation algorithm for the convex domain with the triangular elements." GANIT: Journal of Bangladesh Mathematical Society 43, no. 1 (2023): 017–35. http://dx.doi.org/10.3329/ganit.v43i1.67856.

Full text

Abstract:

Mesh creation is one of the primary tasks in implementing the Finite Element Method (FEM) to solve two- and three-dimensional boundary value problems. However, the whole procedure becomes tedious and problematic when higher-order finite elements are employed to construct mesh and prepare corresponding element data. In this study, we strive to develop a versatile algorithm for discretizing the two-dimensional domain using linear, quadratic, and cubic triangular finite elements. The algorithm is developed based on n vertices (actual or more in number) that constitute the boundary of the domain,

APA, Harvard, Vancouver, ISO, and other styles

31

Jang, Yeonggul, Dong Hwan Kim, Byunghwan Jeon, Dongjin Han, Hackjoon Shim, and Hyuk-jae Chang. "Generation of Triangular Mesh of Coronary Artery Using Mesh Merging." Journal of KIISE 43, no. 4 (2016): 419–29. http://dx.doi.org/10.5626/jok.2016.43.4.419.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Yang, Daoshan Ou, and Hsi-Yung Feng. "Machining Triangular Mesh Surfaces via Mesh Offset Based Tool Paths." Computer-Aided Design and Applications 5, no. 1-4 (2008): 254–65. http://dx.doi.org/10.3722/cadaps.2008.254-265.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Yang, Caiyun, Yutaka Ohtake, and Hiromasa Suzuki. "Sealed Decomposition of a Triangular Mesh with Tetrahedral Mesh Segmentation." Computer-Aided Design and Applications 8, no. 3 (2011): 421–33. http://dx.doi.org/10.3722/cadaps.2011.421-433.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Chen, Hung-Kuang. "Evaluation of triangular mesh layout techniques using large mesh simplification." Multimedia Tools and Applications 76, no. 23 (2017): 25391–419. http://dx.doi.org/10.1007/s11042-017-4607-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Zhang, Xiao Qing, Miao Le Hou, Guang Zhu, and Yun Gang Hu. "Calculation of Areas of Cultural Relics Surface Defects Based on the Triangular Mesh Model." Advanced Materials Research 446-449 (January 2012): 3452–56. http://dx.doi.org/10.4028/www.scientific.net/amr.446-449.3452.

Full text

Abstract:

In order to solve the problem that need exact and scientific data in checking and restoring cultural relics, this paper presents a novel algorithm that statistics defect areas of cultural relics by calculating holes area in the in triangular mesh models.First, build the topological relationship between triangles, vertices and edges and extract boundary using boundary property of triangular mesh. Next, the holes bounding edges are linked in sequence into holes polygon. Finally, distinguish holes boundary and model exterior boundary by means of triangular mesh topological characteristics and the

APA, Harvard, Vancouver, ISO, and other styles

36

Chen, Guojun, and Rongji Wang. "Triangular Mesh Surface Subdivision Based on Graph Neural Network." Applied Sciences 14, no. 23 (2024): 11378. https://doi.org/10.3390/app142311378.

Full text

Abstract:

Mesh subdivision is a common mesh-processing algorithm used to improve model accuracy and surface smoothness. Its classical scheme adopts a fixed linear vertex update strategy and is implemented iteratively, which often results in excessive mesh smoothness. In recent years, a nonlinear subdivision method that uses neural network methods, called neural subdivision (NS), has been proposed. However, as a new scheme, its application scope and the effect of its algorithm need to be improved. To solve the above problems, a graph neural network method based on neural subdivision was used to realize m

APA, Harvard, Vancouver, ISO, and other styles

37

Wang, Hua Bing, Wei Jun Liu, and Hong You Bian. "Locally Adjusting Operation on Concave Vertexes of Planar Polygon." Advanced Materials Research 476-478 (February 2012): 1867–72. http://dx.doi.org/10.4028/www.scientific.net/amr.476-478.1867.

Full text

Abstract:

Triangular mesh is one of the widely used digital representation modes in CAD and CAM. And the offset operation of planar polygon takes an important role in path planning of layer milling complicated surfaces represented by triangular mesh. A vertex classification based adjusting method is presented. It improves the performance of edge isometry based offset algorithm.

APA, Harvard, Vancouver, ISO, and other styles

38

Zhao, Feiyu. "A Novel Computational Paradigm for Reconstructing Solid CAD Features from a Segmented Manifold Triangular Mesh." Applied Sciences 14, no. 14 (2024): 6183. http://dx.doi.org/10.3390/app14146183.

Full text

Abstract:

We introduce a novel computational paradigm for reconstructing solid computer-aided design (CAD) features from the surface of a segmented manifold triangular mesh. This paradigm addresses the challenge of capturing high-level design semantics for manifold triangular meshes and facilitates parametric and variational design capabilities. We categorize four prevalent features, namely extrusion, rotation, sweep, and loft, as generalized swept bodies driven by cross-sectional sketches and feature paths, providing a unified mathematical representation for various feature types. The numerical optimiz

APA, Harvard, Vancouver, ISO, and other styles

39

Huo, Yu, Tongcai Wang, Haochen Li, et al. "Delaunay Mesh Construction and Simplification with Feature Preserving Based on Minimal Volume Destruction." Applied Sciences 12, no. 4 (2022): 1831. http://dx.doi.org/10.3390/app12041831.

Full text

Abstract:

Triangular meshes play critical roles in many applications, such as numerical simulation and additive manufacturing. However, the triangular meshes transformed from computer-aided design models using common algorithms may have many undesirable narrow triangles, which tends to affect the downstream applications. In this paper, we proposed two algorithms for Delaunay mesh construction and simplification to improve the quality of the triangular meshes. Two improved mesh operations of inserting vertices and collapsing vertices based on the principle of minimum volume destruction were designed. The

APA, Harvard, Vancouver, ISO, and other styles

40

Shin, Min-Chul, Hae-Do Hwang, Seung-Hyun Yoon, and Jieun Lee. "Parametric Blending of Triangular Meshes." Symmetry 10, no. 11 (2018): 620. http://dx.doi.org/10.3390/sym10110620.

Full text

Abstract:

We present a new method for constructing a parametric blending surface that smoothly connects two triangular meshes. A user selects a subregion on each triangular mesh. The local parameterizations of two selected regions are found by using geodesic polar coordinates, and a base surface on each triangular mesh is constructed by two boundary curves on parametric domain. Finally, two base surfaces are smoothly blended for generating a blending surface. The shape of a blending surface can easily be controlled by several shape parameters or by directly manipulating surface point. We demonstrate the

APA, Harvard, Vancouver, ISO, and other styles

41

Tian, Zhong Ke. "STL Representation of Axisymmetric Solid Element Mesh." Applied Mechanics and Materials 251 (December 2012): 235–38. http://dx.doi.org/10.4028/www.scientific.net/amm.251.235.

Full text

Abstract:

This paper develops an algorithm for extracting stereolithography (STL) model from axisymmetric solid finite element (FE) mesh, so as to use 3D physical prototype instead of computer graphics-based visualization to express the deformation result of FE simulation. The key of the algorithm is to recognize contour node pairs from an axisymmetric solid element mesh, which exactly demonstrates that the proposed methodology is independent of axisymmetric element configuration, that is to say, it is applicable for either triangular, quadrilateral, or mixed triangular and quadrilateral axisymmetric so

APA, Harvard, Vancouver, ISO, and other styles

42

BERZINS, MARTIN. "SOLUTION-BASED MESH QUALITY INDICATORS FOR TRIANGULAR AND TETRAHEDRAL MESHES." International Journal of Computational Geometry & Applications 10, no. 03 (2000): 333–46. http://dx.doi.org/10.1142/s021819590000019x.

Full text

Abstract:

A new mesh quality measure for triangular and tetrahedral meshes is presented. This mesh quality measure is based both on geometrical and solution information and is derived by considering the error when linear triangular and tetrahedral elements are used to approximate a quadratic function. The new measure is shown to be related to existing measures of mesh quality but with the advantage that local solution information in the form of scaled derivatives along edges is taken into account. This advantage is demonstrated by a comparison with a geometrical indicator on a parameterized problem.

APA, Harvard, Vancouver, ISO, and other styles

43

Yigit Akargun, Hayri, and Cuneyt Sert. "Least-squares finite element solution of Euler equations with H-type mesh refinement and coarsening on triangular elements." International Journal of Numerical Methods for Heat & Fluid Flow 24, no. 7 (2014): 1487–503. http://dx.doi.org/10.1108/hff-01-2013-0006.

Full text

Abstract:

Purpose – The purpose of this paper is to demonstrate successful use of least-squares finite element method (LSFEM) with h-type mesh refinement and coarsening for the solution of two-dimensional, inviscid, compressible flows. Design/methodology/approach – Unsteady Euler equations are discretized on meshes of linear and quadratic triangular and quadrilateral elements using LSFEM. Backward Euler scheme is used for time discretization. For the refinement of linear triangular elements, a modified version of the simple bisection algorithm is used. Mesh coarsening is performed with the edge collapsi

APA, Harvard, Vancouver, ISO, and other styles

44

Kwon, Kiyoun, and Duhwan Mun. "A Method to Minimize the Data Size of a Lightweight Model for Ship and Offshore Plant Structure Using Part Characteristics." Journal of Marine Science and Engineering 8, no. 10 (2020): 763. http://dx.doi.org/10.3390/jmse8100763.

Full text

Abstract:

One of the most widely used methods for representing the shapes of ships and offshore plants is triangular mesh, which has a simple structure and is easy to visualize. In particular, lightweight models composed of triangular meshes are often used as a sharing medium for three-dimensional (3D) shape design results in the collaboration process among many stakeholders participating in the construction process. Currently, there are demands for visualizing the total shapes of ships or offshore plants for design review, interference check, construction monitoring, and securing maintenance space. How

APA, Harvard, Vancouver, ISO, and other styles

45

Sugalski, Karol, and Tomáš Skrúcaný. "Grid Type Impact on the Results of the Volume of Fluid Method in the Free Surface Flow Calculations Around Ship Hull." New Trends in Production Engineering 1, no. 1 (2018): 151–57. http://dx.doi.org/10.2478/ntpe-2018-0019.

Full text

Abstract:

Abstract This article presents results of the free surface flow around ship hull on two different types of computational grid. Each type of mentioned grid has its own advantages and disadvantages in particular cases, mostly in one phase simulation. Omitting cases with capitation, there is no free surface involved in one phase simulation. Multiphase simulations are crucial in the ship design process and optimization. Recreating free surface on the triangular mesh causes difficulties, in contrast to the hexahedral meshes, where calculated surface is more aligned to the physical border of the flu

APA, Harvard, Vancouver, ISO, and other styles

46

LI, Wei, Wen-biao JIN, and Xian-qian XIAO. "Local-global algorithm for triangular mesh optimization." Journal of Computer Applications 31, no. 4 (2011): 1013–15. http://dx.doi.org/10.3724/sp.j.1087.2011.01013.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Qian, Xue Ming, Yan Cao, and Xiao Ping Lin. "Triangular Mesh Simplification Based on Bounded Error." Advanced Materials Research 411 (November 2011): 77–82. http://dx.doi.org/10.4028/www.scientific.net/amr.411.77.

Full text

Abstract:

The author proposed a triangular mesh simplification algorithm with the methodology of vertex culling, which is based on bounded error. The algorithm includes several steps as follow. Firstly, the algorithm arrays the vertex according to the curvature. The curvature of local area around one vertex reduces in the array. Secondly, for one vertex to be deleted, the bounding box’s height of the local area will be calculated. And the reduction of the bounding box’s height is controlled as restraint of vertex culling. After the vertex culling, triangular mesh reconstruction is conducted on polygon t

APA, Harvard, Vancouver, ISO, and other styles

48

Chen, Yihang, Zening Cao, Jinxin Wang, Yan Shi, and Zilong Qin. "Encoding Conversion Algorithm of Quaternary Triangular Mesh." ISPRS International Journal of Geo-Information 11, no. 1 (2021): 33. http://dx.doi.org/10.3390/ijgi11010033.

Full text

Abstract:

In the process of global information construction, different fields have built their own discrete global grid systems (DGGS). With the development of big data technology, data exchange, integration, and update have gradually become a trend, as well as the associative integration of different DGGS. Due to the heterogeneity of DGGS and the different encoding rules, how to build the encoding conversion rules and data mapping relationship between the same object in various DGGS is an effective support and key technology to achieve the interoperability of DGGS. As a kind of multipurpose DGGS, the q

APA, Harvard, Vancouver, ISO, and other styles

49

Gan, Wen Feng, Hong Yao Shen, Zhi Wei Lin, Zhi Yu Chen, and Jian Zhong Fu. "Modeling Cutter Engagement Region for Triangular Mesh." Advanced Materials Research 819 (September 2013): 55–58. http://dx.doi.org/10.4028/www.scientific.net/amr.819.55.

Full text

Abstract:

Cutter Engagement Region (CER) is the part of tool that contacts with stock, where a series of energy exchange and material transportation take place. A full understanding of its shape and area is indispensible for cutting force calibration, chatter analysis, and tool wear prevention. It can provide a criterion for efficient tool-path planning as well. In literature, however, there is no available modeling of CER. We hereby propose a modeling method for ball-end tool with design surface represented in triangular mesh. First, design surface is offset to form a stock surface. Next, compute the i

APA, Harvard, Vancouver, ISO, and other styles

50

Nga, L. T. T., N. T. Khoi, and N. T. Thuy. "Reconstructing B-patch surface from triangular mesh." EAI Endorsed Transactions on Industrial Networks and Intelligent Systems 4, no. 12 (2018): 153547. http://dx.doi.org/10.4108/eai.10-1-2018.153547.

Full text

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!