Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Fwd: Barycentric subdivision of n-dimensional simplex using CGAL

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Fwd: Barycentric subdivision of n-dimensional simplex using CGAL


Chronological Thread 
  • From: Muthukumaran Chandrasekaran <>
  • To: ,
  • Subject: Re: [cgal-discuss] Fwd: Barycentric subdivision of n-dimensional simplex using CGAL
  • Date: Wed, 15 Feb 2017 14:14:11 -0500
  • Authentication-results: mail2-smtp-roc.national.inria.fr; spf=None ; spf=Pass ; spf=None
  • Ironport-phdr: 9a23:p737kRJTHODFuiSTItmcpTZWNBhigK39O0sv0rFitYgUK/7xwZ3uMQTl6Ol3ixeRBMOAuq8C07Cd6vmwESxYuNDa7yBEKMQNHzY+yuwo3CUYSPafDkP6KPO4JwcbJ+9lEGFfwnegLEJOE9z/bVCB6le77DoVBwmtfVEtfre9ScbuiJG82Om2vpHSeA5VnyGVYLVoLRzwox+V/swfm4AkJaIw0QDEinpOYeVfg21ydnyJmBOpw9qs/INg7iFZofsnv+VAWKP2Za0jQL9RFj0gezQw59fis0CSHVan6X4VU2FQmR1NVVuWpCrmV4v853Op/tF23zOXaJX7
Dear Marc,

Thank you for getting back to me so quickly!

You could build a triangulation of your points, which has just one finite cell, then apply a variant of barycentric_subdivide from the example to it (the example works on the TDS, you would want to work on a full triangulation, with points with coordinates), and iterate on the resulting finite cells.

Is there an example/demo/code of how I could build a full triangulation of points (which has 1 finite cell)?

I am trying to read up on all this as quickly as I can. Apparently there is a LOT that I don't know about geometry :P. Its getting a little overwhelming. Any direction would immensely help.

Sincerely,
Muthu


--
Muthukumaran Chandrasekaran
Department of Computer Science
University of Georgia

Phone: 7062472873

Archive powered by MHonArc 2.6.18.

Top of Page