Walk In A Triangulation : Straight Walk
Rigaud, Stephane, Gouaillard, Alexandre
Singapore Agency for Science Technology and Research
Please use this identifier to cite or link to this publication: http://hdl.handle.net/10380/3341
New: Prefer using the following doi: https://doi.org/10.54294/esnq73
Published in The Insight Journal - 2012 January-December.
Submitted by Alexandre Gouaillard on 2012-02-14 07:31:37.
This document describes the implementation in ITK of the Straight Walk in a Triangulation algorithm proposed by Devillers et al. Using the exact discrete geometrical orientation predicate, and the itk::QuadEdgeMesh API of ITK, we propose an efficient implementation that locates a point in a triangulated mesh structure. This paper is accompanied with the source code and examples that should provide enough details for users. This work has for principal intended an exact and robust implementation of a Delaunay triangulation / Voronoi tesselation in ITK, which will be presented in a separate paper, once done.
BibTeX
One