Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Triangulation 3D (I'm SORRY that I forgot to change the subject)

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Triangulation 3D (I'm SORRY that I forgot to change the subject)


Chronological Thread 
  • From: "Hui DING" <>
  • To: <>
  • Subject: Re: [cgal-discuss] Triangulation 3D (I'm SORRY that I forgot to change the subject)
  • Date: Tue, 6 May 2008 16:51:55 +0200

Another question, please, can the Point be negative? because my data are mixed with negatives and positives. values.


----- Original Message ----- From: "Hui DING" <>
To:
<>
Sent: Tuesday, May 06, 2008 4:35 PM
Subject: Re: [cgal-discuss] Triangulation 3D (I'm SORRY that I forgot to change the subject)


Thanks a lot!

And the GeomView works now on my windowsXP with help of Cygwin, but can I use the CGAL interface to GeomView on platform VC++? if no, how can I view the 3D object with the triangulation information?

----- Original Message ----- From: "Manuel Caroli" <>
To:
<>
Sent: Tuesday, May 06, 2008 3:22 PM
Subject: Re: [cgal-discuss] Triangulation 3D (I'm SORRY that I forgot to change the subject)


Hui DING wrote:
If you are computing a Delaunay or regular Triangulation of a non-degenerate point set, then this is uniquely defined. Therefore the resulting triangulation is always the same. Even if the point set is degenerate CGAL gives you always the same triangulation.
If you are not computing a Delaunay or regualar triangulation then it depends on the order in which you insert the points.

Note that the indices as written above can change of course.
- In the example 27.6.1, it uses the Triangulation_3, I never change the order of insertion, why it changes too? (sometime the number of cells is 12, sometime is 11)?
There is some randomization involved in order to accelerate the algorithm.

Be aware that a triangulation of 5 points in IR^3 can consist of either 2 or 3 tetrahedra.

I cite from the manual:
template < class InputIterator >
int t.insert ( InputIterator first, InputIterator last)
Inserts the points in the range [.first, last.). Returns the number of inserted points. Note that this function is not garanteed to insert the points following the order of InputIterator.
Precondition: The value_type of first and last is Point.


best

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

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




Archive powered by MHonArc 2.6.16.

Top of Page