Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Intersection between two sets of points in 3D space

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Intersection between two sets of points in 3D space


Chronological Thread 
  • From: "Sebastien Loriot (GeometryFactory)" <>
  • To:
  • Subject: Re: [cgal-discuss] Intersection between two sets of points in 3D space
  • Date: Tue, 06 Sep 2016 23:19:56 +0200
  • Authentication-results: mail3-smtp-sop.national.inria.fr; spf=None ; spf=Pass ; spf=None
  • Ironport-phdr: 9a23:jB4OAxbHy6f7XsDtMgHTTHL/LSx+4OfEezUN459isYplN5qZpM+/bnLW6fgltlLVR4KTs6sC0LuP9f64EjRaqdbZ6TZZIcQKD0dEwewt3CUYSPafDkP6KPO4JwcbJ+9lEGFfwnegLEJOE9z/bVCB6le77DoVBwmtfVEtfre9JIfegoyN2vyo/NWLOkMT1WP7P+s5dE/+7V2I8JJH2c06cud54yCKi0MAQ/5Ry2JsKADbtDfHzeD0wqRe9T9Nsekq7c9KXPayVa05SbtFEGZuaDhtt4W4/STFVhaFs3sATn0NwF0PGBnA9Bi8X5HrsyK8uPA6wzifJcSxTLY6XnOp4K5vDRPpkywaLCVqzGaCgcN5iOdXoQmqugdk64/SeoCccvRkLY3HetZPD1FMVM9KSy1MBMuYaJEOCPZJfclVqIzwu0EfgxK1GQ62FaKlgmtTgnjs3KomleElOQ7D1Q0kWdkJtSKH/53OKK4OXLXtn+HzxjLZYqYO1A==
  • Organization: GeometryFactory

I suggested trying this:

http://doc.cgal.org/latest/Advancing_front_surface_reconstruction/index.html#Chapter_Advancing_Front_Surface_Reconstruction

Sebastien.

On 09/05/2016 07:39 PM, Vahid Azizi wrote:
Thank you so much Sebastien.

As you pointed out for first point set i make a mesh with Delaunay
triangulation. I tried also convex hull but because of distribution of
my points it returns the internal convex hull which is not what i want.
By the way triangulation gives me the volume that i want. Now i want to
find intersection of this volume with a 3D convex hull. As i understand
i need to iterate over all faces in resulted mesh and find intersection
with convex hull and then the union of the intersected points give me
the the bounded intersection. Am i right or is there a better way to do
that?
Thanks in advance.

Best,
Vahid


On Mon, Sep 5, 2016 at 6:53 AM, Sebastien Loriot (GeometryFactory)
<

<mailto:>>
wrote:

You can have a look at the surface reconstruction algorithms here:

http://doc.cgal.org/latest/Manual/packages.html#PartReconstruction
<http://doc.cgal.org/latest/Manual/packages.html#PartReconstruction>

In particular, advancing front might be the one you are looking to
if you need to interpolate your input points.

Sebastien.


On 09/02/2016 10:20 PM, Vahid Azizi wrote:

Hi all,

I have two sets of points in 3D coordinate system, More
precisely based
on my work one set is supposed to be a polyhedron or a complex
volume
and one set is just a 3D convex hull. I have only the
coordinates of the
points. and finally i want to find their bounded intersection. what
would you suggest for handling this problem? do i need to make a
polyhedron or triangles from first set or there is other
options? and
what would you suggest for intersection? Any general
information, links,
tips are appreciated.
Thank you so much in advance.

Best,
--
/Vahid/



--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://sympa.inria.fr/sympa/info/cgal-discuss
<https://sympa.inria.fr/sympa/info/cgal-discuss>





--
/Vahid/




Archive powered by MHonArc 2.6.18.

Top of Page