Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] How to retrieve handles of vertices which constitute an edge in a 3D triangulation?

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] How to retrieve handles of vertices which constitute an edge in a 3D triangulation?


Chronological Thread 
  • From: "Jingyi Jin" <>
  • To:
  • Subject: Re: [cgal-discuss] How to retrieve handles of vertices which constitute an edge in a 3D triangulation?
  • Date: Mon, 21 May 2007 17:12:46 -0500
  • Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=beta; h=received:message-id:date:from:to:subject:in-reply-to:mime-version:content-type:content-transfer-encoding:content-disposition:references; b=UOzxP81mFdKe3vFslQ9i/H/o4YbRc/IOeEu/ztZO/XTL5uKOdJgbeJNUugk5XBekdukNNCKNXd0QVf/IZp2l0FjFsxksYC+9L59Woqn1UitFbi59wqXHXP4+4BsDrapK5yOviFA5irzb+anMrXnrgKSLlZOV8QZGdXTyMF4cdGM=
Hi,

Following a previous post to ask one question..

----------------------------------------------------------------------------
On 5/4/07,

<>
wrote:

In 2D, having an edge circulator is natural and meaningful: edges are
ordered around a vertex. In 3D edges are not circularly ordered around a
vertex.
----------------------------------------------------------------------------

If I want to retrieve all incident edges of a vertex, what is the best
way to do that? The order does not matter in my application.

Thanks a lot!

Jingyi

Archive powered by MHonArc 2.6.16.

Top of Page