Subject: CGAL users discussion list
List archive
- From: kloffy <>
- To:
- Subject: Re: [cgal-discuss] Subdivide n-Polytope into n-Simplices
- Date: Wed, 1 Mar 2017 23:40:44 -0800 (PST)
- Authentication-results: mail2-smtp-roc.national.inria.fr; spf=None ; spf=SoftFail ; spf=None
- Ironport-phdr: 9a23:wN/boBzC756jkZnXCy+O+j09IxM/srCxBDY+r6Qd0uwQIJqq85mqBkHD//Il1AaPBtSGrakdwLOP7+igATVGusnR9ihaMdRlbFwst4Y/p0QYGsmLCEn2frbBThcRO4B8bmJj5GyxKkNPGczzNBX4q3y26iMOSF2kbVImbre9JomHhMu+06W++obYfh5TrDu7e7J7ahus/ivLscxDgo9lJKgggk/KpnxGdfV+ymZhJFbVlBH5sJTjtKV/+jhd7qpyv/VLVr/3Kvw1
Due to the lack of response, I am wondering whether I need to clarify the
question further? It seems to be a fairly well-understood problem in the 2D
case. I imagine once the polygonal 2D faces are subdivided into triangles,
constructing 3D tetrahedral faces should not be too hard (and so forth for
the dD case...).
Best,
Peter
--
View this message in context:
http://cgal-discuss.949826.n4.nabble.com/Subdivide-n-Polytope-into-n-Simplices-tp4662528p4662555.html
Sent from the cgal-discuss mailing list archive at Nabble.com.
- Re: [cgal-discuss] Subdivide n-Polytope into n-Simplices, kloffy, 03/02/2017
Archive powered by MHonArc 2.6.18.