![]() 238000002360 preparation method Methods 0.000 description 1.230000001276 controlling effect Effects 0.000 description 1.238000000638 solvent extraction Methods 0.000 description 2.238000006011 modification reaction Methods 0.000 description 2. ![]() 238000005516 engineering process Methods 0.000 description 2.238000004458 analytical method Methods 0.000 description 2.238000004519 manufacturing process Methods 0.000 description 16.238000004590 computer program Methods 0.000 claims description 8.Assignors: Phung, Tuan Anh, Quilot, Laurent, Roudil, Daniel, Feki, Abdelmonem Publication of US20140184598A1 publication Critical patent/US20140184598A1/en Application granted granted Critical Publication of US9875577B2 publication Critical patent/US9875577B2/en Status Active legal-status Critical Current Anticipated expiration legal-status Critical Links Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.) Filing date Publication date Priority claimed from EP12306697 external-priority Application filed by Dassault Systemes SE filed Critical Dassault Systemes SE Assigned to DASSAULT SYSTEMES reassignment DASSAULT SYSTEMES ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Original Assignee Dassault Systemes SE Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.) ( en Inventor Laurent Quilot Abdelmonem Feki Tuan Anh Phung Daniel Roudil Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.) Granted Application number US14/139,491 Other versions US9875577B2 Google Patents US20140184598A1 - Tessellation of a Parameterized 3D Modeled Object They can handle millions of points, if you have GPU memory large enough to hold the intermediate data structures.US20140184598A1 - Tessellation of a Parameterized 3D Modeled Object It then fixes this result using a conservative star splaying method on the CPU.īoth these methods are robust, so they can handle any kind of degenerate input. It performs parallel insertion and flipping on the GPU. The fastest 3D Delaunay implementation is gDel3D, which is a hybrid GPU-CPU algorithm. By extracting the lower hull from this, the 3D Delaunay triangulation is obtained. Instead, gStar4D uses the neighborhood information from this diagram to create stars lifted to 4D and performs star splaying on them efficiently on the GPU. However, in 3D this cannot be dualized to a triangulation due to topological and geometrical problems. Similar to GPU-DT, this algorithm constructs the 3D digital Voronoi diagram first. It is implemented using CUDA and works on NVIDIA GPUs. GStar4D is a fast and robust 3D Delaunay algorithm for the GPU.
0 Comments
Leave a Reply. |