Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Centroid of a linear cell complex

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Centroid of a linear cell complex


Chronological Thread 
  • From: Pranav <>
  • To:
  • Subject: Re: [cgal-discuss] Centroid of a linear cell complex
  • Date: Tue, 7 Jul 2015 01:16:45 -0700 (PDT)

Hi Guillaume,

Guillaume Damiand wrote
> Probably as with any other data structure: iterate through all the
> points and sum up the coordinates to compute at the end the centroid ?

Actually, I want to perform the inside-outside test to determine whether a
given tetrahedron is inside a linear cell complex or not. For this purpose,
I thought of using ray-casting
<https://en.wikipedia.org/wiki/Point_in_polygon#Ray_casting_algorithm>
approach by determining number of intersections between a random ray having
centroid of tetrahedron and centroid of linear cell complex(LCC) as its
endpoints and each boundary 2-cell of lcc.

I have tried your suggested approach but it returned 0 intersections which
is only possible if either the assumed centroid of LCC is outside LCC or the
code has bug.

Would you please suggest if any other approach should be used to perform
inside/outside test on lcc for a tetrahedron?





--
View this message in context:
http://cgal-discuss.949826.n4.nabble.com/Centroid-of-a-linear-cell-complex-tp4660975p4660980.html
Sent from the cgal-discuss mailing list archive at Nabble.com.



Archive powered by MHonArc 2.6.18.

Top of Page