نتایج جستجو برای: delaunay grid

تعداد نتایج: 86852  

Journal: :SIAM Journal on Computing 2015

2015
A. Sakthi Bharathi D. Manimegalai

In this paper we present two approaches to reconstruct 3D shapes of brain tumours from MRI images. The first approach is reconstruction of 3D images from set of 2D segmented slices of MRI brain by using thresholding and morphological operations; contour plot and patches. The second approach is a better one where in we reconstruct a tumour by using same segmentation process and altering the 3D r...

2001
Bernd R. Schlei Lakshman Prasad Alexei N. Skourikhine

We demonstrate how to derive morphological information from micrographs, i.e., grey-level images, of polymeric foams. The segmentation of the images is performed by applying a pulse-coupled neural network. This processing generates blobs of the foams walls/struts and voids, respectively. The contours of the blobs and their corresponding points form the input to a constrained Delaunay tessellati...

2016
Valentina Onesto Carlo Cosentino Enzo Di Fabrizio Mario Cesarelli Francesco Amato Francesco Gentile

Neurons are specialized, electrically excitable cells which use electrical to chemical signals to transmit and elaborate information. Understanding how the cooperation of a great many of neurons in a grid may modify and perhaps improve the information quality, in contrast to few neurons in isolation, is critical for the rational design of cell-materials interfaces for applications in regenerati...

2006
Manuel Abellanas Alfredo de las Vegas

This paper describes the software DEpthLAUNAY. The main goal of the application is to compute Delaunay depth layers and levels of a planar point set [ACH]. Some other geometric structures can be computed as well (convex hull, convex layers and levels, Voronoi diagram and Voronoi levels, Delaunay triangulation, Delaunay empty circles, etc.) The application has been developed using CGAL [CGAL].

Journal: :Computational Geometry 2002

Journal: :International Journal of Computational Geometry & Applications 2014

1995
Francis Bernardeau Rien van de Weygaert

We introduce two new methods to obtain reliable velocity field statistics from N-body simulations, or indeed from any general density and velocity fluctuation field sampled by discrete points. These methods, the Voronoi tessellation method and Delaunay tessellation method, are based on the use of the Voronoi and Delaunay tessellations of the point distribution defined by the locations at which ...

Journal: :Journal of Marine Science and Engineering 2022

Despite being a minor probability event, marine accidents can cause serious consequences such as casualties, environmental damage, and even massive economic losses. As an important part of the traffic safety system, evaluation navigation in coastal waters is great significance to ensure ship navigation. In order objectively evaluate navigation, this paper proposes irregular grid division method...

2002
B. Chazelle O. Devillers F. Hurtado M. Mora V. Sacristán M. Teillaud

Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster algorithms can be designed. Given two sets of points, we prove that, if the Delaunay triangulation of all the points is known, the Delaunay triangulation of each set can be computed in randomized expected linear time.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید