Subject: CGAL users discussion list
List archive
- From: "Shi Yan" <>
- To:
- Subject: [cgal-discuss] how to connect two disjointed triangles by their edge?
- Date: Mon, 22 Dec 2008 15:50:54 -0800
- 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=GuQWYmAombInUf0QOaQ65zgdCpJ4WXC6hysnlxBsufuAdKfsTJYiaQVoQdVMArGQjP h+HNTuNWcyvbYO40nZ0nPH98RPm4kl7+8evF5Sm7s2w/WW4q/w0YW3p3eZ+V2MEAwDeU SR8FIpm+DOobiYDfRlt3xaG+4IwpzSBkjAYHw=
hello guys,
it is said that the euler operations of the half-edge data structure
should be able to achieve any kind of modifications. however, i often
feel trouble doing modifications with euler operations.
for example, i have a very simple task here: two disjointed pieces of
mesh needs to be attached along some part of their border. the
simplest case would be connect two triangles by one of their edge.
how can i do that with the euler operations provided by CGAL?
thank you.
- [cgal-discuss] how to connect two disjointed triangles by their edge?, Shi Yan, 12/23/2008
Archive powered by MHonArc 2.6.16.