Subject: CGAL users discussion list
List archive
- From: "Marcos R. P." <>
- To:
- Subject: Res: [cgal-discuss] Next Face
- Date: Tue, 27 Oct 2009 04:41:02 -0700 (PDT)
- Domainkey-signature: a=rsa-sha1; q=dns; c=nofws; s=s1024; d=yahoo.com.br; h=Message-ID:X-YMail-OSG:Received:X-Mailer:References:Date:From:Subject:To:In-Reply-To:MIME-Version:Content-Type; b=L0UYCvg9DjDqENgbKMONVf25hARxM/CsjfVW7gFcErY27gkKuAHwRp6ruy+VMJxcEnTbVpNKcMrJnM9ePJATP8KejK0Uu0mRo5DX42BoUZIIwFdKY8tsY0Ve8K1yvYyMH0IAlXk204g3bo0J/JQ2cZanVTJUYLeyq17938GOaBU=;
In the 2,621 page of cgal_manual.pdf there are the following information:
"In particular, we can basically perform every operation we can perform in a standard DCEL data structure:
•
go from a halfedge to its next and previous in the face;•
go from one face to an adjacent one through a halfedge and its twin (opposite) halfedge;•
walk around the boundary of a face;•
enumerate/traverse the halfedges incident to a vertex•
from a halfedge, access the adjacent face;•
from a face, access an adjacent halfedges;•
from a halfedges, access its source and target vertices;•
from a vertex, access an incident halfedge.In addition to the above possibilities for traversal, we can also traverse the following features through iterators:
•
the vertices of the Voronoi diagram;•
the edges or halfedges of the Voronoi diagram;•
the faces of the Voronoi diagram;•
the bounded faces of the Voronoi diagram;•
the bounded halfedges of the Voronoi diagram;•
the unbounded faces of the Voronoi diagram;•
the unbounded halfedges of the Voronoi diagram;•
the sites defining the Voronoi diagram."Remember that "intelliSense" of my Visual Studio 2008 don't works.
De: Marcos R. P. <>
Para:
Enviadas: Seg, Outubro 26, 2009 2:43:29 PM
Assunto: [cgal-discuss] Next Face
De: Marcos R. P. <>
Para: cgal discuss <>
Enviadas: Seg, Outubro 26, 2009 2:28:59 PM
Assunto: [cgal-discuss]
Veja quais são os assuntos do momento no Yahoo! + Buscados: Top 10 - Celebridades - Música - Esportes
Veja quais são os assuntos do momento no Yahoo! + Buscados: Top 10 - Celebridades - Música - Esportes
De: Marcos R. P. <>
Para:
Enviadas: Seg, Outubro 26, 2009 2:43:29 PM
Assunto: [cgal-discuss] Next Face
Errata.
Sorry!
The matter is "Next Face"
The code is:
VD::Face_iterator fit = vd.faces_begin();
for( ; fit != vd.faces_end(); ++fit ){
std::cout <<
"\nFace " << std::endl;print_faceVertices( &vd.bounded_face() );
std::cout << std::endl;
}
//fim forDe: Marcos R. P. <>
Para: cgal discuss <>
Enviadas: Seg, Outubro 26, 2009 2:28:59 PM
Assunto: [cgal-discuss]
Hi!
How could I get the next face of VD?
The following code would must print all the bounded faces of VD but it prints the same face throughout the loop for.
VD::Face_iterator fit = vd.faces_begin();
for( ; fit != vd.faces_end(); ++fit ){
std::cout <<
"\nFace " << std::endl; if( vdprint_faceVertices( &vd.bounded_face() );
std::cout << std::endl;
}
//fim for
Thank you!
MRP.
Veja quais são os assuntos do momento no Yahoo! + Buscados: Top 10 - Celebridades - Música - Esportes
Veja quais são os assuntos do momento no Yahoo! + Buscados: Top 10 - Celebridades - Música - Esportes
Veja quais são os assuntos do momento no Yahoo! + Buscados: Top 10 - Celebridades - Música - Esportes
- [cgal-discuss], Sterpa, 10/19/2009
- Re: [cgal-discuss], Laurent Rineau (GeometryFactory), 10/19/2009
- Re: [cgal-discuss], Ariel Baez, 10/19/2009
- Re: [cgal-discuss], Marco Aurelio Sterpa, 10/19/2009
- Re: [cgal-discuss], Ariel Baez, 10/19/2009
- <Possible follow-up(s)>
- [cgal-discuss], Marcos R. P., 10/26/2009
- [cgal-discuss] Next Face, Marcos R. P., 10/26/2009
- Res: [cgal-discuss] Next Face, Marcos R. P., 10/27/2009
- Re: [cgal-discuss] Next Face, Samuel Hornus, 10/27/2009
- Res: [cgal-discuss] Next Face, Marcos R. P., 10/27/2009
- Res: [cgal-discuss] Next Face, Marcos R. P., 10/27/2009
- Res: Res: [cgal-discuss] Next Face, Marcos R. P., 10/28/2009
- [cgal-discuss] Next Face, Marcos R. P., 10/26/2009
- [cgal-discuss], Zohar Levi, 10/29/2009
- Re: [cgal-discuss], Laurent Rineau (GeometryFactory), 10/19/2009
Archive powered by MHonArc 2.6.16.