Skip to Content.
Sympa Menu

cgal-discuss - Tracking vertex properties

Subject: CGAL users discussion list

List archive

Tracking vertex properties


Chronological Thread 
  • From: "Tim Keitt" <>
  • To:
  • Subject: Tracking vertex properties
  • Date: Wed, 9 Apr 2008 11:22:25 -0500
  • Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=message-id:date:from:to:subject:mime-version:content-type:content-transfer-encoding:content-disposition; b=iZTdJAE/v4DmhfqBPoDfociODc+irg9TRF9VPGu1/oaaeAu0NQLdan54SSPhIdl89SfCFuIn8VPEcTyt7CjnfxXc+n/YU5uQqs4GJmZZx0SOTkxo0wWlBVTve1cHqcVH1Oe1ntuh7UIvdb6KvNHnUA/YuzRJ2jmdpOQUqOn/EbU=

I need to make a triangulation of points where each point has a color.
When I'm done, I want to extract the triangulation and eliminate edges
that have the same color on each end. This is my first attempt at
using CGAL, so I am a little confused about how I can keep track of
the identity of a vertex (or its properties) once it has been inserted
into eg a Delaunay object. If I insert points as triples (x, y, color)
will I then have access to the color when I iterate over edges in the
triangulation?

I was looking at the example:

http://www.cgal.org/Manual/3.3/examples/Triangulation_2/terrain.cpp

and noticed that the input file "data/terrain.cin" has four columns.
(It appears you have to download the entire source in order to find
this out -- a link in the HTML docs would be welcome!) What is the
fourth column? Is that what I am looking for?

THK

--
Timothy H. Keitt, Assistant Professor
University of Texas at Austin http://www.keittlab.org/
Contact info and schedule at http://www.keittlab.org/~tkeitt/
Please support open document formats http://opendocument.xml.org/



Archive powered by MHonArc 2.6.16.

Top of Page