Subject: CGAL users discussion list
List archive
Re: [cgal-discuss] Creating Delaunay 3d triangulation with a circumradius bound
Chronological Thread
- From: "Sebastien Loriot (GeometryFactory)" <>
- To:
- Subject: Re: [cgal-discuss] Creating Delaunay 3d triangulation with a circumradius bound
- Date: Fri, 27 Jul 2018 08:58:36 +0200
- Authentication-results: mail3-smtp-sop.national.inria.fr; spf=None ; spf=Pass ; spf=None
- Ironport-phdr: 9a23:+lB+PBGGUFak/IflnNMD551GYnF86YWxBRYc798ds5kLTJ7zrsWwAkXT6L1XgUPTWs2DsrQY07SQ6/iocFdDyK7JiGoFfp1IWk1NouQttCtkPvS4D1bmJuXhdS0wEZcKflZk+3amLRodQ56mNBXdrXKo8DEdBAj0OxZrKeTpAI7SiNm82/yv95HJbAhEmDuwbaluIBmqsA7cqtQYjYx+J6gr1xDHuGFIe+NYxWNpIVKcgRPx7dqu8ZBg7ipdpesv+9ZPXqvmcas4S6dYDCk9PGAu+MLrrxjDQhCR6XYaT24bjwBHAwnB7BH9Q5fxri73vfdz1SWGIcH7S60/VDK/5KlpVRDokj8KOSMn/mHZisJ+j6xVrxyuqBN934Hab5qYNOZ8c67HYd8WWWRMU8RXWidcAo28dYwPD+8ZMOpWsofyuUABogGlBQmwBePg1DlIjWLw0609yeQhEAbG3BA9FN4KsXrbstL1NKIMXuCp1qnJzTXNYOlK1jfh74jIaBAgrfSCUbltdsfR0k0vFwTfjlWRrozlIymZ1uEJs2WA4OpgUPigi28jqw1rvjevwcIsh5DPi4kIxF7E8iB5z5w0Jd2+UEN0fMCrEJ5XtyGcLYd5XsQiT3t1uCY50rEGv4S0czMRx5Qj2RHTceCIc4+N4h77WueRIDR4hHN9eL2hmhmy8FKvxvf7Vsmu31ZHqDdOnNrUtn0VyRDf9syKRuF+80qhwzqDyR7f5vxeLU00i6bXM5wsz70qmpYNvknOHzX6lFjygaKYbEkp+Oil5uL6abv8vJCcLZV7igTmP6QuhMO/BeM4PxALX2eB+OS80KTv/EPjQLlXl/E2nKnUvI7AKcQUoa65BABV0oI95BqlEzim19EYkWEGLFJDZh2Hk5DkN0/SLP38F/uygFShnC11y/zYI7HtGJXAImbbnLfkZ7l96kpcyAQpzdBY4pJZEqoBIPb0Wk/rtdzYCQM5Pxaxw+bjE9h92YYeVniOAq+dKq/drViI5uc3L+mWeIAVoCr9K+Qi5/P2kXA5lkUSfa2w0ZQKaXC4BehpI1iCYXr3mdoBCmcLvg8mTOPwklGCUDhTZ2yzX60m/D07BpimXs//QdWmj7WFmSu6BZZLfXtuC1aWEH6ueZ/Xde0LbXfYGcJrmycYVLWnA6smzxCpqEe65LdgK+fI4Dw2vJn/08JkpqebwQo28iZ1CNjb1mWlQGR9n2dOTDgzivMs6Xdhw0uOhPAry8dTEsZesqsQA1UKcKXExuk/MOjcHwfIf9OHUlGjG4z0DjQ4T9Z3yNgLMR8kR4eSyyvb1i/vOIc70qSRDcVtoK3Z1nn1Yc16ziSejfRzvxwdWsJKcFaeqOt/+gzUXdOblkyYk+O1b/1Z0nOXsmiEymWKsQdTVwsiCag=
Another thing to try it to use the Lloyd algorithm, it should make you tetrahedron almost identical as the points will be equally spaced.
Sebastien.
On 07/27/2018 08:49 AM, Dahn wrote:
Hi Sebastien,
thank you for the suggestion. Sadly I cannot, as the triangulation is an
initial configuration for an MCMC
<https://en.wikipedia.org/wiki/Markov_chain_Monte_Carlo> algorithm which
attempts to converge to a regular triangulation with certain properties (but
has to start with certain properties for it to work, too).
However, I have realized that a simpler solution might be to create a point
pattern such that the resulting tetrahedra are regular (as in made of
equilateral triangles), a 3d version of the equilateral triangle tiling
<http://gwydir.demon.co.uk/jo/tess/bigtri.htm> .
I am not able to test it now, but I will report back once I do. In the
meantime, other suggestions are definitely welcome.
--
Sent from: http://cgal-discuss.949826.n4.nabble.com/
- [cgal-discuss] Creating Delaunay 3d triangulation with a circumradius bound, Dahn, 07/16/2018
- Re: [cgal-discuss] Creating Delaunay 3d triangulation with a circumradius bound, Sebastien Loriot (GeometryFactory), 07/27/2018
- Re: [cgal-discuss] Creating Delaunay 3d triangulation with a circumradius bound, Dahn, 07/27/2018
- Re: [cgal-discuss] Creating Delaunay 3d triangulation with a circumradius bound, Sebastien Loriot (GeometryFactory), 07/27/2018
- Re: [cgal-discuss] Creating Delaunay 3d triangulation with a circumradius bound, Dahn, 07/27/2018
- Re: [cgal-discuss] Creating Delaunay 3d triangulation with a circumradius bound, Sebastien Loriot (GeometryFactory), 07/27/2018
Archive powered by MHonArc 2.6.18.