cgal-discuss - [cgal-discuss] quadric error simplification is extremely slow.

Subject: CGAL users discussion list

List archive

[cgal-discuss] quadric error simplification is extremely slow.

From: "Shi Yan" <>
To:
Subject: [cgal-discuss] quadric error simplification is extremely slow.
Date: Tue, 9 Sep 2008 23:28:39 -0700
Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=message-id:date:from:to:subject:mime-version:content-type :content-transfer-encoding:content-disposition; b=dvfI7vxHAxt8zYq4f5x/I+aAUITkzpvaIIkoCZQ6Cfd112/uVjwx8UtSCFTJM1J2Rv zg0/+ZmdvodCuoyXoeFsAA0Ku3XCRokAj9kgvYZI/30kIVLzm5g270tn6zBYI+OLTaTD 6LpkYjazG6iqnD0WMubJSSpCh3ZczyNPKPF68=

hello guys,

i need to use the edge collapsing simplification of CGAL, but it is
extremely slow.

it took me 8 hours to simplify an object with 600k faces down to 100k faces.

i did a profiling test with codeAnalyst by AMD under windows, the top
two routines that have the most time samples are tan() and strchr() in
the ntdll.dll,

this is really weird, because i don't think the simplification call
uses these two function calls at all.

can anyone give some advice on improving the performance of the
simplification method? i've tried meshlab, the simplification function
of meshlab is much much faster than that of CGAL.

[cgal-discuss] quadric error simplification is extremely slow., Shi Yan, 09/10/2008
- [cgal-discuss] Range or segment trees for point data, Jens K. Becker, 09/10/2008
  - Re: [cgal-discuss] Range or segment trees for point data, Andreas Fabri, 09/10/2008
    - Re: [cgal-discuss] Range or segment trees for point data, Jens K. Becker, 09/10/2008

List archive

[cgal-discuss] quadric error simplification is extremely slow.