Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Re: performance of 3D-Booleans

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Re: performance of 3D-Booleans


Chronological Thread 
  • From: Peter Hachenberger <>
  • To:
  • Subject: Re: [cgal-discuss] Re: performance of 3D-Booleans
  • Date: Tue, 28 Aug 2007 18:17:12 +0200

Hi Carlos,

can you access the following link? There you find my test results on
Nef_polyhedron_3.

http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6TYS-4NDMN9J-3&_user=499892&_coverDate=09%2F30%2F2007&_rdoc=1&_fmt=&_orig=search&_sort=d&view=c&_acct=C000024518&_version=1&_urlVersion=0&_userid=499892&md5=69e84e1b3e10fe59800d9b78826f1bf4

Peter

On Fri, 2007-08-17 at 21:58 +0200,

wrote:
> Hi,
>
> Let me share some of my performance numbers; I hope this opens up the
> discussion.
>
> I have a small prototype that calculates triangle-triangle intersections.
> If my initial points have 8 significant digits, I can calculate
> 170K intersctions per second using extended arithmetic operations. The
> results of the intersections will be stored as exteded precision rational
> numbers. (That is, the results of the numerator and denominator require
> more than 64 bits each.)
>
> Does anyone have any performance numbers to share?
>
> Thanks,
> Carlos



Archive powered by MHonArc 2.6.16.

Top of Page