Subject: CGAL users discussion list
List archive
- From: "Suejung B. Huh" <>
- To:
- Subject: Re: [cgal-discuss] How to navigate Outputiterator for inicident_edges?
- Date: Wed, 14 Oct 2009 14:47:21 -0700
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:reply-to:in-reply-to:references:date:message-id :subject:from:to:content-type; b=HVylJirc79s/VwD8/53/Rhu234plTc9XOz/srshu3a5NGcz8nxwPEYCBrFVKfFpb9t gcWdyUgoYaPckgoepGRrkm4yiCVijRXhvLLwt2v2wm9axIqeTAP/6BncaJW5TVcaIeE/ BS4GLt0U4VyaqKh88gWDZLMU0lpvGKmBqcqLw=
Much Thanks, Andreas and Manuel,
Given a facet and a cell, what should I do to figure out the cell has the facet?
Also what is the usagae of Cell handle c here?
t.incident_cells ( Cell_handle c, int i, int j)
-s
On Wed, Oct 14, 2009 at 11:22 AM, Andreas Fabri <> wrote:
Hello Suejung,
this is covered in the Hello World programs in
http://www.cgal.org/Manual/last/doc_html/cgal_manual/Introduction/Chapter_main.html
best regards,
andreas
Suejung B. Huh wrote:
Thanks, Manuel,
But does anyone have an example code to use "OutputIterator"?
I am not sure how to use
t.finite_incident_cells ( Vertex_handle v, OutputIterator cells)
without ending condition.
Thanks in advance,
-s
On Fri, Oct 9, 2009 at 1:43 AM, Manuel Caroli < <mailto:>> wrote:
Dear Suejung,
<mailto:> wrote:
[...]
int main()
{
Delaunay T;
std::ifstream in("data/voronoi.cin");
Point p;
while(in >> p){
T.insert(p);
}
cout << "All Cells ----------------------------\n";
Cell_iterator cit =T.cells_begin();
for ( ; cit !=T.cells_end(); ++cit) {
if (! T.is_infinite(cit)) continue;
note that there is a Finite_cells_iterator that does this automatically
// T.incident_edges(cit) ?????? <<--- Want to find edges!!!
I am not sure to understand what you want to do. What do you mean by
edges incident to a cell? These are the edges of the cell that you
can extract immediately. There is a function incident_edges that
gives you the edges incident to a *vertex*. In this case you have to
provide it with an output iterator as second argument.
To understand the internal representation of a triangulation please
read chapter 35.1 of the user manual (of CGAL 3.6):
http://www.cgal.org/Manual/last/doc_html/cgal_manual/Triangulation_3/Chapter_main.html
For the available access functions see the reference documentation:
http://www.cgal.org/Manual/last/doc_html/cgal_manual/Triangulation_3_ref/Class_Triangulation_3.html
hope this helps
Manuel
}
return 0;
}
-- 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
- [cgal-discuss] How to navigate Outputiterator for inicident_edges?, suejunghuh, 10/09/2009
- Re: [cgal-discuss] How to navigate Outputiterator for inicident_edges?, Manuel Caroli, 10/09/2009
- Re: [cgal-discuss] How to navigate Outputiterator for inicident_edges?, Suejung B. Huh, 10/14/2009
- Re: [cgal-discuss] How to navigate Outputiterator for inicident_edges?, Manuel Caroli, 10/14/2009
- Re: [cgal-discuss] How to navigate Outputiterator for inicident_edges?, Andreas Fabri, 10/14/2009
- Re: [cgal-discuss] How to navigate Outputiterator for inicident_edges?, Suejung B. Huh, 10/14/2009
- Re: [cgal-discuss] How to navigate Outputiterator for inicident_edges?, Suejung B. Huh, 10/14/2009
- Re: [cgal-discuss] How to navigate Outputiterator for inicident_edges?, Manuel Caroli, 10/09/2009
Archive powered by MHonArc 2.6.16.