Subject: CGAL users discussion list
List archive
- From: helviett <>
- To:
- Subject: [cgal-discuss] Algorithm to union set of polygons
- Date: Tue, 4 May 2021 00:13:17 -0500 (CDT)
- Authentication-results: mail2-smtp-roc.national.inria.fr; spf=None ; spf=SoftFail ; spf=Pass
- Ironport-hdrordr: A9a23:JnAqz6l6jZrqop9lxnT8YuWFMQDpDfIk3DAbvn1ZSRFFG/GwusiykJ0guSPcpy0WXBgb9OyoHKWbW3vT+dpU7OAqU4uKZwXttGu2IIwK1+KLqAHIITH09eJWyM5bHJRWNduYNzJHsfo=
- Ironport-phdr: A9a23:DIsAbhLVfw5kiloTGNmcuMFmWUAX047cDksu8pMizoh2WeGdxfzKAkXT6L1XgUPTWs2DsrQY0ruQ6fu8EjVav96oizMrSNR0TRgLiMEbzUQLIfWuLgnFFsPsdDEwB89YVVVorDmROElRH9viNRWJ+iXhpTEdFQ/iOgVrO+/7BpDdj9it1+C15pbffxhEiCCybL9vKBi6txvdu8cZjIdtN6o91BrEqWZUdupLwm9lOUidlAvm6Meq+55j/SVQu/Y/+MNFTK73Yac2Q6FGATo/K2w669HluhfFTQuU+3sTSX4WnQZSAwjE9x71QJH8uTbnu+Vn2SmaOcr2Ta0oWTmn8qxmRgPkhDsBOjUk9mzcl85+g79BoB+5qRJxw5DaboKIOvVxYqzTcsgXRXZDU8pNSyBNHp+wY5UJAuEcPehYtY79p14WoBu+GwasAP3vyj5WiX/qwa0xzuMsEQLY0wwkA9IBqm7UrNXrO6cWT+C1zbfHzSnfb/5N1jf97ZLHchElof2WQb1wds/RxFApGgjYgVqetZbrMCmJ1uQRrWeb9exgWPquhmM7qQx/rDqiy8Ysh4fJhowY117K+Th9zYorO9C1SlB3b966HZVQqiyUOYt7Tt4sTWx1uCs31LkLtJ6mcSYEzpks2hDRa/uCc4eS4xLjUv6cLit3hH1/fLKznRGy8VKvyuHkUMm7yk1FoTFBktbSrHwCyxvT6s2BR/Bg/UmhwS6C2x3X5+xAO0w5m6nWJ4Qiz7MxjJYesEXOEynrk0vslqCWbF8r+u2w5uTnfLrmopicOpdyigzxKKgunNawDv8jPQgKQWeX4/iz1Lrm/UHhQbVKiOM5krXBvZzHIckWorS1DgFW34o56BuyDi2q3dUZkHUfKVJKYhOHj4znO1HUJ/D4CO+yg1eynzdv2/DJJKfhApXTIXjHjrfhfKhy61JAyAcowtBf4ohbCrAFIP7pRkDxs9nYAgcjMwOo2+bnFMl91oQGVG2TDa+WKqfSvUaV6eIuOOmDeJIVuC3mK/U+/P7vjXo5mUcHcqWz3JsXbmq4HvV8LEmDb3rsmIRJLWBftQU3SKnmiUaJTCVIT3e0RaM1oD8hW6y8CoKWRo2pnr2MwDvzSp5bYnxPEFCBFWnpepmYc/gJYSOWZMRml2pXBvCaV4Y92ET250fBwL19I7+MkgUo8Kn73d0w3NX90Ako/FRcAMGU0mXLRGZxzDtgbw9z57h2pAlG8nnG0aV8hJRwE4AV4fpDWAM3c5Xbyr4jY/jCHznZd9LMc26IB9CvADU/VNU0q/cBZk98H5OpiRWRhEKX
Hello, I'm a student of Far Eastern Federal University and currently work in
a field of computational geometry and optimization methods. I wonder what
algorithm do you use to effectively calculate union of polygon set. I
understand that the main part of it is Bentley-Ottmann technique to find
intersection points (or Chazelle's improved version) but what is used to
retrieve resulting polygon set? I've read plenty of articles about polygon
clipping (Greiner-Hormann, Martinez, etc.) but classical versions of these
algorithms are unable to handle a set of simple polygons with holes that
may intersect with each other (I may be wrong but it seems so).
By the way the cgal.org is inaccessible from Russia for a week or two for no
reason. What happened?
--
Sent from: http://cgal-discuss.949826.n4.nabble.com/
- [cgal-discuss] Algorithm to union set of polygons, helviett, 05/04/2021
Archive powered by MHonArc 2.6.19+.