Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Optimal way to iteratively unite 2D triangles

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Optimal way to iteratively unite 2D triangles


Chronological Thread 
  • From: tfmk <>
  • To:
  • Subject: Re: [cgal-discuss] Optimal way to iteratively unite 2D triangles
  • Date: Mon, 18 Mar 2019 09:00:11 -0500 (CDT)
  • Authentication-results: mail2-smtp-roc.national.inria.fr; spf=None ; spf=Neutral ; spf=Pass
  • Ironport-data: A9a23:IYXaAqtss8CRFdTHytY2arKKvOfnOphVZiiLV/efNrXaqWXJ1wnKvf kOMKeiGm9/JIukcgRocK9l1auxrm+8rQKU97yPk/ELnBIAhJw/4vOnjhuDjALphbSMnnKTp7 qnyQ+3AGdmUKMWI3nzMAGE2PZTa7rNljvKAJIrCACFWDHWfn+OlS/SGyZjVOcOlRzI6PGKwO Ul4aqOuz57xIiW1Ft8ZBikmiYnsRA7Q8cnep4R5I90pLJ1xFnzl9MRSKgbR/xBp42XAGY/1C V4HfFlFj5StGw5Arn1aadFRLxxsuXItQJVBYqP00XQT27AA9PNhk16dFpBy3Od2kzD7S2sP6 B3sI7AxUpfP6cP3HmSDwt4nzauwtfniDhpH6LWB3i23xDAQshKpWe9AwNQUDGc/HLcOdTzIW 24tomH94KjDtGUKt2SFlVi+aTObkFTYcDAD9r1njiw0LrZ2DvwZcTW9IP5auQgllcEJJUyu/ RVjNaSmWSEmhX2eDNZGljTNhJ+/Fm0VLUStSln5yqcSkH+tVFQOPhju+o0s65Yh44cv+La4O ++AGx+5gD/EqmkVVazagoXfbiYkjOY6r2cMZ1fiNPdXLdohKXoUTjKVk8x4tKiZOMQlKlfCP YMQogiI1IHQW/wT0YhmR8ZMS+zK9pfP7tNDsmG71dBfsjF6NVLfDfSRUOS1cB4cEgxr3qvE+ hcq03ekKrcMRKKnOVsaOgys7fR6u2vx0dv2Bu+wsI66mq4MpwSwh/gFYyyVgw6z6bum46aoH Wb16in/rtM43Hsp0RDZSE6q0lcVlyL8f8VNoGXoRx34/itZZTKGJS0nN4nKxJWhH9Z+TgU20 Jh00RqcHc1/AWt3tm1/TF5IqZn1pBmY2KGLUbYGMsKvumpHZj1uKnVvjLrcr8twDxBkKuADK CX2PM9jPc=
  • Ironport-phdr: 9a23:UFKMDBbVswuSoUoLSgfKC77/LSx+4OfEezUN459isYplN5qZocS9bn LW6fgltlLVR4KTs6sC17OO9fi5EUU7or+5+EgYd5JNUxJXwe43pCcHRPC/NEvgMfTxZDY7Fs kRHHVs/nW8LFQHUJ2mPw6arXK99yMdFQviPgRpOOv1BpTSj8Oq3Oyu5pHfeQpFiCehbb9oMB m6sBjau9ULj4dlNqs/0AbCrGFSe+RRy2NoJFaTkAj568yt4pNt8Dletuw4+cJYXqr0Y6o3Tb pDDDQ7KG81/9HktQPCTQSU+HQRVHgdnwdSDAjE6BH6WYrxsjf/u+Fg1iSWIdH6QLYpUjmk8q xlSgLniD0fOjA38G/ZlM9+g6BVoBy8qBNw34HabZqJNPd8Yq/RYc8WSXZfUstXSidPApm8b4 wKD+cZIeZYoYz9p1gTpha5GQmsBfjgyjhShnPv2K060P8sERrY0w0hGdIBqnHUoM/pO6YTSO 24yrTDwzvEb/NTwzj96Y7Ifwgnof6WRr1/as7Rxlc1GwzZiVWQrIroNC6W2OQVq2WX8u5tWO a1h2MpqAx9uDuiy8Y2hoTIh48YzE3P+z9jz4YvP9K4TVZ2Yd66H5tUsCGXL412T8w4T2Fuoi k10aYJuZqlcyQQ1JsnwBvfZ+SGc4iO/B3jSP6cLSp8iX9hYr6yiRW//VKjx+D9TMW50VdHoj JAktbWt3AN0xLT6tKASvt45kqhxTeP2BvU6uFeOEw0kKnbJoU6wrEul5sTt17MHirslErqja 6abl8k9fSw6+T7frXmoYeROJN7ig7kNqQig9GwAeUjMgcSQmib4v+82ab4/Uz5RbVKluc5nr PYsJDcP8Qbp7S2DxVb0oY5uF6DCGKt390c2HUGN1lYYwmvjo7zOliILuqrI+24hgGwnjJoj6 TaP7fmGNDILVDYnaXndLM74FwKm1l79sxW+58BUuJJG/n0QEKk7IWEXC98CBS9xqPcMPs4zp kXADvdGaKLNqrX91SatLp2fru8IbQNsTO4EMALov7jiXhgxA0bIe+v1JEdbH3+FfNjcRzAMC jcx+wZGGJPhTIQCenjiVmMSzlWPi/gRK8u4Dg+Tom0X93O

Thank you Efi,

I've looked at the code and I found the default parameter 'int k=5'. I will
experiment with the value, but right now I still have to complete some
essential parts of my program to do so.

However, I'm not sure if it allows me to do what I need. What I meant to ask
was if there is any way to obtain intermediate results that the algorithm
creates, and use those results in its later invocations. So for example I
would call CGAL::join() (or similar function) and receive not only the
resulting polygon, but also some data which I could later give by argument
to the next CGAL::join() call, which would help the algorithm perform better
(for example it wouldn't need to "construct the BSP tree again"). I looked
at the code more closely but right now I can't find what I'm looking for.



--
Sent from: http://cgal-discuss.949826.n4.nabble.com/



Archive powered by MHonArc 2.6.18.

Top of Page