Skip to Content.
Sympa Menu

cgal-discuss - [cgal-discuss] Triangulated Surface Mesh Shortest Paths - distance threshold

Subject: CGAL users discussion list

List archive

[cgal-discuss] Triangulated Surface Mesh Shortest Paths - distance threshold


Chronological Thread 
  • From: Zohar <>
  • To:
  • Subject: [cgal-discuss] Triangulated Surface Mesh Shortest Paths - distance threshold
  • Date: Mon, 21 Nov 2016 10:06:20 -0800 (PST)
  • Authentication-results: mail3-smtp-sop.national.inria.fr; spf=None ; spf=Neutral ; spf=None
  • Ironport-phdr: 9a23:nAntNxyTAIfG7XTXCy+O+j09IxM/srCxBDY+r6Qd1OwRIJqq85mqBkHD//Il1AaPBtSAragfwLOO4+jJYi8p2d65qncMcZhBBVcuqP49uEgeOvODElDxN/XwbiY3T4xoXV5h+GynYwAOQJ6tL1LdrWev4jEMBx7xKRR6JvjvGo7Vks+7y/2+94fdbghMijexe61+IRu5oQnMqsUbgpZpJ7osxBfOvnZGYfldy3lyJVKUkRb858Ow84Bm/i9Npf8v9NNOXLvjcaggQrNWEDopM2Yu5M32rhbDVheA5mEdUmoNjBVFBRXO4QzgUZfwtiv6sfd92DWfMMbrQ704RSiu4qF2QxDvlCoKOT80/WXOhsBtkK5QvRatqhJjz4LIZY2YMud1cKHActMAXWdPUMZfWTJCDI2hYIQAE+UPMP1Er4T/vVYCsQeyCRWyCO7p1zRGhmX23ao/0+k5Eg7G2wwgEMgUsH/Jq9j0NaASUeCvw6nSyTXOYehb2Dfn54jIdRAhpuuAUq53ccrU0EQiER7OgFuXqYzgJTyV1+INvnCd7+V6Tu2gkGonpB9rrjezwccsj4/EjZ8WxFDc7Sh13Yc4KcOiREJlYdOpHoFcuzyUOoZ4WM8vTG9ltD4nxrAHp5K3ZjYGxZQpyhLFdvCKfYaF7gjjWeuTJzpzmWhrd6ilhxmo9Eit0u38Wdew0FZNtidFl9fNtncX1xzQ8MSHTOFy8Vy61jaLyQ/f8P1LIUcxlabDKp4hxKA/loYLvEjeHyL6hl/6gLGWe0gq4OSk9urqb7v8qpKTOYJ4kgT+Pb4vmsy7D+Q4KA8OX22D9OW9073j/Vf2QK9OjvA4iaTYsIrVJcQcpq6+GQNazoEj6xOnAze8zNsYhWUHLE5CeB+fk4fpNEvBIPThAfiiglSsiytkx+3dPr36GZjNNXjCkLL5fbln8UJcyQwzzcpe551OEL0BLujzCQfNs4nTARY9dgC12O36E85V14UEWGvJDLXKHrnVtAq64eImOaHYdogVsSz5cNA07v7pijkynlpLLvrh5ocedH3tR6cuGE6ee3e52Y9ZHA==


For each vertex on the surface, I'd like to get all the vertices in its
radius r vicinity (in terms of geodesic distance).
Currently, I run the algorithm for each vertex, setting it as a source
point. The algorithm in turn would calculate the distance to /all/ the
vertices, and afterwards I filter the results. This is inefficient. Can I
specify to the algorithm to not look further than a certain distance, or
maybe a certain BFS level?



--
View this message in context:
http://cgal-discuss.949826.n4.nabble.com/Triangulated-Surface-Mesh-Shortest-Paths-distance-threshold-tp4662387.html
Sent from the cgal-discuss mailing list archive at Nabble.com.


  • [cgal-discuss] Triangulated Surface Mesh Shortest Paths - distance threshold, Zohar, 11/21/2016

Archive powered by MHonArc 2.6.18.

Top of Page