Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] point location/interpolation on a 2d mesh

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] point location/interpolation on a 2d mesh


Chronological Thread 
  • From: Hansjoerg Seybold <>
  • To:
  • Subject: Re: [cgal-discuss] point location/interpolation on a 2d mesh
  • Date: Mon, 24 Jan 2011 14:33:39 +0100

Hi,
thanks a lot for the answer.
Yes, i want to use the results from another program to postprocess
with a cgal.
The mesh is only flat 2d, so it is a simple 2d triangulation problem.
The mesh has a complex geometry of holes, which i want to exclude from
the calculation of the interpolation.

I could try to load the mesh vertices and create a delaunay triangulation,
but then i need a way to mark/exclude the hole parts,
thus i was thinking of using the 2d mesh class with triangulation hierarchy

cheers hj


On Mon, Jan 24, 2011 at 9:31 AM, Sebastien Loriot (GeometryFactory) <sloriot.ml@gmail.com> wrote:
Hansjoerg Seybold wrote:
Hello,
Hello I would like to calculate interpolated values from vertices on a 2d mesh.
My problem is as follows:
- I have a mesh given by vertices and constraints (i know the boundary and the partitioning of the space (holes) )

-  With this information i would like to create a cgal mesh to perform interpolation operations of lets say the velocity field stored in the
  vertices.

I saw the cgal interpolation page and the point location page for the triangulation.
Is it also possible to use the triangulation hierarchy on a mesh for efficient point location.
I need a mesh to determine what is inside and what is outside as the domain has holes or is there a simpler way to perform interpolation/and determining inside/outside like in the mesh case.
 Thank you very much
  hj

From what I understand, you have a surface mesh with hole that you computed (not using CGAL surface mesher) and you want:
1) determine whether a point is on your surface
2) use CGAL::surface_neighbor_coordinates_3 only on points detected on
  your surface

For 1) using AABB_tree and closest_point_and_primitive might help
(http://www.cgal.org/Manual/latest/doc_html/cgal_manual/AABB_tree/Chapter_main.html#Section_62.6).

Using the triangulation hierarchy will be complicated as you first need
to have a your surface included into a 3D triangulation.

S.

--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss





Archive powered by MHonArc 2.6.16.

Top of Page