cgal-discuss - Re: [cgal-discuss] is_simple() precondition in Polygon_2 algorithms

Subject: CGAL users discussion list

List archive

From: Remi <>
To:
Subject: Re: [cgal-discuss] is_simple() precondition in Polygon_2 algorithms
Date: Thu, 30 Sep 2010 11:44:20 +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; b=kRnI02IRCDjHT0h586+9i29aGnEAAwgwfT8w1OOHDakLZduObF2ORhmV3JzEYmrV9W 1BUEgmk1lSg9cZxWvEwLO+iMs6brmYXRAV+xMA+XGdhlisT8F8RJJ5VlEQrbvXBMmsZb Xm1lU9DSE0KlgLdQJa5pZN0yDTpphp5I9iY3I=

Hi, by relatively simple I mean what's in here:
http://www.cgal.org/Manual/3.6.1/doc_html/cgal_manual/Boolean_set_operations_2/Chapter_main.html#Section_19.2
"A Relatively simple polygon allows vertices with a degree>2, but all of its edges are disjoint in their interior."

[cgal-discuss] is_simple() precondition in Polygon_2 algorithms, Remi, 09/29/2010
- Re: [cgal-discuss] is_simple() precondition in Polygon_2 algorithms, Stefan Schirra, 09/30/2010
  - Re: [cgal-discuss] is_simple() precondition in Polygon_2 algorithms, Remi, 09/30/2010
    - Re: [cgal-discuss] is_simple() precondition in Polygon_2 algorithms, efif, 09/30/2010