CGAL users discussion list

[brent <>]

hi all,

I am new to cgal (it is great and free as i know), but i have just spent a
lot of time on polygon offset algorithm.

Here is my demo app to offset simple polygons with holes: 

http://www.cppblog.com/Files/aqazero/OffsetDemo5_2.zip
To run it you need to install .net Framework 2.0 yourself if you don't have.

Although it is developed with C# windows form, but it is focused on polygon
offset and border creation. and it may be converted to C++ in the future.

thanks.

Best wishes.


Fernando Cacciola-3 wrote:
> 
> Hi Ben,
> 
>> Hi Y'all,
>>
>> Fernando would be the expert on computation time, but...if the goal is an
>> offset, an alternative to a straight skeleton would be to do a 'buffer'
>> type
>> operation, e.g. construct the offset curves piece-wise, dump them in an
>> arrangement, and use the arrangement to find the interior.
>>
> 
> FWIW, in CGAL 3.6, when you use the API that constructs offset curves
> directly (that is, when the straight skeleton is constructed under the
> hood), the skeleton is created only *partially*, just far enough to
> contain the offsets at the given distance.
> AFAICT this procedure should result in an effective running time even
> faster then using an arrangement.
> 
> OTOH, if the *entire* skeleton is constructed, this can take up much
> much more time.
> 
> Best
> 
> -- 
> Fernando Cacciola
> SciSoft Consulting, Founder
> http://www.scisoft-consulting.com
> 
> -- 
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://lists-sop.inria.fr/wws/info/cgal-discuss
> 
> 
> 
-- 
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/How-to-improve-the-speed-of-polygons-offsetting-in-CGAL-tp2362797p2533883.html
Sent from the cgal-discuss mailing list archive at Nabble.com.