Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Douglas Peuker and friends

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Douglas Peuker and friends


Chronological Thread 
  • From: Hadrien Hamel <>
  • To:
  • Subject: Re: [cgal-discuss] Douglas Peuker and friends
  • Date: Wed, 26 Aug 2009 10:30:12 +0200
  • Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:in-reply-to:references:date:message-id:subject:from:to :content-type:content-transfer-encoding; b=ndQfORp2LGDJy2JaElYLfRnf+RyIgq53KrSVzJvVnhR8sQlmcHvHupudx368VyhYGk yPqFQaIbIh6LZy9hQe1Tg7EtQfpWXDlljIrwlnCQNXljZ+1LxccFx9l7wRcfY6JyKypb vFa9jr8TMHqZzjaA/hj5vpxJhGAABSwBETXvA=
Hi all,

I have problems with my self-made DP implementation, because of the
intersecting polygons it generates. Since I want to do a constrained
delaunay triangulation with my simplified polygon afterwards, it fails
rather often, so I would be very interested in DP algorithm in CGAL.

On Wed, Aug 26, 2009 at 9:46 AM, Andreas
Fabri<>
wrote:
> we would be glad if you volunteered for becoming a guinea pig,
> as we have an algorithm in the development/submission pipeline that
> allows to simultaneously simplify many polylines in a topological
> correct way.

Andreas, where can we find the algorithm you are talking about? I'd be
happy to report bugs or success story with it :)

Regards,
Hadrien

Archive powered by MHonArc 2.6.16.

Top of Page