Academic literature on the topic 'Conforming triangulation'

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Conforming triangulation.'

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.

Journal articles on the topic "Conforming triangulation"

1

Meng, XianHai, JiGang Li, Qin Yang, Qiang Cai, and QiMing Chen. "Complex conforming Delaunay triangulation." Science China Information Sciences 53, no. 6 (2010): 1130–40. http://dx.doi.org/10.1007/s11432-010-0097-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Xianhai, Meng. "Conforming Delaunay Triangulation for Domain with Small Angles." Information Technology Journal 12, no. 17 (2013): 4046–51. http://dx.doi.org/10.3923/itj.2013.4046.4051.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Du, Qiang, and Desheng Wang. "Boundary recovery for three dimensional conforming Delaunay triangulation." Computer Methods in Applied Mechanics and Engineering 193, no. 23-26 (2004): 2547–63. http://dx.doi.org/10.1016/j.cma.2003.12.058.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cerqueira, A. M. L. G., A. C. Lisboa, and R. C. Mesquita. "Boundary recovery for conforming Delaunay triangulation of curved complexes." IET Science, Measurement & Technology 6, no. 5 (2012): 324. http://dx.doi.org/10.1049/iet-smt.2011.0119.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Song, Songhe, Min Wan, Shengxi Wang, Desheng Wang, and Zhengping Zou. "Robust and Quality Boundary Constrained Tetrahedral Mesh Generation." Communications in Computational Physics 14, no. 5 (2013): 1304–21. http://dx.doi.org/10.4208/cicp.030612.010313a.

Full text
Abstract:
AbstractA novel method for boundary constrained tetrahedral mesh generation is proposed based on Advancing Front Technique (AFT) and conforming Delaunay triangulation. Given a triangulated surface mesh, AFT is firstly applied to mesh several layers of elements adjacent to the boundary. The rest of the domain is then meshed by the conforming Delaunay triangulation. The non-conformal interface between two parts of meshes are adjusted. Mesh refinement and mesh optimization are then preformed to obtain a more reasonable-sized mesh with better quality. Robustness and quality of the proposed method is shown. Convergence proof of each stage as well as the whole algorithm is provided. Various numerical examples are included as well as the quality of the meshes.
APA, Harvard, Vancouver, ISO, and other styles
6

MURPHY, MICHAEL, DAVID M. MOUNT, and CARL W. GABLE. "A POINT-PLACEMENT STRATEGY FOR CONFORMING DELAUNAY TETRAHEDRALIZATION." International Journal of Computational Geometry & Applications 11, no. 06 (2001): 669–82. http://dx.doi.org/10.1142/s0218195901000699.

Full text
Abstract:
A strategy is presented to find a set of points that yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear complex (PLC). This algorithm is novel because it imposes no angle restrictions on the input PLC. In the process, an algorithm is described that computes a planar conforming Delaunay triangulation of a Planar Straight-Line Graph (PSLG) such that each triangle has a bounded circumradius, which may be of independent interest.
APA, Harvard, Vancouver, ISO, and other styles
7

Ma, Yan, Yan-ling Hao, and Feng-min Tian. "A Novel Model of Conforming Delaunay Triangulation for Sensor Network Configuration." Abstract and Applied Analysis 2015 (2015): 1–7. http://dx.doi.org/10.1155/2015/720249.

Full text
Abstract:
Delaunay refinement is a technique for generating unstructured meshes of triangles for sensor network configuration engineering practice. A new method for solving Delaunay triangulation problem is proposed in this paper, which is called endpoint triangle’s circumcircle model (ETCM). As compared with the original fractional node refinement algorithms, the proposed algorithm can get well refinement stability with least time cost. Simulations are performed under five aspects including refinement stability, the number of additional nodes, time cost, mesh quality after intruding additional nodes, and the aspect ratio improved by single additional node. All experimental results show the advantages of the proposed algorithm as compared with the existing algorithms and confirm the algorithm analysis sufficiently.
APA, Harvard, Vancouver, ISO, and other styles
8

Benyoub, Anis, and Jonathan Dupuy. "Concurrent Binary Trees for Large-Scale Game Components." Proceedings of the ACM on Computer Graphics and Interactive Techniques 7, no. 3 (2024): 1–18. http://dx.doi.org/10.1145/3675371.

Full text
Abstract:
A concurrent binary tree (CBT) is a GPU-friendly data-structure suitable for the generation of bisection based terrain tessellations, i.e., adaptive triangulations over square domains. In this paper, we expand the benefits of this data-structure in two respects. First, we show how to bring bisection based tessellations to arbitrary polygon meshes rather than just squares. Our approach consists of mapping a triangular subdivision primitive, which we refer to as a bisector, to each halfedge of the input mesh. These bisectors can then be subdivided adaptively to produce conforming triangulations solely based on halfedge operators. Second, we alleviate a limitation that restricted the triangulations to low subdivision levels. We do so by using the CBT as a memory pool manager rather than an implicit encoding of the triangulation as done originally. By using a CBT in this way, we concurrently allocate and/or release bisectors during adaptive subdivision using shared GPU memory. We demonstrate the benefits of our improvements by rendering planetary scale geometry out of very coarse meshes. Performance-wise, our triangulation method evaluates in less than 0.2ms on console-level hardware.
APA, Harvard, Vancouver, ISO, and other styles
9

Raman, Sundar, and Zheng Jianmin. "Efficient Terrain Triangulation and Modification Algorithms for Game Applications." International Journal of Computer Games Technology 2008 (2008): 1–5. http://dx.doi.org/10.1155/2008/316790.

Full text
Abstract:
An efficient terrain generation algorithm is developed, based on constrained conforming Delaunay triangulation. The density of triangulation in different regions of a terrain is determined by its flatness, as seen from a height map, and a control map. Tracks and other objects found in a game world can be applied over the terrain using the “stenciling” and “stitching” algorithms. Using user controlled parameters, varying levels of detail can be preserved when applying these objects over the terrain as well. The algorithms have been incorporated into 3dsMax as plugins, and the experimental results demonstrate the usefulness and efficiency of the developed algorithms.
APA, Harvard, Vancouver, ISO, and other styles
10

Mohajerani, Soheil, Duruo Huang, Gang Wang, Seyed-Mohammad Esmaeil Jalali, and Seyed Rahman Torabi. "An efficient algorithm for generation of conforming mesh for three-dimensional discrete fracture networks." Engineering Computations 35, no. 8 (2018): 2860–82. http://dx.doi.org/10.1108/ec-03-2018-0127.

Full text
Abstract:
Purpose This study aims to develop an efficient algorithm for generation of conforming mesh for seepage analysis through 3D discrete fracture networks (DFN). Design/methodology/approach The algorithm is developed based on a refined conforming Delaunay triangulation scheme, which is then validated using analytical solutions. The algorithm is well able to meet the challenge of meshing complex geometry of DFNs. Findings A series of sensitivity analysis have been performed to evaluate the effect of meshing parameters on steady state solution of Darcy flow using a finite element scheme. The results show that an optimized minimum internal angle of meshing elements should be predetermined to guarantee termination of the algorithm. Originality/value The developed algorithm is computationally efficient, fast and is of low cost. Furthermore, it never changes the geometrical structure and connectivity pattern of the DFN.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Conforming triangulation"

1

Krause, Jens. On boundary conforming anisotropic Delaunay meshes. Hartung-Gorre, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Conforming triangulation"

1

Cheng, Siu-Wing. "3D Conforming Delaunay Triangulation." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_716.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Cheng, Siu-Wing. "3D Conforming Delaunay Triangulation." In Encyclopedia of Algorithms. Springer US, 2014. http://dx.doi.org/10.1007/978-3-642-27848-8_716-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Meister, A. "Development of an Implicit Finite Volume Scheme for the Computation of Unsteady Flow Fields on Unstructured Moving Grids." In Numerical Methods for Fluid Dynamics V. Oxford University PressOxford, 1996. http://dx.doi.org/10.1093/oso/9780198514800.003.0045.

Full text
Abstract:
Abstract An implicit finite volume approximation of the Navier-Stokes equations governing compressible, viscous flow in the presence of moving boundaries will be described. The method is incorporated in the DLR-r-Code, uses a box-type discretisation and works on general conforming triangulations. The discretisation of the convective fluxes is accomplished by means of an approximate Riemann solver used with linear ENO recovery while the diffusive fluxes are discretised in a central manner. The AUSMDV scheme developed by Liou and Wada [5] is chosen as the Riemann solver in an implicit formulation in the presence of moving grids for the first time.
APA, Harvard, Vancouver, ISO, and other styles
4

Lebraty, Jean-Fabrice, and Cécile Godé. "Assessing the Performance of Decision Support Systems in Military Environment." In Advances in Human and Social Aspects of Technology. IGI Global, 2015. http://dx.doi.org/10.4018/978-1-4666-8450-8.ch003.

Full text
Abstract:
This article explores the ability of a decision support system (DSS) to improve the quality of decision making in extreme environment. This DSS is actually based on a networked information system. Academic literature commonly mentions models of fit to explore the relationship between technology and performance, reckoning users' evaluations as a relevant measurement technique for Information System (IS) success. Although effective contributions have been achieved in measurement and exploration of fit, there have been few attempts to investigate the triangulation of fit between “Task-DSS-Decision Maker” under stressful and uncertain circumstances. This article provides new insights regarding the advantages provided by networked IS for making relevant decisions. An original case study has been conducted. It is focused on a networked decision support system called Link 16 that is used during aerial missions. This case study shows that the system improves decision making on an individual basis. Our result suggest the importance of three main fit criteria – Compliance, Complementarity and Conformity – to measure DSS performance under extreme environment and display a preliminary decisional fit model.
APA, Harvard, Vancouver, ISO, and other styles
5

Jahangirian, A. R., and L. J. Johnston. "Unstructured Grid Generation and Flow Adaptation for External Aerodynamic Flows." In Numerical Methods for Fluid Dynamics V. Oxford University PressOxford, 1996. http://dx.doi.org/10.1093/oso/9780198514800.003.0040.

Full text
Abstract:
Abstract The generation of high-quality computational grids for complex aerodynamic configurations remains an important area of concern, hindering the routine application of Computational Fluid Dynamics (CFD). The block-structured approach has proved to be highly successful, but it does in general require extensive user intervention and expertise. Alternatively, unstructured grids can be made to fit very complex geometries in a relatively straightforward manner and has been shown to be highly effective for grid adaptivity[4]. Therefore, much progress has been made over the past few years to develop fast and robust unstructured grid generators. Two well-known approaches commonly used for construction of triangular unstructured grids are the Delaunay criterion and the advancing front method. The Delaunay triangulation, although it has many interesting properties [7] does not address the issues of grid point creation and boundary conformity. Additionally this method is not naturally capable of generating high aspect ratio cells required for viscous flow calculations. The advancing front method has received much attention, particularly because of its self-sufficiency and grid quality ([1],[4]). However, special care must be taken when choosing the data structure to efficiently perform the relevant searches.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Conforming triangulation"

1

Cerqueira, A. M. L. G., A. C. Lisboa, and R. C. Mesquita. "Boundary recovery for conforming Delaunay triangulation of curved complexes." In IET 8th International Conference on Computation in Electromagnetics (CEM 2011). IET, 2011. http://dx.doi.org/10.1049/cp.2011.0016.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Cohen-Steiner, David, Éric Colin de Verdière, and Mariette Yvinec. "Conforming Delaunay triangulations in 3D." In the eighteenth annual symposium. ACM Press, 2002. http://dx.doi.org/10.1145/513400.513425.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Edelsbrunner, Herbert, and Tiow Seng Tan. "An upper bound for conforming Delaunay triangulations." In the eighth annual symposium. ACM Press, 1992. http://dx.doi.org/10.1145/142675.142690.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Tan, Tiow-Seng. "An optimal bound for conforming quality triangulations." In the tenth annual symposium. ACM Press, 1994. http://dx.doi.org/10.1145/177424.177976.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mishev, Ilya, and Ruslan Rin. "Grid Quality Measures for PEBI Grids." In SPE Reservoir Simulation Conference. SPE, 2021. http://dx.doi.org/10.2118/203961-ms.

Full text
Abstract:
Abstract Combining the Perpendicular Bisector (PEBI) grids with the Two Point Flux Approximation (TPFA) scheme demonstrates a potential to accurately model on unstructured grids, conforming to the geological and engineering features of real grids. However, with the increased complexity and resolution of the grids, the PEBI conditions will inevitably be violated in some cells and the approximation properties will be compromised. The objective is to develop accurate and practical grid quality measures that quantify such errors. We critically evaluated the existing grid quality measures and found them lacking predictive power in several areas. The available k-orthogonality measures predict error for flow along the strata, although TPFA provides an accurate approximation. The false-positive results are not only misleading but can overwhelm further analysis. We developed the so-called "truncation error" grid measure which is probably the most accurate measure for flow through a plane face and accurately measures the error along the strata. We also quantified the error due to the face curvature. Curved faces are bound to exist in any real grid. The impact of the quality of the 2-D Delaunay triangulation on TPFA approximation properties is usually not taken into account. We investigate the impact of the size of the smallest angles that can cause considerable increase of the condition number of the matrix and an eventual loss of accuracy, demonstrated with simple examples. Based on the analysis, we provide recommendations. We also show how the size of the largest angles impacts the approximation quality of TPFA. Furthermore, we discuss the impact of the change of the permeability on the TPFA approximation. Finally, we present simple tools that reservoir engineers can use to incorporate the above-mentioned grid quality measures into a workflow. The grid quality measures discussed up to now are static. We also sketch the further extension to dynamic measures, that is, how the static measures can be used to detect change in the flow behavior, potentially leading to increased error. We investigate a comprehensive set of methods, several of them new, to measure the static grid quality of TPFA on PEBI grids and possible extension to dynamic measures. All measures can be easily implemented in production reservoir simulators and examined using the suggested tools in a workflow.
APA, Harvard, Vancouver, ISO, and other styles
6

Yang, Jianming, and Frederick Stern. "Robust and Efficient Setup Procedure for Complex Triangulations in Immersed Boundary Simulations." In ASME 2012 Fluids Engineering Division Summer Meeting collocated with the ASME 2012 Heat Transfer Summer Conference and the ASME 2012 10th International Conference on Nanochannels, Microchannels, and Minichannels. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/fedsm2012-72347.

Full text
Abstract:
Immersed boundary methods have been widely used for simulating flows with complex geometries, as quality boundary-conforming grids are usually difficult to generate for complex geometries, especially, when motion and/or deformation is involved. Complex geometries can be conveniently represented using triangulated surfaces in a Lagrangian manner. A major task in immersed boundary simulations is to inject the immersed boundary information into the background Cartesian grid, such as the inside/outside status of a grid point with regard to the immersed boundary and the accurate sub-cell position of the immersed boundary for a grid point next to it. For high resolution simulations with moving/deforming boundaries, this step can be very expensive. In this paper, a simple, fast, and robust procedure is developed for setting up complex triangulations. Several cases with complex geometries are performed to demonstrate the efficiency and robustness.
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!