Incremental Delaunay Triangulation
| Please use this identifier to cite or link to this publication: http://hdl.handle.net/10380/3372 |
Published in The Insight Journal - 2012 January-December.
Submitted by Stephane Rigaud on 07-26-2012.
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
Automatic Testing Results
by Insight-Journal Dashboard
on Tue Jan 29 16:16:47 2013 for revision #1 
expertise: 5 sensitivity: 5 
CMake was unable to configure this project.Click here for more details.
Go here to access the main testing dashboard.
Reviews
Quick Comments
Resources
|
|
| Download All | |
| Download Paper , View Paper | |
| Download Source code | |
| Source code repository | |
Statistics more
|
|
| Global rating: |
|
| Review rating: | [review]
|
| Code rating: |  
|
| Paper Quality: |
|
Information more
|
|
| Categories: | Data Representation, Mesh |
| Keywords: | QuadEdgeMesh, ITK, Planar Mesh, Triangulation |
| Toolkits: | ITK, CMake |
| Export citation: | |
Share
|
Linked Publications more
|
||
A Skull-Stripping Filter for ITK
by Bauer S., Fejes T., Reyes M.
|
||
Laplace Beltrami Filter on QuadEdge Meshes
by Bowers M., Younes L.
|
||
View license
Loading license...
Send a message to the author
