答复: 答复: [vtkusers] the adjacent vertex

[PAUL]

Hello DS:
void vtkPolyData::GetCellPoints  (  vtkIdType    cellId,  
  vtkIdList *    ptIds 
 )  [virtual]


But I don't know the cell id. The Ids of which cells containing the point of
interest is not always adjacent.

-----邮件原件-----
发件人: Dominik Szczerba [mailto:domi at vision.ee.ethz.ch] 
发送时间: 2007年1月4日 18:35
收件人: PAUL
抄送: vtkusers at vtk.org
主题: Re: 答复: [vtkusers] the adjacent vertex

You can locate the cell containing the point of interest and call
GetCellPoints().
DS

PAUL wrote:
> Hello all:
> 
> I have been baffled the question for a long time.
> 
> I am studying an algorithm of judging convex or non-convex polyhedron.
> 
> If  every  vertex  is above the plane which contain three vertexes
> adjacent to the vertex, the polyhedron is convex .
> 
> For an example, there are eight vertexes on a cube. And each vertex is
> adjacent to three other vertexes.
> 
> My question is:
> 
> When an arbitrary vertex is accessed, how to know the other three
> vertexes’ coordinate?
> 
>  
> 
> I need your helps! Thank you!!
> 
>  
> 
>  
> 
> ------------------------------------------------------------------------
> 
> *发件人:* vtkusers-bounces+polinzhuo=163.com at vtk.org
> [mailto:vtkusers-bounces+polinzhuo=163.com at vtk.org] *代表 *PAUL
> *发送时间:* 2007年1月4日 13:44
> *收件人:* vtkusers at vtk.org
> *主题:* [vtkusers] the adjacent vertex
> 
>  
> 
> Hi,all:
> 
> There is an arbitrary vertex on a polyhedron. How to find the other
> three vertexes which are adjacent to the vertex?
> 
> Paul
> 
>  
> 
> 
> ------------------------------------------------------------------------
> 
> _______________________________________________
> This is the private VTK discussion list. 
> Please keep messages on-topic. Check the FAQ at:
http://www.vtk.org/Wiki/VTK_FAQ
> Follow this link to subscribe/unsubscribe:
> http://www.vtk.org/mailman/listinfo/vtkusers