Subject: CGAL users discussion list
List archive
- From: Panagiotis Foteinos <>
- To:
- Subject: Re: [cgal-discuss] Re: Infinite recursion in Delaunay_d
- Date: Wed, 13 Oct 2010 13:33:51 -0400
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:in-reply-to:references:date:message-id:subject:from:to :content-type; b=QtD4+qFCAFJxAOth5+2f1qy0BJerkYKrtw7Bv7aBppjPETPqyButJ0HUI1goif5kp5 alvd76hjEnuw/rI0EuKdxI3a0SEyme0SIa7r5jrxr+eIwVXuDEkvdpAtc/kf1Yn9JFKc Rw0mMt/gjBlzOTC7aY6seM6pvgK+NAawv6V/Y=
Hello.
I am wondering if I could also access the new Delaunay_d implementation.
I am implementing a 4D refinement algorithm on the current Delaunay_d structure. It is slow and cannot handle degeneracies well.
Best Regards,
Panagiotis Foteinos
On Thu, Oct 15, 2009 at 11:09 AM, Samuel Hornus <> wrote:
Mathieu Brédif <> wrote:Yes yes. I'll try do send you the necessary information and code as soon
> would it be possible for me to beta test this new Delaunay_d
> implementation ?
as possible (tonight or tomorrow).
Cheers,
Samuel
--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss
- Re: [cgal-discuss] Re: Infinite recursion in Delaunay_d, Panagiotis Foteinos, 10/13/2010
Archive powered by MHonArc 2.6.16.