CGAL users discussion list

[Vitaliy <>]

Hi, Daniel.

the problem is that when you do flip - cell could change for the current edge.

I didn't check actually.

So, yes, it seems that triangulation data structure in CGAL is not well suited for such requests.

I am interested in solution as well.

Vitaliy

On Tue, Nov 3, 2009 at 11:41 AM, Daniel Duque <> wrote:

Hello,

I am thinking about efficiently adding info to the edges of a triangulation.
E.g., imagine you frequently need their lengths, and do not want to compute
them each time you need them, just once when the triangulation is built.

Since edges are not explicitly represented, I had the idea of using

Cell_circulator           tds.incident_cells ( Edge e)  Starts at an arbitrary cell
incident to e

to get one cell incident to an edge. The cell could be provided with info
relevant to the edge. E.g., a simple way would be to keep a 4x4 matrix, with
element i,j giving the info for the vertex with indices i,j.

My question is if this approach is (basically) sensible.

Also, I am assuming the "arbitrary" cell will always be the same one for a
given edge. I would be surprised if this was not the case.

BTW, there was a previous email from "400555 <  >" about this
last July, but it did not get any answers.

Best regards,

Daniel

--
Nueva dirección de e-mail!
--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss