Comparison of four-point adding algorithms for Delaunay-type three dimensional mesh generators

Kanaganathan, S.; Goldstein, N.B.

doi:10.1109/20.79087

Cited by 15 publications

(7 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In increasing order of complexity, they are the identity transformation, shift transformation, semi-affine transformation (scale, rotate and shift), full affine transformation (six parameters), and Delaunay triangulation transformation [33,34]. Common to all the transformations is the way they are used: each time a new shift vector is inserted, a global transformation model is chosen and the transformation itself recomputed from the set of all available shift vectors (there often are several hundred such vectors).…”

Section: A4 Transform the Comparative Image And Display The Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Automatic registration for images of two-dimensional protein gels

Smilansky

2001

Electrophoresis

107

View full text Add to dashboard Cite

Two-dimensional polyacrylamide gel electrophoresis 1 (2-D PAGE 1) is currently the method of choice for separating complex mixtures of cellular proteins. Despite its usefulness, 2-D PAGE is not being applied to its full potential because of difficulties with both the method and analysis of the results. One of the key problems is the difficulty and slowness of image analysis, especially registration (image alignment), which is laborious and the results unsatisfactory. We have developed a novel system for analysis of 2-D PAGE images, called Z3, that performs the analysis faster and more precisely. The Z3 system employs novel approaches to image registration, image display, computation of differential expression, and the design and analysis of 2-D gel experiments. This paper describes in detail the registration algorithm, and briefly discusses the merits of complementary pseudocolor display. The registration algorithm is novel in that for the first time raw-image-based registration technology is applied to 2-D gel analysis.

show abstract

Section: A4 Transform the Comparative Image And Display The Resultsmentioning

confidence: 99%

“…An introduction to the subject can be found in [33,34]. The basic method consists of constructing a triangulation over the set of sample points and interpolating the values given at the sample points in each of the resulting triangles.…”

Section: A41 Computation Of the Delaunay Transformationmentioning

confidence: 99%

Automatic registration for images of two-dimensional protein gels

Smilansky

2001

Electrophoresis

107

View full text Add to dashboard Cite

show abstract

“…By using the image coordinates of each detected pattern point and the perspective projection matrix M, its spatial position can be derived. From all reconstructed 3D object points, the surface is approximated by a Delaunay triangulation [12]. The LSC at each 3D vertex/edge is then estimated, those 3D points with weak LSC are removed to simplify the surface mesh, and a new pattern is created for the next iteration so that more points will be projected in those areas with significant variation of surface curvature.…”

Section: D Reconstruction Processmentioning

confidence: 99%

Use of Local Surface Curvature Estimation for Adaptive Vision System Based on Active Light Projection

Böhler

Schütze

et al. 2008

Advanced Concepts for Intelligent Vision Systems

View full text Add to dashboard Cite

Abstract. In this paper, we present a new 3D reconstruction approach based on local surface curvature analysis. Its integration can make a normal active stereoscopic system intelligent, and capable to produce directly optimized 3D model. The iterative 3D reconstruction process begins with a sparse and regular point pattern. Based on the reconstructed 3D point cloud, the local surface curvature around each 3D point is estimated. Those 3D points located in flat areas are removed from the 3D model, and a new pattern is created to project more points onto the object where there is high surface curvature. The 3D model is thus refined progressively during the acquisition process, and finally an optimized 3D model is obtained. Our numerous experiments showed that compared to the 3D models generated by commercial system, the loss of morphological quality is negligible, and the gain by the simplification of the model is considerable.

show abstract

“…One way to proceed is by trying to make the Delaunay tessellation near the region of a point by applying Watson's algorithm" or variants of it.9*10*12 -14* 16 The process is theoretically strong but presents some weaknesses: its time complexity is more than linear'6.20 and it needs special treatment in degenerate cases.'. "9 1 2 * 1 3 * l 6 Further, it suffers from the formation of Sliuer elements.…”

Section: Previous Approachesmentioning

confidence: 99%

An approach to refining three‐dimensional tetrahedral meshes based on Delaunay transformations

Golias

Tsiboukis

1994

Numerical Meth Engineering

View full text Add to dashboard Cite

SUMMARYA technique for refining three-dimensional tetrahedral meshes is proposed in this paper. The proposed technique is capable of treating arbitrary unstructured tetrahedral meshes, convex or non-convex with multiple regions resulting in high quality constrained Delaunay triangulations. The tetrahedra generated are of high quality (nearly equilateral). Sliver tetrahedra, which present a real problem to many algorithms are not produced with the new method. The key to the generation of high quality tetrahedra is the iterative application of a set of topological transformations based on the Voronoi-Delaunay theory and a reposition of nodes technique. The computational requirements of the proposed technique are in linear relationship with the number of nodes and tetrahedra, making it ideal for direct employment in a fully automatic finite element analysis system for 3-D adaptive mesh refinement. Application to some test problems is presented to show the effectiveness and applicability of the new method.

show abstract

Comparison of four-point adding algorithms for Delaunay-type three dimensional mesh generators

Cited by 15 publications

References 6 publications

Automatic registration for images of two-dimensional protein gels

Automatic registration for images of two-dimensional protein gels

Use of Local Surface Curvature Estimation for Adaptive Vision System Based on Active Light Projection

An approach to refining three‐dimensional tetrahedral meshes based on Delaunay transformations

Contact Info

Product

Resources

About