Triangular Meshes Delaunay Conforming Filter

Gelas, Arnaud,Gouaillard, Alexandre,Megason, Sean*
Abstract
Triangular Meshes Delaunay Conforming Filter

Abstract

The \emph{Delaunay triangulation} is the triangulation of a set of points which maximizes the minimum angle of all angles of the triangles, and thus triangle aspect ratios. So converting a non Delaunay triangulation into a Delaunay triangulation, \emph{Delaunay conforming}, improves the all triangle aspect ratios and avoid elongated triangles. Note that combining this filter with usual operations like smoothing will provide a better approximation and a better distribution a triangle aspect ratios. Here this document describes a new filter based on the $n$D $2$-manifold mesh data structure available in itk: \code{itk::QuadEdgeMesh}~\cite{itkQE} to produce (planar or surfacic) Delaunay triangulation from any non-Delaunay triangulation by edge flipping, by implementing the edge flipping method decribed in~\cite{Dyer2007sgp}.

Keywords

Delaunaytriangular meshconformationedge flipping
Manuscript
Source Code and Data

Source Code and Data

DelaunayConformingFilterCMakeLists.txt1 KBdatawave.vtk465.8 KBdocInsightArticle.cls4.1 KBInsightJournal.sty34.6 KBdelaunay.bib1011 Bdelaunayconforming.pdf1.4 MBdelaunayconforming.tex7.4 KBfig.svnentries752 Bformat2 Bprop-baseflip0.png.svn-base53 Bflip1.png.svn-base53 Bwave0.png.svn-base53 Bwave1.png.svn-base53 Btext-baseflip0.png.svn-base3.6 KBflip1.png.svn-base3.4 KBwave0.png.svn-base756.2 KBwave1.png.svn-base554.6 KBflip0.png3.6 KBflip1.png3.4 KBwave0.png756.2 KBwave1.png554.6 KBitkPriorityQueueContainer.h13.3 KBitkQuadEdgeMeshDelaunayConformingFilter.h8.2 KBitkQuadEdgeMeshDelaunayConformingFilter.txx5.7 KBitkQuadEdgeMeshDelaunayConformingFilterTest.cxx2.4 KB

Select a file to preview