CGAL users discussion list

[Josip Dzolonga <>]

We're using an exact predicates kernel, so that should not be an issue :) Thanks you !

On Thu, Nov 19, 2009 at 2:38 PM, Daniel Duque <> wrote:

On Thursday 19 November 2009 12:47:26 Josip Dzolonga wrote:
> Thanks, wouldn't something like std::pair<Point, Point> be nicer since
> Vertex handles are again bound to cells?

You would then need a std::map<pppair,info>, where pppair is a
std::pair<Point, Point>. Then, check whether two points are "close" (equality
can be tricky, that depends on the kernel).

It should work, but I think I prefer the std::map<edge,info> way...

Best,

Daniel

, that way you may access each vertex
> > uniquely. It
> > works just fine.
> >
> > Best,
> >
> > Daniel
> >
> > On Thursday 19 November 2009 02:40:46 Josip Dzolonga wrote:
> > > Hello,
> > >
> > > I am growing a region (on a 3D Delaunay triangulation), starting from
> > > one seed facet and then joining some of its neighbouring facets etc. To
> > > accomplish this I want to be able to keep the boundary edges in a set,
> > > however I might end up with different entries of the same edge because
> > > it can be accessed from different cells. Is there any way I can
> > > represent
> >
> > them
> >
> > > uniquely?
> > >
> > > Josip
> >
> > --
> > Nueva dirección de e-mail!
> >
> > --
> > You are currently subscribed to cgal-discuss.
> > To unsubscribe or access the archives, go to
> > https://lists-sop.inria.fr/wws/info/cgal-discuss

--

Nueva dirección de e-mail!

--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss