Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Half-edge representation, CGAL vs OpenMesh

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Half-edge representation, CGAL vs OpenMesh


Chronological Thread 
  • From: Pierre Alliez <>
  • To:
  • Subject: Re: [cgal-discuss] Half-edge representation, CGAL vs OpenMesh
  • Date: Wed, 12 Jan 2011 15:01:43 +0100
  • Organization: INRIA

dear Nicholas,

openmesh is less generic but easy when dealing with many attributes.
although you can use boost property map with CGAL.

tell us more the algorithms you plan to use/implement, ok?

pierre


Le 05/01/2011 13:06, Nicholas Mario Wardhana a écrit :
Hi all,

I am planning to use the half edge data structure in my research,
especially for edge-to-face traversal and edge iteration about a
vertex, and I found that the representation and the operations are
readily implemented in CGAL and OpenMesh, e.g. via their respective
circulators. Anybody has done a comparison between the two? So far I
found that in a related paper
(http://www.graphics.rwth-aachen.de/uploads/media/openmesh.pdf),
OpenMesh boasts its efficient handling of dynamic structure, which
CGAL does not seem to accommodate, but this paper is quite old
(published in 2002). On the other hand, CGAL's polyhedron tutorial
(http://www.cgal.org/Tutorials/Polyhedron/tutorial.pdf) only mentions
that the √3-subdivision is faster in CGAL, but I do not need this
feature. Googling and digging up the archives do not really help.

I am better-acquainted to CGAL, so this is one advantage to me,
whereas I only recently know OpenMesh. Nevertheless, I will consider
the trade-off between the two libraries.

By the way, please correct me if I make any mistake here.

Thank you!

Best regards,
Nicholas Mario Wardhana



--
Pierre Alliez
INRIA Sophia Antipolis - Mediterranee
http://www-sop.inria.fr/members/Pierre.Alliez/




Archive powered by MHonArc 2.6.16.

Top of Page