0000000000266907

AUTHOR

Andreas Von Dziegielewski

showing 2 related works from this author

High quality conservative surface mesh generation for swept volumes

2012

We present a novel, efficient and flexible scheme to generate a high quality mesh that approximates the outer boundary of a swept volume. Our approach comes with two guarantees. First, the approximation is conservative, i.e., the swept volume is enclosed by the generated mesh. Second, the one-sided Hausdorff distance of the generated mesh to the swept volume is upper bounded by a user defined tolerance. Exploiting this tolerance the algorithm generates a mesh that is adapted to the local complexity of the swept volume boundary, keeping the overall output complexity remarkably low. The algorithm is two-phased: the actual sweep and the mesh generation. In the sweeping phase we introduce a gen…

0209 industrial biotechnologyComputer scienceParallel algorithmBoundary (topology)020207 software engineering02 engineering and technologyParallel computingComputational scienceCUDA020901 industrial engineering & automationMesh generation0202 electrical engineering electronic engineering information engineeringRuppert's algorithmComputingMethodologies_COMPUTERGRAPHICS2012 IEEE International Conference on Robotics and Automation
researchProduct

High Precision Conservative Surface Mesh Generation for Swept Volumes

2015

We present a novel, efficient, and flexible scheme to generate a high-quality mesh that approximates the outer boundary of a swept volume. Our approach comes with two guarantees. First, the approximation is conservative, i.e., the swept volume is enclosed by the generated mesh. Second, the one-sided Hausdorff distance of the generated mesh to the swept volume is upper bounded by a user defined tolerance. Exploiting this tolerance the algorithm generates a mesh that is adapted to the local complexity of the swept volume boundary, keeping the overall output complexity remarkably low. The algorithm is two-phased: the actual sweep and the mesh generation. In the sweeping phase, we introduce a g…

Computer scienceBoundary (topology)Parallel computingUpper and lower boundsComputational scienceCUDAHausdorff distanceEngine displacementControl and Systems EngineeringMesh generationBounded functionElectrical and Electronic EngineeringRuppert's algorithmComputingMethodologies_COMPUTERGRAPHICSIEEE Transactions on Automation Science and Engineering
researchProduct