Log in

Relevant bibliographies by topics / Mesh data / Journal articles

Journal articles on the topic 'Mesh data'

To see the other types of publications on this topic, follow the link: Mesh data.

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

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 'Mesh data.'

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

Hyeon, Dae-Hwan, and Taeg-Keun WhangBo. "Noise reduction for mesh smoothing of 3D mesh data." International Journal of Contents 5, no. 4 (December 28, 2009): 1–6. http://dx.doi.org/10.5392/ijoc.2009.5.4.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Journeaux, Antoine Alexandre, Frederic Bouillault, and Jean Yves Roger. "Reducing the Cost of Mesh-to-Mesh Data Transfer." IEEE Transactions on Magnetics 50, no. 2 (February 2014): 437–40. http://dx.doi.org/10.1109/tmag.2013.2281461.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Garimella, Rao V. "Mesh data structure selection for mesh generation and FEA applications." International Journal for Numerical Methods in Engineering 55, no. 4 (2002): 451–78. http://dx.doi.org/10.1002/nme.509.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Kim, D., A. Bolat, and K. J. Li. "INDOOR SPATIAL DATA CONSTRUCTION FROM TRIANGLE MESH." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLII-4/W8 (July 11, 2018): 101–8. http://dx.doi.org/10.5194/isprs-archives-xlii-4-w8-101-2018.

Full text

Abstract:

<p><strong>Abstract.</strong> The 3D triangle mesh is widely used to represent indoor space. One of widely used methods of generating 3D triangle mesh data of indoor space is the construction from the point cloud collected using LIDAR. However, there are many problems in using generated triangle mesh data as a geometric representation of the indoor space. First, the number of triangles forming the triangle mesh is very large, which results in a bottleneck of the performance for storage and management. Second, no consideration on the properties of indoor space has been done by the previous work on mesh simplification for indoor geometric representation. Third, there is no research to construct indoor spatial standard data from triangle mesh data. For resolving these problems, we propose the a method for generating triangular mesh data for indoor geometric representation based in the observations mentioned above. First this method removes unnecessary objects and reduces the number of surfaces from the original fine-grained triangular mesh data using the properties of indoor space. Second, it also produces indoor geometric data in IndoorGML &ndash; an OGC standard for indoor spatial data model. In experimental studies, we present a case study of indoor triangle mesh data from real world and compare results with raw data.</p>

APA, Harvard, Vancouver, ISO, and other styles

5

Bronsart, Robert. "Automatic Pre-Mesh CAD Data Repairing." International Journal of Mechanical Engineering and Applications 1, no. 1 (2013): 1. http://dx.doi.org/10.11648/j.ijmea.20130101.11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Young, P. G., D. Raymont, and V. Bui Xuan. "Mesh generation from biomedical scan data." Computer Methods in Biomechanics and Biomedical Engineering 12, sup1 (August 2009): 261. http://dx.doi.org/10.1080/10255840903097947.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Wang, Jun, Jin Huang, Fu Lee Wang, Mingqiang Wei, Haoran Xie, and Jing Qin. "Data-driven Geometry-recovering Mesh Denoising." Computer-Aided Design 114 (September 2019): 133–42. http://dx.doi.org/10.1016/j.cad.2019.05.027.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Gao, Yicong, Zixian Zhang, Yixiong Feng, Maria Savchenko, Ichiro Hagiwara, and Hao Zheng. "Flexible mesh morphing in sustainable design using data mining and mesh subdivision." Future Generation Computer Systems 108 (July 2020): 987–94. http://dx.doi.org/10.1016/j.future.2017.11.031.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Meyer, Quirin, Benjamin Keinert, Gerd Sußner, and Marc Stamminger. "Data-Parallel Decompression of Triangle Mesh Topology." Computer Graphics Forum 31, no. 8 (October 4, 2012): 2541–53. http://dx.doi.org/10.1111/j.1467-8659.2012.03221.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Fang, F., M. D. Piggott, C. C. Pain, G. J. Gorman, and A. J. H. Goddard. "An adaptive mesh adjoint data assimilation method." Ocean Modelling 15, no. 1-2 (January 2006): 39–55. http://dx.doi.org/10.1016/j.ocemod.2006.02.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

BEALL, MARK W., and MARK S. SHEPHARD. "A GENERAL TOPOLOGY-BASED MESH DATA STRUCTURE." International Journal for Numerical Methods in Engineering 40, no. 9 (May 15, 1997): 1573–96. http://dx.doi.org/10.1002/(sici)1097-0207(19970515)40:9<1573::aid-nme128>3.0.co;2-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Ibanez, Dan, and Mark S. Shephard. "Modifiable Array Data Structures for Mesh Topology." SIAM Journal on Scientific Computing 39, no. 2 (January 2017): C144—C161. http://dx.doi.org/10.1137/16m1063496.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Nkwe, Thabo K. R., Mieso K. Denko, and Jason Ernst. "Data ubiquity in autonomic wireless mesh networks." Journal of Ambient Intelligence and Humanized Computing 1, no. 1 (December 4, 2009): 3–13. http://dx.doi.org/10.1007/s12652-009-0001-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Singh, Rajinder, and Er Nidhi Bhalla. "Path Mechanism to reduce packet data loss in Wireless Mesh Networks." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 2, no. 3 (June 30, 2012): 134–41. http://dx.doi.org/10.24297/ijct.v2i3c.6779.

Full text

Abstract:

A wireless mesh network (WMN) is a communicationnetwork made up of radio nodes organized in a meshtopology. Wireless mesh network often consists of meshclients, mesh routers and gateways. A wireless Mesh networkuses multi-hop communication. Due to multi-hop architectureand wireless nature, Mesh networks are vulnerable to varioustypes of Denial of Services attack. It suffers from Packetdropping at Routing layer. Client nodes are unable to getservices from gateway nodes, hence network gets down. ThePaper emphasis on the developing of a path protocol when theminimun possible packet dropp occurs in wireless meshnetworks. Due to packet droping occurrences the networkperformance degrades. In the work, we have evaluated thePerformance of WMN under packet dropping on the basis oftheir throughput and Data packet loss.

APA, Harvard, Vancouver, ISO, and other styles

15

Zhang, Bo, Kim Wann Engebretsen, Gianluca Fiandaca, Hongzhu Cai, and Esben Auken. "3D inversion of time-domain electromagnetic data using finite elements and a triple mesh formulation." GEOPHYSICS 86, no. 3 (May 1, 2021): E257—E267. http://dx.doi.org/10.1190/geo2020-0079.1.

Full text

Abstract:

Over several decades, much research has been done to develop 3D electromagnetic inversion algorithms. Due to the computational complexity and the memory requirements for 3D time-domain electromagnetic (TEM) inversion algorithms, many real-world surveys are inverted within one dimension. To speed up calculations and manage memory for 3D inversions of TEM data, we have developed an approach using three uncoupled meshes: an inversion mesh, a forward-model mesh, and a mesh for Jacobian calculations. The inversion mesh is a coarse regular and structured mesh, such that constraints are easily enforced between the model parameters. Forward responses are calculated on a dense unstructured mesh to obtain accurate electromagnetic fields, whereas the Jacobian is calculated on a coarse unstructured mesh. We found that using a coarse mesh for the Jacobian is sufficient for the inversion to converge and, equally important, that it provides a significant speed boost in the overall inversion process, compared to calculating it on the forward-modeling mesh. The unstructured meshes are made of tetrahedral elements, and the electromagnetic fields are calculated using the finite-element method. The inversion optimization uses a standard Gauss-Newton formulation. For further speed up and memory optimizing of the inversion, we use domain decomposition for calculating the responses for each transmitter separately and parallelize the problem over domains using OpenMP. Compared to a 1D solution, the accuracy for the Jacobian is 1%–5% for the dense mesh and 2%–7% for the coarse mesh, but the calculation time is approximately five times faster for the coarse mesh. We also examined the algorithm on a small ground-based TEM data set acquired in an area where a 3D earth distorts the electromagnetic fields to such a degree that a 1D inversion is not feasible.

APA, Harvard, Vancouver, ISO, and other styles

16

Knepley, Matthew G., and Dmitry A. Karpeev. "Mesh Algorithms for PDE with Sieve I: Mesh Distribution." Scientific Programming 17, no. 3 (2009): 215–30. http://dx.doi.org/10.1155/2009/948613.

Full text

Abstract:

We have developed a new programming framework, called Sieve, to support parallel numerical partial differential equation(s) (PDE) algorithms operating over distributed meshes. We have also developed a reference implementation of Sieve in C++ as a library of generic algorithms operating on distributed containers conforming to the Sieve interface. Sieve makes instances of the incidence relation, or arrows, the conceptual first-class objects represented in the containers. Further, generic algorithms acting on this arrow container are systematically used to provide natural geometric operations on the topology and also, through duality, on the data. Finally, coverings and duality are used to encode not only individual meshes, but all types of hierarchies underlying PDE data structures, including multigrid and mesh partitions. In order to demonstrate the usefulness of the framework, we show how the mesh partition data can be represented and manipulated using the same fundamental mechanisms used to represent meshes. We present the complete description of an algorithm to encode a mesh partition and then distribute a mesh, which is independent of the mesh dimension, element shape, or embedding. Moreover, data associated with the mesh can be similarly distributed with exactly the same algorithm. The use of a high level of abstraction within the Sieve leads to several benefits in terms of code reuse, simplicity, and extensibility. We discuss these benefits and compare our approach to other existing mesh libraries.

APA, Harvard, Vancouver, ISO, and other styles

17

Melnikov, Igor, Gleb P. Bourenkov, Olof Svensson, and Alexander N. Popov. "The analysis of the mesh scan data for macromolecular data collection." Acta Crystallographica Section A Foundations and Advances 71, a1 (August 23, 2015): s188. http://dx.doi.org/10.1107/s2053273315097223.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Aydoğdu, Ali, Alberto Carrassi, Colin T. Guider, Chris K. R. T. Jones, and Pierre Rampal. "Data assimilation using adaptive, non-conservative, moving mesh models." Nonlinear Processes in Geophysics 26, no. 3 (July 24, 2019): 175–93. http://dx.doi.org/10.5194/npg-26-175-2019.

Full text

Abstract:

Abstract. Numerical models solved on adaptive moving meshes have become increasingly prevalent in recent years. Motivating problems include the study of fluids in a Lagrangian frame and the presence of highly localized structures such as shock waves or interfaces. In the former case, Lagrangian solvers move the nodes of the mesh with the dynamical flow; in the latter, mesh resolution is increased in the proximity of the localized structure. Mesh adaptation can include remeshing, a procedure that adds or removes mesh nodes according to specific rules reflecting constraints in the numerical solver. In this case, the number of mesh nodes will change during the integration and, as a result, the dimension of the model's state vector will not be conserved. This work presents a novel approach to the formulation of ensemble data assimilation (DA) for models with this underlying computational structure. The challenge lies in the fact that remeshing entails a different state space dimension across members of the ensemble, thus impeding the usual computation of consistent ensemble-based statistics. Our methodology adds one forward and one backward mapping step before and after the ensemble Kalman filter (EnKF) analysis, respectively. This mapping takes all the ensemble members onto a fixed, uniform reference mesh where the EnKF analysis can be performed. We consider a high-resolution (HR) and a low-resolution (LR) fixed uniform reference mesh, whose resolutions are determined by the remeshing tolerances. This way the reference meshes embed the model numerical constraints and are also upper and lower uniform meshes bounding the resolutions of the individual ensemble meshes. Numerical experiments are carried out using 1-D prototypical models: Burgers and Kuramoto–Sivashinsky equations and both Eulerian and Lagrangian synthetic observations. While the HR strategy generally outperforms that of LR, their skill difference can be reduced substantially by an optimal tuning of the data assimilation parameters. The LR case is appealing in high dimensions because of its lower computational burden. Lagrangian observations are shown to be very effective in that fewer of them are able to keep the analysis error at a level comparable to the more numerous observers for the Eulerian case. This study is motivated by the development of suitable EnKF strategies for 2-D models of the sea ice that are numerically solved on a Lagrangian mesh with remeshing.

APA, Harvard, Vancouver, ISO, and other styles

19

Gardner-Stephen, Paul, Jeremy Lakeman, Romana Challans, Corey Wallis, Ariel Stulman, and Yoram Haddad. "MeshMS: Ad Hoc Data Transfer within Mesh Network." International Journal of Communications, Network and System Sciences 05, no. 08 (2012): 496–504. http://dx.doi.org/10.4236/ijcns.2012.58060.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Shimada, Kenji, and Mark Shephard. "Special Issue on Mesh-Based Geometric Data Processing." Journal of Computing and Information Science in Engineering 5, no. 4 (December 1, 2005): 265. http://dx.doi.org/10.1115/1.2123087.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

HONJO, Tsuyoshi. "Estimation of Mesh Climatic Data by Neural Network." Journal of Agricultural Meteorology 54, no. 1 (1998): 43–46. http://dx.doi.org/10.2480/agrmet.54.43.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

HIGASHI, Masatake, and Kenji YAMADA. "Smoothing of Mesh Data Using Fourth Divided Difference." Journal of the Japan Society for Precision Engineering 67, no. 5 (2001): 749–53. http://dx.doi.org/10.2493/jjspe.67.749.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Luffel, Mark, Topraj Gurung, Peter Lindstrom, and Jarek Rossignac. "Grouper: A Compact, Streamable Triangle Mesh Data Structure." IEEE Transactions on Visualization and Computer Graphics 20, no. 1 (January 2014): 84–98. http://dx.doi.org/10.1109/tvcg.2013.81.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Feng, Xin, Yuanzhen Wang, Yanlin Weng, and Yiying Tong. "Compact combinatorial maps: A volume mesh data structure." Graphical Models 75, no. 3 (May 2013): 149–56. http://dx.doi.org/10.1016/j.gmod.2012.10.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Dardenne, J., S. Valette, N. Siauve, N. Burais, and R. Prost. "Variational tetrahedral mesh generation from discrete volume data." Visual Computer 25, no. 5-7 (March 3, 2009): 401–10. http://dx.doi.org/10.1007/s00371-009-0323-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Liziér, Mario A. S., Marcelo F. Siqueira, Joel Daniels, Claudio T. Silva, and L. Gustavo Nonato. "Template-based quadrilateral mesh generation from imaging data." Visual Computer 27, no. 10 (May 19, 2011): 887–903. http://dx.doi.org/10.1007/s00371-011-0603-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Lee, B. "MeshSQL: the query language for simulation mesh data." Information Sciences 159, no. 3-4 (February 15, 2004): 177–202. http://dx.doi.org/10.1016/j.ins.2003.02.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Ha, Soyoung, Chris Snyder, William C. Skamarock, Jeffrey Anderson, and Nancy Collins. "Ensemble Kalman Filter Data Assimilation for the Model for Prediction Across Scales (MPAS)." Monthly Weather Review 145, no. 11 (November 2017): 4673–92. http://dx.doi.org/10.1175/mwr-d-17-0145.1.

Full text

Abstract:

A global atmospheric analysis and forecast system is constructed based on the atmospheric component of the Model for Prediction Across Scales (MPAS-A) and the Data Assimilation Research Testbed (DART) ensemble Kalman filter. The system is constructed using the unstructured MPAS-A Voronoi (nominally hexagonal) mesh and thus facilitates multiscale analysis and forecasting without the need for developing new covariance models at different scales. Cycling experiments with the assimilation of real observations show that the global ensemble system is robust and reliable throughout a one-month period for both quasi-uniform and variable-resolution meshes. The variable-mesh assimilation system consistently provides higher-quality analyses than those from the coarse uniform mesh, in addition to the benefits of the higher-resolution forecasts, which leads to substantial improvements in 5-day forecasts. Using the fractions skill score, the spatial scale for skillful precipitation forecasts is evaluated over the high-resolution area of the variable-resolution mesh. Skill decreases more rapidly at smaller scales, but the variable mesh consistently outperforms the coarse uniform mesh in precipitation forecasts at all times and thresholds. Use of incremental analysis updates (IAU) greatly decreases high-frequency noise overall and improves the quality of EnKF analyses, particularly in the tropics. Important aspects of the system design related to the unstructured Voronoi mesh are also investigated, including algorithms for handling the C-grid staggered horizontal velocities.

APA, Harvard, Vancouver, ISO, and other styles

29

N., Dr Bhalaji. "Reliable Data Transmission with Heightened Confidentiality and Integrity in IOT Empowered Mobile Networks." Journal of ISMAC 2, no. 2 (May 9, 2020): 106–17. http://dx.doi.org/10.36548/jismac.2020.2.004.

Full text

Abstract:

The revolution caused by the communication without wires has brought in multitudes of basic modifications in the data network and the telecommunication, making the integrated networks a reality. The further advancements in the wireless communication has enabled to set personal networks using the portable devices, and are termed as the adhoc networks. The networks formed under specific circumstances or a reason could follow any one of the topology to convey the information. W ireless mesh network is the form of such network mentioned above that organized in a mesh topology. This network formed in mesh topology contains several consumers who are arranged in the distributed manner and forward the packets in a one or more than one hop model. The protocols that help in sorting out the path for sending and receiving the information are has a vital influence over the network in mesh topology as they affect the throughput, life of established links etc. Integrating the wireless mesh topology to the internet of things has improved the way of information sharing by linking multitudes tangible things around. The mesh topology wireless networks formed using the portable devices or other –wise called as the mobile networks that are connected over internet are open to security breaches as the mesh holds few nodes that are malicious. This makes the information conveyed to be either compromised or manipulated. The article in order to ensure the reliability in the transmission of the data with the heightened confidentiality and integrity in the IOT empowered mobile networks proposes a routing strategy that is robust across the consumers in mesh, the gateway and the routers. The channels across the devices in the mesh are formed based on the efficiency of the connections for the distribution of the data. The simulation process of the proposed work using the network simulator 2 shows the performance improvement of the proposed work with respect to throughput of the network, packet loss rate, packet delivery rate, latency, energy efficiency and the computational overhead.

APA, Harvard, Vancouver, ISO, and other styles

30

Lu, Liansheng, Haifeng Jiang, Guangzhi Han, Shanshan Ma, and Renke Sun. "Multi-criteria routing metric for supporting data-differentiated service in hybrid wireless mesh networks in coal mines." International Journal of Distributed Sensor Networks 13, no. 1 (January 2017): 155014771668979. http://dx.doi.org/10.1177/1550147716689796.

Full text

Abstract:

Mesh clients in hybrid wireless mesh networks can perform the routing functionality, as well as provide end-user applications that are more suitable for tunnels, to improve the connectivity of backbone networks. In this article, based on the diversity of data and limited power supply of mesh clients in hybrid wireless mesh networks in underground mines, we propose a multi-criteria routing metric to support data-differentiated service. This routing metric divides data into two types: urgent and non-urgent. End-to-end delay is calculated when transmitting urgent data, and hop count and link load are measured when transmitting non-urgent data. In order to optimize the utilization of mesh clients and to prolong the network lifetime, mesh clients and mesh routers are given different weights in the calculation of hop count. Based on the QualNet7.1 simulation platform, the performance of the proposed routing metric in transmitting urgent and non-urgent data is evaluated through numerous simulations. Simulation results indicate that the routes selected using the proposed routing metric can effectively reduce the average end-to-end delay when transmitting urgent data and reduce the utilization rate of mesh clients while simultaneously guaranteeing the capability of the network when transmitting non-urgent data. This finding satisfies the differentiated service requirements of data of different types for hybrid wireless mesh networks in coal mines.

APA, Harvard, Vancouver, ISO, and other styles

31

Endo, Yui, Mitsunori Tada, and Masaaki Mochimaru. "Reconstructing individual hand models from motion capture data." Journal of Computational Design and Engineering 1, no. 1 (January 1, 2014): 1–12. http://dx.doi.org/10.7315/jcde.2014.001.

Full text

Abstract:

Abstract In this paper, we propose a new method of reconstructing the hand models for individuals, which include the link structure models, the homologous skin surface models and the homologous tetrahedral mesh models in a reference posture. As for the link structure model, the local coordinate system related to each link consists of the joint rotation center and the axes of joint rotation, which can be estimated based on the trajectories of optimal markers on the relative skin surface region of the subject obtained from the motion capture system. The skin surface model is defined as a three-dimensional triangular mesh, obtained by deforming a template mesh so as to fit the landmark vertices to the relative marker positions obtained motion capture system. In this process, anatomical dimensions for the subject, manually measured by a caliper, are also used as the deformation constraints.

APA, Harvard, Vancouver, ISO, and other styles

32

Chen, Xiaona, and Jianping Wang. "Breast volume measurement by mesh projection method based on 3D point cloud data." International Journal of Clothing Science and Technology 27, no. 2 (April 20, 2015): 221–36. http://dx.doi.org/10.1108/ijcst-11-2013-0124.

Full text

Abstract:

Purpose – The purpose of this paper is to explore a novel breast volume measuring method by mesh projection based on three-dimensional (3D) point cloud data. Design/methodology/approach – Mesh projection method, a rapid and accurate method to calculate the volume of models described by triangular meshes, was transplanted to calculate breast volume based on 3D point cloud data derived from a [TC]2 3D scanner. A simple landmarking procedure was developed to decide breast boundary. Breast volumes derived from mesh projection method were compared to the results of water displacement by statistical analysis to validate its accuracy. Findings – A novel breast volume measurement method is developed based on mesh projection method. By comparison of water displacement, mesh projection method is proved to be accurate to calculate breast volume. Furthermore, a simple and standard breast boundary landmarking procedure is established, which avoids the arbitrariness of the definition of breast boundary and improves the repetition of landmarking. Practical implications – A simple and convenient tool is provided for bra industries to rapidly and accurately measure breast volume. Originality/value – Mesh projection method is primarily applied to determine breast volume based on 3D point cloud data. Meanwhile, a simple and standard breast boundary landmarking procedure is put forward.

APA, Harvard, Vancouver, ISO, and other styles

33

Singh, Neha, Tathagata Ray, Chandu Parimi, and Srivastava Kuchibhotla. "Input size independent efficient quality meshing of the interior of 2D point cloud data." Journal of Computational Design and Engineering 6, no. 3 (December 12, 2018): 316–26. http://dx.doi.org/10.1016/j.jcde.2018.12.001.

Full text

Abstract:

Abstract This paper describes a framework to generate an unstructured Delaunay mesh of a two-dimensional domain whose boundary is specified by a point cloud data (PCD). The assumption is that the PCD is sampled from a smooth 1-manifold without a boundary definition and is significantly dense (at least ∊-sampled where ∊<1). Presently meshing of such a domain requires two explicit steps, namely the extraction of model definition from the PCD and the use of model definition to guide the unstructured mesh generation. For a densely sampled PCD, the curve reconstruction process is dependent on the size of input PCD and can become a time-consuming overhead. We propose an optimized technique that bypasses the explicit step of curve reconstruction by implicit access to the model information from a well-sampled PCD. A mesh thus generated will be optimal, as the fineness of the mesh is not dictated by the sampling of PCD, but only the geometric complexity of the underlying curve. The implementation and experiments of the proposed framework show significant improvement in expense over the traditional methodology. The main contribution of this paper is the circumvention of the explicit time-consuming step of boundary computation which is a function of the PCD sampling size and a direct generation of a mesh whose complexity is dictated by the geometry of the domain. Highlights The algorithm gives a size optimal triangular mesh directly from a point cloud data. Intermediate step of model definition can be skipped completely. Generated mesh is independent of the number of points in the data. Mesh size and computational time depend on geometric complexity of the curve. For dense samples, this method is very efficient compared to traditional methods.

APA, Harvard, Vancouver, ISO, and other styles

34

Yang, Shuai, Wenjing Shi, Yongzhen Ke, and Yongjiang Xue. "A Two-Stage Registration Method for Dental Volumetric Data and Mesh Data." International Journal of Healthcare Information Systems and Informatics 16, no. 4 (October 2021): 1–15. http://dx.doi.org/10.4018/ijhisi.20211001.oa29.

Full text

Abstract:

Dental computed tomography (CT) images and optical surface scan data are widely used in dental computer-aided design systems. Registration is essential if they are used in software systems. Existing automatic registration methods are either time-consuming or rough, and interactive registration methods are experience-dependent and tedious because of a great deal of purely manual interactions. For overcoming these disadvantages, a two-stage registration method is proposed. In the rough registration stage, the rough translation and rotation matrices are obtained by applying unit quaternion based method on the points interactively selected from the two types of data. In the precise registration stage, the stridden sampling is used to reduce computational complexity and the proposed registration algorithm with scale transformation is used for precise registration. The proposed method offers a good trade-off between precision and time cost. The experimental results demonstrate that the proposed method provides faster convergence and smaller registration errors than existing methods.

APA, Harvard, Vancouver, ISO, and other styles

35

Maeda, Takahiro, and Hiroyuki Fujiwara. "Seismic Hazard Visualization from Big Simulation Data: Cluster Analysis of Long-Period Ground-Motion Simulation Data." Journal of Disaster Research 12, no. 2 (March 16, 2017): 233–40. http://dx.doi.org/10.20965/jdr.2017.p0233.

Full text

Abstract:

This paper describes a method of extracting the relation between the ground-motion characteristics of each area and a seismic source model, based on ground-motion simulation data output in planar form for many earthquake scenarios, and the construction of a parallel distributed processing system where this method is implemented. The extraction is realized using two-stage clustering. In the first stage, the ground-motion indices and scenario parameters are used as input data to cluster the earthquake scenarios within each evaluation mesh. In the second stage, the meshes are clustered based on the similarity of earthquake-scenario clustering. Because the mesh clusters can be correlated to the geographical space, it is possible to extract the relation between the ground-motion characteristics of each area and the scenario parameters by examining the relation between the mesh clusters and scenario clusters obtained by the two-stage clustering. The results are displayed visually; they are saved as GeoTIFF image files. The system was applied to the long-period ground-motion simulation data for hypothetical megathrust earthquakes in the Nankai Trough. This confirmed that the relation between the extracted ground-motion characteristics of each area and scenario parameters is in agreement with the results of ground-motion simulations.

APA, Harvard, Vancouver, ISO, and other styles

36

Caraffa, L., M. Brédif, and B. Vallet. "3D OCTREE BASED WATERTIGHT MESH GENERATION FROM UBIQUITOUS DATA." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XL-3/W3 (August 20, 2015): 613–17. http://dx.doi.org/10.5194/isprsarchives-xl-3-w3-613-2015.

Full text

Abstract:

Despite of the popularity of Delauney structure for mesh generation, octree based approaches remain an interesting solution for a first step surface reconstruction. In this paper, we propose a generic framework for a octree cell based mesh generation. Its input is a set of Lidar-based 3D measurements or other inputs which are formulated as a set of mass functions that characterize the level of confidence on the occupancy of each octree’s leaf. The output is a binary segmentation of the space between <i>occupied</i> and <i>empty</i> areas by taking into account the uncertainty of data. To this end, the problem is then reduced to a global energy optimization framework efficiently optimized with a min-cut approach. We use the approach for producing a large scale surface reconstruction algorithm by merging data from ubiquitous sources like airborne, terrestrial Lidar data, occupancy map and extra cues. Once the surface is computed, a solution is proposed for texturing the mesh.

APA, Harvard, Vancouver, ISO, and other styles

37

Chen, Ming Zhou, and Qi Dou Zhou. "Numerical Simulation of Fluctuating Propeller Forces and Comparison with Experimental Data." Applied Mechanics and Materials 105-107 (September 2011): 518–22. http://dx.doi.org/10.4028/www.scientific.net/amm.105-107.518.

Full text

Abstract:

Unsteady CFD method based on realizable k-ε model is used for predicting unsteady forces of propeller working in non-uniform wake. First, CFD computations with different mesh scales were conducted at the propeller design condition, the results show that mesh refinement changed the results little. Then unsteady CFD simulation with different time step intervals was conducted for determining suitable time step interval, the results show that it is suitable for propeller rotating 3° per step. Based on the chosen mesh and time step interval, unsteady CFD simulation of propeller P4118 was conducted in 3-cycle and 4-cycle inflow, the unsteady thrust, torque and horizontal force agree well with experimental data, the results show that CFD method has good accuracy in predicting unsteady propeller forces.

APA, Harvard, Vancouver, ISO, and other styles

38

Wendt, Nathan A., and Israel L. Jirak. "An Hourly Climatology of Operational MRMS MESH-Diagnosed Severe and Significant Hail with Comparisons to Storm Data Hail Reports." Weather and Forecasting 36, no. 2 (April 2021): 645–59. http://dx.doi.org/10.1175/waf-d-20-0158.1.

Full text

Abstract:

AbstractThe Multi-Radar Multi-Sensor (MRMS) system generates an operational suite of derived products in the National Weather Service useful for real-time monitoring of severe convective weather. One such product generated by MRMS is the maximum estimated size of hail (MESH) that estimates hail size based on the radar reflectivity properties of a storm above the environmental 0°C level. The MRMS MESH product is commonly used across the National Weather Service (NWS), including the Storm Prediction Center (SPC), to diagnose the expected hail size in thunderstorms. Previous work has explored the relationship between the MRMS MESH product and severe hail (≥25.4 mm or 1 in.) reported at the ground. This work provides an hourly climatology of severe MRMS MESH across the contiguous United States from 2012 to 2019, including an analysis of how the MESH climatology differs from the severe hail reports climatology. Results suggest that the MESH can provide beneficial hail risk information in areas where population density is low. Evidence also shows that the MESH can provide potentially beneficial information about severe hail occurrence during the night in locations that are climatologically favored for upscale convective growth and elevated convection. These findings have important implications for the use of MESH as a verification dataset for SPC probabilistic hail forecasts as well as severe weather watch decisions in areas of higher hail risk but low population density.

APA, Harvard, Vancouver, ISO, and other styles

39

Xie, Peibo, Huaxi Gu, Yuan Liu, Xiangbin Wu, Hua You, and Dong Liu. "A virtual hierarchical optical mesh based data center network." IEICE Electronics Express 9, no. 3 (2012): 172–78. http://dx.doi.org/10.1587/elex.9.172.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Nguyen, Tuan T., Vedrana A. Dahl, and J. Andreas Bærentzen. "Cache-mesh, a Dynamics Data Structure for Performance Optimization." Procedia Engineering 203 (2017): 193–205. http://dx.doi.org/10.1016/j.proeng.2017.09.807.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Mori, Daisuke, Shinji Seo, Masakazu Kobayashi, and Masatake Higashi. "2215 Fitting High Quality Subdivision Surface to Mesh Data." Proceedings of Design & Systems Conference 2009.19 (2009): 397–400. http://dx.doi.org/10.1299/jsmedsd.2009.19.397.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

SUZUKI, Hiromasa, Yasuyuki KANDORI, Takashi KANAI, and Fumihiko KIMURA. "Triangular Mesh Reconstruction from Measured Data Points (1st Report)." Journal of the Japan Society for Precision Engineering 64, no. 9 (1998): 1314–19. http://dx.doi.org/10.2493/jjspe.64.1314.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

KANDORI, Yasuyuki, Hiromasa SUZUKI, Takashi KANAI, and Fumihiko KIMURA. "Triangular Mesh Reconstruction from Measured Data Points (2nd Report)." Journal of the Japan Society for Precision Engineering 64, no. 10 (1998): 1461–66. http://dx.doi.org/10.2493/jjspe.64.1461.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Atallah, M. J., F. Dehne, R. Miller, A. Rauchaplin, and J. J. Tsay. "Multisearch Techniques: Parallel Data Structures on Mesh-Connected Computers." Journal of Parallel and Distributed Computing 20, no. 1 (January 1994): 1–13. http://dx.doi.org/10.1006/jpdc.1994.1001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Kim, Youngdoo, Cong Hong Phong Ngyuen, and Young Choi. "Primitive Recognition from Triangular Mesh of Plant CAD Data." Korean Journal of Computational Design and Engineering 25, no. 1 (March 31, 2020): 56–66. http://dx.doi.org/10.7315/cde.2020.056.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Wang, Feng, Ingo Wald, Qi Wu, Will Usher, and Chris R. Johnson. "CPU Isosurface Ray Tracing of Adaptive Mesh Refinement Data." IEEE Transactions on Visualization and Computer Graphics 25, no. 1 (January 2019): 1142–51. http://dx.doi.org/10.1109/tvcg.2018.2864850.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Jiang, Ruiqi, Hang Zhou, Weiming Zhang, and Nenghai Yu. "Reversible Data Hiding in Encrypted Three-Dimensional Mesh Models." IEEE Transactions on Multimedia 20, no. 1 (January 2018): 55–67. http://dx.doi.org/10.1109/tmm.2017.2723244.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Ben-Chen, Mirela, and Craig Gotsman. "On the optimality of spectral compression of mesh data." ACM Transactions on Graphics 24, no. 1 (January 2005): 60–80. http://dx.doi.org/10.1145/1037957.1037961.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Tsuchie, Shoichi. "Mesh simplification accompanied by its denoising of scanned data." Engineering with Computers 35, no. 3 (October 8, 2018): 993–1008. http://dx.doi.org/10.1007/s00366-018-0647-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Yuan, Yu-Jie, Yu-Kun Lai, Tong Wu, Shihong Xia, and Lin Gao. "Data-driven weight optimization for real-time mesh deformation." Graphical Models 104 (July 2019): 101037. http://dx.doi.org/10.1016/j.gmod.2019.101037.

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!