[Insight-developers] Depth of nested templates

[Yinpeng Jin]

yes, I agree, it should be a MeshToMeshFilter, which take input as mesh of
vertexCell and output as mesh of polygon.
but this is just a part of my segmentation class, i just want to keep it as
simple as possible. There is no point for me (for this particular algorithm)
to save the vertex into a mesh because I will be using them intensively, and
I feel it is more straighforward to just save the vertices into a
vector<Point> than into a mesh of vertexCell. otherwise, in order to
generate the Voronoi Diagram, I need to first generate a Mesh of vertex.
Sorry that I didn't take too much into accout of the whole architecture
orgnization, and quite frankly, I think our whole segmenation groups cannot
take care of this issue too much, since we didn't take part into the
development of the basic architecture and we are not really familar with
this issue.
So maybe in our future development, at least for our segmentation group, we
need to write down a brief proposal about what we are going to do, and the
architecture people can guide us with proper framework.
thanks,
Yinpeng

----- Original Message -----
From: "Will Schroeder" <will.schroeder@kitware.com>
To: "Yinpeng Jin" <yj76@columbia.edu>; "Insight Developers"
<insight-developers@public.kitware.com>
Sent: Wednesday, March 14, 2001 3:42 PM
Subject: Re: [Insight-developers] Depth of nested templates


> Hi Folks-
>
> Looking at the Voronoi class, I can't help but wonder why this is not a
filter? It's a subclass of Mesh?? If it is to exist in the data processing
pipeline, the algorithm should be separated from its input and
output...algorithm should be an eventual subclass of  ProcessObject and the
input and output should be subclasses of DataObject. (I'm not picking on
Yinpeng, there are other classes that could be filters that are not.)
>
> I think that we are not thinking in pipeline fashion. I think that it is
essential that the use and interface to classes is as uniform as possible.
>
> Will
>
>
>
> At 02:40 PM 3/14/2001 -0500, Yinpeng Jin wrote:
> >As Brad told me, I have this too deep nested template problem in my code:
> >
> >typedef   itk::Point<int,2> EdgeInfo;
> >std::vector< std::deque<EdgeInfo> > rawEdges;
> >
> >I don't know how far I can go. the first line should be fine since it is
> >just an instantiation of itkPoint.
> >can we go std::vector<EdgeInfo> or std::deque<EdgeInfo>?
> >any suggestion on this?
> >the problem is I have a list of polygon (size of the list is unkown), for
> >each polygon there will be a list of EdgeInfo (again the size of those
lists
> >are unknow).
> >
> >what if I know the size of the polygon list as an nonconstant varible.
> >are we allow to do this:
> >
> >typedef std::deque<EdgeInfo> EdgeInfoQ
> >EdgeInfoQ *rawEdges = new EdgeInfoQ[knowSize];
> >
> >I remember somebody addressed this standard C++ "new" operation issue
> >before, forgot the details.
> >
> >Yinpeng
> >
> >
> >
> >
> >
> >_______________________________________________
> >Insight-developers mailing list
> >Insight-developers@public.kitware.com
> >http://public.kitware.com/mailman/listinfo/insight-developers
>
>
> _______________________________________________
> Insight-developers mailing list
> Insight-developers@public.kitware.com
> http://public.kitware.com/mailman/listinfo/insight-developers