The maximum opposite angulation for mesh construction

Download

10.1007bf03167474.pdf

Date

2005-02-01

Author

Cheng, WJ
Sorguç, Arzu
Shinoda, J
Hagiwara, I

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

36
views

208
downloads

In this paper, a new approach, "the Maximum Opposite Angulation (MOA for short)" algorithm, for the construction of a triangular mesh from a set of unorganized data points is proposed. A topological judgment algorithm is coupled to the MOA algorithm to avoid holes and/or intersections that can be encountered on the reconstructed surface. The MOA algorithm is based on the idea of "the list," which presets a uniformity to the initial data set to fulfill the task of forming "the good mesh architecture" which is defined as the meshes having well balanced interior angles and good aspect ratios. The list, consists of line segments formed by point pairs sorted from the shortest to the longest. The idea of MOA is then to use the shortest line segment as the initial data to start with for reconstruction of a triangular mesh. The vertex point of the triangular geometry is then searched with respect to this line segment to give the good mesh. It is also shown that, the MOA in 3-D which includes the topological judgment in smoothing out the surface of the reconstructed solid model, is superior both in speed and quality, to the existing algorithms.

Subject Keywords

General Engineering, Applied Mathematics

URI

https://hdl.handle.net/11511/36751

Journal

JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS

DOI

https://doi.org/10.1007/bf03167474

Collections

Department of Architecture, Article

Suggestions

OpenMETU
Core

AN UPPER BOUND FOR THE LARGEST EIGENVALUE OF A GRAPH - EFFECT OF TYPES OF VERTICES Türker, Burhan Lemi (Springer Science and Business Media LLC, 1992-01-01) A novel method, based on the topology of the cardinal vertex, is described to find an upper bound for the largest eigenvalue of a graph.
An alternative series solution to the isotropic quartic oscillator in N dimensions Taşeli, Hasan (Springer Science and Business Media LLC, 1996-01-01) The series solution of the N-dimensional isotropic quartic oscillator weighted by an appropriate function which exhibits the correct asymptotic behavior of the wave function is presented. The numerical performance of the solution in Bill's determinant picture is excellent, and yields the energy spectrum of the system to any desired accuracy for the full range of the coupling constant. Furthermore, it converges to the well-known exact solution of the unperturbed harmonic oscillator wave function, when the an...
Unstructured grid generation and a simple triangulation algorithm for arbitrary 2-D geometries using object oriented programming Karamete, BK; Tokdemir, Turgut; Ger, M (Wiley, 1997-01-30) This paper describes the logic of a dynamic algorithm for a general 2D Delaunay triangulation of arbitrarily prescribed interior and boundary nodes. The complexity of the geometry is completely arbitrary. The scheme is free of specific restrictions on the input of the geometrical data. The scheme generates triangles whose associated circumcircles contain 'no nodal points except their vertices. There is no predefined limit for the number of points and the boundaries. The direction of generation of the triang...
A DRBEM approximation of the Steklov eigenvalue problem Türk, Önder (Elsevier BV, 2021-01-01) In this study, we propose a novel approach based on the dual reciprocity boundary element method (DRBEM) to approximate the solutions of various Steklov eigenvalue problems. The method consists in weighting the governing differential equation with the fundamental solutions of the Laplace equation where the definition of interior nodes is not necessary for the solution on the boundary. DRBEM constitutes a promising tool to characterize such problems due to the fact that the boundary conditions on part or all...
A strange recursion operator for a new integrable system of coupled Korteweg-de Vries equations Karasu, A; Karasu, Atalay; Sakovich, SY (Springer Science and Business Media LLC, 2004-08-01) A recursion operator is constructed for a new integrable system of coupled Korteweg de Vries equations by the method of gauge-invariant description of zero-curvature representations. This second-order recursion operator is characterized by unusual structure of its nonlocal part.

Citation Formats

W. Cheng, A. Sorguç, J. Shinoda, and I. Hagiwara, “The maximum opposite angulation for mesh construction,” JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, pp. 21–44, 2005, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/36751.