Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Re: Delaunay Triangulation - number of edges

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Re: Delaunay Triangulation - number of edges


Chronological Thread 
  • From: Dennis Endt <>
  • To:
  • Subject: Re: [cgal-discuss] Re: Delaunay Triangulation - number of edges
  • Date: Sun, 02 Nov 2008 16:52:48 +0100
  • Domainkey-signature: a=rsa-sha1; c=nofws; d=googlemail.com; s=gamma; h=message-id:date:from:user-agent:mime-version:to:subject:references :in-reply-to:content-type:content-transfer-encoding; b=RFZitigruOhxFKEdQUzoVbOoJL1I9ajlnFf4bievL1UbWzAe+ij1NhSajGjLH2OML2 cY54b/M4L0+MJOcefFQOPnoHK5yhQVrODC2ltjcU53HGs+PokP0TTolDqe1MIXc/QNbU EfYmF14rbdYvJU05QqlSPAKuHHyzvzSLatOrA=

Hi Monique,

yes I have had a look.

But it seemed to work with the 3d Delaunay Triangulation and so it
didn`t matter.

But now I found this situation.

So plz tell me if I`m wrong:

Because I don`t know which wall is a vertical or a horizontal wall and
so on I would use:

CGAL::Triangulation_euclidean_traits_xy_3<K>
CGAL::Triangulation_euclidean_traits_xz_3<K>
and CGAL::Triangulation_euclidean_traits_yz_3<K>

for every of my fassades and then merge the results of all of them?

Could this work? Or is there a more simple way to do this?

Two other questions:
How do I get the points of an edge of a 2d Delaunay Triangulation:

for(Delaunay::Finite_edges_iterator ie = T.finite_edges_begin(); ie !=
T.finite_edges_end(); ie++)
{
ie->first->vertex(ie->second)->point() // doesn`t work so far
ie->first->vertex(ie->third)->point()
}

What`s wrong on this:
for(Delaunay::Finite_faces_iterator it = T.finite_faces_begin(); it !=
T.finite_faces_end(); it++)
{
Triangle_3 delaunayTriangle = T.triangle(*it); // error
}






Archive powered by MHonArc 2.6.16.

Top of Page