Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

2018 ( 2 )

2017 ( 9 )

2016 ( 14 )

2015 ( 11 )

Custom range...

Search Results: 1 - 10 of 443 matches for " Delaunay Triangulation "
All listed articles are free for downloading (OA Articles)
Page 1 /443
Display every page Item
Study on Delaunay Triangulation with the Islets Constraints  [PDF]
Dong Wei, Xinghua Liu
Intelligent Information Management (IIM) , 2010, DOI: 10.4236/iim.2010.26045
Abstract: Aiming at Delaunay triangulation with islets constrains in terrain simulation. A general Delaunay triangulation algorithm for constrained data set with islets is proposed. The algorithm firstly constructs Constrained Delaunay Triangulation with constraint polygons which are inner boundary of islets, then according to topological relations within edge, surface, arc segment, applies bidirectional search to find the triangle in islet, lastly it carries on certain corresponding processing to complete the Delaunay triangulation algorithm with islets. The analyses show the algorithm simple, fast speed. The algorithm can be used in 3-D terrain vision.
A Novel Spatial Clustering Algorithm Based on Delaunay Triangulation  [PDF]
Xiankun Yang, Weihong Cui
Journal of Software Engineering and Applications (JSEA) , 2010, DOI: 10.4236/jsea.2010.32018
Abstract: Exploratory data analysis is increasingly more necessary as larger spatial data is managed in electro-magnetic media. Spatial clustering is one of the very important spatial data mining techniques which is the discovery of interesting rela-tionships and characteristics that may exist implicitly in spatial databases. So far, a lot of spatial clustering algorithms have been proposed in many applications such as pattern recognition, data analysis, and image processing and so forth. However most of the well-known clustering algorithms have some drawbacks which will be presented later when ap-plied in large spatial databases. To overcome these limitations, in this paper we propose a robust spatial clustering algorithm named NSCABDT (Novel Spatial Clustering Algorithm Based on Delaunay Triangulation). Delaunay dia-gram is used for determining neighborhoods based on the neighborhood notion, spatial association rules and colloca-tions being defined. NSCABDT demonstrates several important advantages over the previous works. Firstly, it even discovers arbitrary shape of cluster distribution. Secondly, in order to execute NSCABDT, we do not need to know any priori nature of distribution. Third, like DBSCAN, Experiments show that NSCABDT does not require so much CPU processing time. Finally it handles efficiently outliers.
Survey of Surface Reconstruction Algorithms  [PDF]
Amin Alqudah
Journal of Signal and Information Processing (JSIP) , 2014, DOI: 10.4236/jsip.2014.53009

Surface reconstruction is a problem in the field of computational geometry that is concerned with recreating a surface from scattered data points sampled from an unknown surface. To date, the primary application of surface reconstruction algorithms has been in computer graphics, where physical models are digitized in three dimensions with laser range scanners or mechanical digitizing probes (Bernardini et al., 1999 [1]). Surface reconstruction algorithms are used to convert the set of digitized points into a wire frame mesh model, which can be colored, textured, shaded, and placed into a 3D scene (in a movie or television commercial, for example). In this paper, we discuss some computational geometry preliminaries, and then move on to a summary of some different techniques used to address the surface reconstruction problem. The coming sections describe two algorithms: that of Hoppe, et al. (1992 [2]) and Amenta, et al. (1998 [3]

The Algorithm of 3D Constrained Delaunay Triangulation

XU Yong-an,YANG Qin,WU Zhuang-zhi,CHEN Qi-ming,TAN Jian-rong,

软件学报 , 2001,
Abstract: In this paper, the boundary conformability of 3D constrained Delaunay triangulat ion is analyzed. Based on the theory of Delaunay triangulation, the feasibility of 3D constrained Delaunay triangulation is discussed emphatically. The algorith m of 3D constrained Delaunay triangulation of finite domain is designed. Applica tions in oil and geological exploration and mechanical part design are illustrat ed. The algorithm plays an important role in the computation and analysis of com plicated objects.
Research on Algorithm of the Point Set in the Plane Based on Delaunay Triangulation  [PDF]
Bin Yang, Shuyuan Shang
American Journal of Computational Mathematics (AJCM) , 2012, DOI: 10.4236/ajcm.2012.24046

In the paper, an improved algorithm is presented for Delaunay triangulation of the point-set in the plain. Based on the original algorithm, we propose the notion of removing circle. During the process of triangulation, and the circle dynamically moves, the algorithm which is simple and practical, therefore evidently accelerates the process of searching a new point, while generating a new triangle. Then it shows the effect of the algorithm in the finite element mesh.

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation  [PDF]
Shuli Sun, Haoran Bao, Minghui Liu, Yuan Yuan
Intelligent Information Management (IIM) , 2013, DOI: 10.4236/iim.2013.56021

The concept of optimal Delaunay triangulation (ODT) and the corresponding error-based quality metric are first introduced. Then one kind of mesh smoothing algorithm for tetrahedral mesh based on the concept of ODT is examined. With regard to its problem of possible producing illegal elements, this paper proposes a modified smoothing scheme with a constrained optimization model for tetrahedral mesh quality improvement. The constrained optimization model is converted to an unconstrained one and then solved by integrating chaos search and BFGS (Broyden-Fletcher-Goldfarb-Shanno) algorithm efficiently. Quality improvement for tetrahedral mesh is finally achieved by alternately applying the presented smoothing scheme and re-triangulation. Some testing examples are given to demonstrate the effectiveness of the proposed approach.

A Novel Method for Transforming XML Documents to Time Series and Clustering Them Based on Delaunay Triangulation  [PDF]
Narges Shafieian
Applied Mathematics (AM) , 2015, DOI: 10.4236/am.2015.66098
Abstract: Nowadays exchanging data in XML format become more popular and have widespread application because of simple maintenance and transferring nature of XML documents. So, accelerating search within such a document ensures search engine’s efficiency. In this paper, we propose a technique for detecting the similarity in the structure of XML documents; in the following, we would cluster this document with Delaunay Triangulation method. The technique is based on the idea of representing the structure of an XML document as a time series in which each occurrence of a tag corresponds to a given impulse. So we could use Discrete Fourier Transform as a simple method to analyze these signals in frequency domain and make similarity matrices through a kind of distance measurement, in order to group them into clusters. We exploited Delaunay Triangulation as a clustering method to cluster the d-dimension points of XML documents. The results show a significant efficiency and accuracy in front of common methods.
A Novel Technique of Skeletonization for Feature Extraction in Cadastral Maps
Shilpa Sharma,Prabhakar Sharma
International Journal of Electronics and Computer Science Engineering , 2012,
Abstract: A cadastral map is a map showing the boundaries and ownership of land parcels. The British evolved thepresent cadastral system for the purposes of governance and revenue collection. Cadastral maps can be treated as base maps for all land related information. Typically, these maps store information pertaining to ownership details, land use, areal extents, type of development that has been made by the parcel owner, topological relationship with neighboring plots etc. This paper presents a novel method for the extraction of various features of cadastral maps. The extraction process works in two phases. In the first phase, boundary pixels of the cadastral map are found and skeletonization is carried out on them. In the second phase, the manipulated data obtained from the previous phase is analyzed to extract the features of the given cadastral map. The cadastral maps are generally not very accurate. But most of the available skeletonization algorithms are very sensitive to inaccuracies. In the proposed method, the skeletonization algorithm has been modified to take care of the inherent inaccuracies present in the cadastral maps.
3D Medical Image Segmentation and Surface Modeling Using the Power Crust
K. Kies,N. Benamrane,A. Benyettou
Information Technology Journal , 2005,
Abstract: we present a method of 3D segmentation based on region-growing technique were extracted region surface edges are modelled using a 3D Delaunay Triangulation refined by using the power crust algorithm. The latest can be performed either on a small subset randomly chosen or on all edge points. This proposed fast and very promising approach makes it possible to adapt it to the segmentation of anatomical structures in MRI and CTScan images.
A Monitoring Approach for Surface Reconstruction from 3D Point Cloud
Bharti Sood,Kamaldeep Kaur
International Journal of Computer Technology and Applications , 2012,
Abstract: This paper describes the surface reconstruction from 3D point cloud. The vertices of point cloud build a network of triangles using Delaunay Triangulation for 3D surface. DT plays an important role due to its guaranteed quality of triangular mesh generation. The process monitoring is emerging as a valuable tool and it is used to enhance operational efficiency. In this paper Delaunay algorithm monitors the various parameters of mesh generation and evaluates the performance of the algorithm by calculating parameters
Page 1 /443
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.