Skip to Content.
Sympa Menu

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

Subject: CGAL users discussion list

List archive

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


Chronological Thread 
  • From:
  • To:
  • Subject: Re: [cgal-discuss] is_simple() precondition in Polygon_2 algorithms
  • Date: Thu, 30 Sep 2010 18:44:55 +0200

The simple and relatively simple properties are used to characterize polygons that are operands of operations provided by the 2D Regularized Boolean Set Operation package. All these operations construct an arrangement from the input polygons. The knowledge of these properties can be used to expedite the construction.

The bounded_side() operation is not provided by the 2D Regularized Boolean Set Operation package, so it may have other preconditions.

Quoting Remi
<>:

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."

--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss


--
____ _ ____ _
/_____/_) o /__________ __ //
(____ ( ( ( (_/ (_/-(-'_(/
_/





Archive powered by MHonArc 2.6.16.

Top of Page