TriRep class - edge constraints 3D Delaunay Triangulation

2 次查看（过去 30 天）
Romain W
Romain W 2012-5-18
评论： Anoop 2013-10-29
Hello everyone,
I have a 3D TriRep triangualtion imported within Matlab from an .stl file and created using:
tr = TriRep(f,v(:,1),v(:,2),v(:,3));
% original triangulation in face-vertex format f & v
I want to use a constrained DelaunayTri to perform a spatial search within my triangulation. As indicated in the spatial searching help, I need to use the previous triangulation tr to find all edges in the triangulation using:
Cedges = edges(tr); % does it work for 3D triangulation?
and then I was thinking to generate the Delaunay Triangulation simply using the following function:
dt = DelaunayTri(v,Cedges);
Is there any possibility to generate an edge constrained DelaunayTri sub-class in 3D from a TriRep? I do not want to implement the brute force that was proposed as a workaround for spatial searching since I have a high-number of triangles and need a faster approach.
Thank you for your help,
Romain
  3 个评论
显示 1更早的评论
Anoop
Anoop 2013-10-29
@Romain W, Were you able to find the solution for your problem. I am also stuck in the same situation and looking for a solution.
Thanks

请先登录，再进行评论。

请先登录，再回答此问题。

回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Triangulation Representation 的更多信息

标签

产品

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by