CGAL users discussion list

[Guillaume Damiand <>]

Hi,

There is no existing available function for such test in CMap/LCC.

I think the first approach is better, and instead of testing the 
barycenter you can perhaps directly test the 4th point of the tetrahedron.

Best
Guillaume


Le 27/01/2015 07:42, Pranav a écrit :
> Hi,
>
> I have a tetrahedron and a polyhedron both represented in Linear Cell
> Complex form. There is a constraint that the tetrahedron always shares at
> least one 2-cell with polyhedron(i.e., it lies at boundary of the
> polyhedron).
>
> I want to test whether the tetrahedron lies inside the polyhedron. I can
> think of 2 /indirect/ approaches:
>
> 1. To take barycentre of the tetrahedron and test whether it lies inside
> polyhedron using the standard ray(emanating from barycentre in arbitrary
> direction)-polyhedron intersection counting approach.
>
> 2. Convert both tetrahedron and polyhedron in Nef polyhedron representation
> and perform intersection operation.
>
> I would like to know if there is any already available function/possibility
> in Combinatorial Maps framework?
>
>
>
>
> -----
> Thanks in advance,
> Pranav
> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/Linear-Cell-Complex-Testing-whether-a-tetrahedron-lies-inside-a-polyhedron-tp4660360.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.


--
===================================================================
Guillaume DAMIAND

CNRS - LIRIS UMR 5205
Université Claude Bernard
Bâtiment Nautibus (710)
43 Boulevard du 11 Novembre 1918
69622 Villeurbanne Cedex (France)
-------------------------------------------------------------------
Tél: +33 (0)4.72.43.14.34                 Fax: +33 (0)4.72.43.15.36
Mail: 

Web: http://liris.cnrs.fr/guillaume.damiand/
===================================================================

Attachment: smime.p7s
Description: Signature cryptographique S/MIME