Incremental Delaunay Triangulation
logo

Please use this identifier to cite or link to this publication: http://hdl.handle.net/10380/3372
This document describes the implementation in ITK of the Incremental Delaunay Triangulation algorithm. Using the Straight Walk in Triangulation function, the exact discrete geometrical orientation predicate, and the itk::QuadEdgeMesh API of ITK , we propose a geometrically exact and robust implementation that, from a given 2-dimensional itk::PointSet, incrementally constructs the corresponding 2-dimensional Delaunay Triangulation as an itk::QuadEdgeMesh.
Code
minus Automatic Testing Results by Insight-Journal Dashboard on Tue Jan 29 16:16:47 2013 for revision #1
starstarstarstarstar expertise: 5 sensitivity: 5
yellow CMake was unable to configure this project.
Click here for more details.

Go here to access the main testing dashboard.

Reviews
There is no review at this time. Be the first to review this publication!

Quick Comments


Resources
backyellow
Download All
Download Paper , View Paper
Download Source code
Source code repository

Statistics more
backyellow
Global rating: starstarstarstarstar
Review rating: starstarstarstarstar [review]
Code rating: starstarstarstarstar
Paper Quality: plus minus

Information more
backyellow
Categories: Data Representation, Mesh
Keywords: QuadEdgeMesh, ITK, Planar Mesh, Triangulation
Toolkits: ITK, CMake
Export citation:

Share
backyellow
Share

Linked Publications more
backyellow
A Skull-Stripping Filter for ITK A Skull-Stripping Filter for ITK
by Bauer S., Fejes T., Reyes M.
Laplace Beltrami Filter on QuadEdge Meshes Laplace Beltrami Filter on QuadEdge Meshes
by Bowers M., Younes L.

View license
Loading license...

Send a message to the author
main_flat
Powered by Midas