The Experts below are selected from a list of 3690 Experts worldwide ranked by ideXlab platform
Elmar Schomer - One of the best experts on this subject based on the ideXlab platform.
-
High Precision Conservative Surface Mesh Generation for Swept Volumes
IEEE Transactions on Automation Science and Engineering, 2015Co-Authors: Andreas Von Dziegielewski, Michael Hemmer, Elmar SchomerAbstract: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 general framework to compute a compressed voxelization. The phase is tailored for an easy application of parallelization techniques. We show this for our exemplary implementation and provide a multicore solution, as well as a GPU-based solution using CUDA. For the meshing phase we utilize and extend the well known Delaunay refinement such that it generates an adaptive conservative approximation that obeys the user defined upper bound on the one-sided Hausdorff distance to the Swept Volume. The approach is able to handle inputs of high complexity and compute an approximation with a very high precision, which we demonstrate on real industrial data sets.
-
ICRA - High quality conservative surface mesh generation for Swept Volumes
2012 IEEE International Conference on Robotics and Automation, 2012Co-Authors: Andreas Von Dziegielewski, Michael Hemmer, Elmar SchomerAbstract: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 general framework to compute a compressed voxelization. The phase is tailored for an easy application of parallelization techniques. We show this for our exemplary implementation and provide a multi-core solution as well as a GPU based solution using CUDA. The meshing phase utilizes Delaunay refinement which we carefully modified such that required guarantees are met. The approach is able to handle inputs of very high complexity at desired precision, which we demonstrate on real industrial data sets.
-
conservative Swept Volume boundary approximation
Solid and Physical Modeling, 2010Co-Authors: A Von Dziegielewski, Rainer Erbes, Elmar SchomerAbstract:We present a novel technique for approximating the boundary of a Swept Volume. The generator given by an input triangle mesh is rendered under all rigid transformations of a discrete trajectory. We use a special shader program that creates offset geometry of each triangle on the fly, thus guaranteeing a conservative rasterization and correct depth values. Utilizing rasterization mechanisms and the depth buffer we then get a conservative voxelization of the Swept Volume (SV) and can extract a triangle mesh from its surface. This mesh is simplified maintaining conservativeness as well as an error bound measured in terms of the one-sided Hausdorff distance. For this we introduce a new technique for tolerance Volume computation. The tolerance Volume is implicitly given through six 2D-textures residing in texture memory and is evaluated in a special shader program only when needed.
-
Symposium on Solid and Physical Modeling - Conservative Swept Volume boundary approximation
Proceedings of the 14th ACM Symposium on Solid and Physical Modeling - SPM '10, 2010Co-Authors: A Von Dziegielewski, Rainer Erbes, Elmar SchomerAbstract:We present a novel technique for approximating the boundary of a Swept Volume. The generator given by an input triangle mesh is rendered under all rigid transformations of a discrete trajectory. We use a special shader program that creates offset geometry of each triangle on the fly, thus guaranteeing a conservative rasterization and correct depth values. Utilizing rasterization mechanisms and the depth buffer we then get a conservative voxelization of the Swept Volume (SV) and can extract a triangle mesh from its surface. This mesh is simplified maintaining conservativeness as well as an error bound measured in terms of the one-sided Hausdorff distance. For this we introduce a new technique for tolerance Volume computation. The tolerance Volume is implicitly given through six 2D-textures residing in texture memory and is evaluated in a special shader program only when needed.
Jean-paul Laumond - One of the best experts on this subject based on the ideXlab platform.
-
Swept Volume Approximation of Polygon Soups
IEEE Transactions on Automation Science and Engineering, 2010Co-Authors: Jesse Himmelstein, E. Ferre, Jean-paul LaumondAbstract:We present a fast algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the Volume Swept by an object along a trajectory, the efficient algorithms described have imposed constraints on both the trajectories and geometric models. By proposing a general algorithm that handles flat surfaces as well as Volumes and disconnected objects, we allow SV calculation without resorting to preprocessing mesh repair nor deforming offsets. This is of particular interest in the domain of product lifecycle management (PLM), which deals with industrial computer aided design (CAD) models that are malformed more often than not. We incorporate the bounded distance operator used in path planning to efficiently sample the trajectory while controlling the total error. We develop a triangulation scheme that draws on the unique data set created by an advancing front level-set method to tessellate the SV boundary in linear time. We analyze its performance, and demonstrate its effectiveness both theoretically and on real cases taken from PLM.
-
Swept Volume approximation of polygon soups
International Conference on Robotics and Automation, 2007Co-Authors: Jesse Himmelstein, E. Ferre, Jean-paul LaumondAbstract:We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the Volume Swept by an object along a trajectory, the efficient algorithms described have imposed constraints on both the trajectories and geometric models. By proposing a general algorithm that handles flat surfaces as well as Volumes and disconnected objects, we allow SV calculation without resorting to pre-processing mesh repair. This is of particular interest in the domain of product lifecycle management (PLM), which deals with industrial computer aided design (CAD) models that are malformed more often than not. We incorporate the bounded distance operator used in path planning to efficiently sample the trajectory while controlling the total error. We develop a triangulation scheme that draws on the unique data set created by an advancing front level-set method to tessellate the SV boundary in linear time. We analyze its performance, and demonstrate its effectiveness both theoretically and on real cases taken from PLM.
-
ICRA - Swept Volume approximation of polygon soups
Proceedings 2007 IEEE International Conference on Robotics and Automation, 2007Co-Authors: Jesse Himmelstein, E. Ferre, Jean-paul LaumondAbstract:We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the Volume Swept by an object along a trajectory, the efficient algorithms described have imposed constraints on both the trajectories and geometric models. By proposing a general algorithm that handles flat surfaces as well as Volumes and disconnected objects, we allow SV calculation without resorting to pre-processing mesh repair. This is of particular interest in the domain of product lifecycle management (PLM), which deals with industrial computer aided design (CAD) models that are malformed more often than not. We incorporate the bounded distance operator used in path planning to efficiently sample the trajectory while controlling the total error. We develop a triangulation scheme that draws on the unique data set created by an advancing front level-set method to tessellate the SV boundary in linear time. We analyze its performance, and demonstrate its effectiveness both theoretically and on real cases taken from PLM.
Andreas Von Dziegielewski - One of the best experts on this subject based on the ideXlab platform.
-
High Precision Conservative Surface Mesh Generation for Swept Volumes
IEEE Transactions on Automation Science and Engineering, 2015Co-Authors: Andreas Von Dziegielewski, Michael Hemmer, Elmar SchomerAbstract: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 general framework to compute a compressed voxelization. The phase is tailored for an easy application of parallelization techniques. We show this for our exemplary implementation and provide a multicore solution, as well as a GPU-based solution using CUDA. For the meshing phase we utilize and extend the well known Delaunay refinement such that it generates an adaptive conservative approximation that obeys the user defined upper bound on the one-sided Hausdorff distance to the Swept Volume. The approach is able to handle inputs of high complexity and compute an approximation with a very high precision, which we demonstrate on real industrial data sets.
-
ICRA - High quality conservative surface mesh generation for Swept Volumes
2012 IEEE International Conference on Robotics and Automation, 2012Co-Authors: Andreas Von Dziegielewski, Michael Hemmer, Elmar SchomerAbstract: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 general framework to compute a compressed voxelization. The phase is tailored for an easy application of parallelization techniques. We show this for our exemplary implementation and provide a multi-core solution as well as a GPU based solution using CUDA. The meshing phase utilizes Delaunay refinement which we carefully modified such that required guarantees are met. The approach is able to handle inputs of very high complexity at desired precision, which we demonstrate on real industrial data sets.
-
High Quality Surface Mesh Generation for Swept Volumes
2011Co-Authors: Andreas Von Dziegielewski, Michael HemmerAbstract:We present a novel and ecient technique to generate a high quality mesh that approximates the outer boundary of a Swept Volume (SV). Our approach comes with two guarantees. First, the approximation is conservative, i.e. the Swept Volume is enclosed by the output mesh. Second, the one-sided Hausdor distance of the generated mesh to the Swept Volume is upper bounded by a user dened tolerance. Exploiting this tolerance our method produces an anisotropic mesh which nicely adapts to the local complexity of the approximated Swept Volume boundary. The algorithm is two phased: a initialization phase that generates a conservative voxelization of the Swept Volume, and the actual mesh generation which is based on CGAL’s Delaunay renement implementation.
Wang Hui-nan - One of the best experts on this subject based on the ideXlab platform.
-
Study of the Graphics Engine in Swept-Volume Technique of True 3D Volumetric Display
Optoelectronic Technology, 2006Co-Authors: Wang Hui-nanAbstract:True 3D Volumetric display technique is a completely new technique.Images are generated within a region of 3D space and break the durance of plane display.Many techniques are used,such as static-Volume display and Swept-Volume display. Some characteristics of graphics engine in Swept-Volume display are studied in this paper.An elementary graphics engine of a translation motion display equipped with a passive surface of emission is used.Particularly the conversion of coordinate systems,processing of the image data,and voxel ordering are studied. All of these provide the essential theoretical foundation and important technique methods for the research of true 3D Volumetric display technique.
-
Study of translational motion Swept-Volume techniques in true 3D Volumetric display systems
Journal of Computer Applications, 2006Co-Authors: Wang Hui-nanAbstract:With the rapid development of computer technology,as a completely new 3D image display technique,True 3D Volumetric display techniques will lead science visualization to a new development direction and have a wide area of applications in the future.Imaging theory and motional types of Swept-Volume display systems of translational motion were studied.Particularly,a display unit in which screen moved with a sinusoidal velocity profile was studied.By using linear approximation,the homogeneous was graphic obtained and worst-case positional error due to linear approximation was analyzed in the system.The system could realize true 3D effect.
Michael Hemmer - One of the best experts on this subject based on the ideXlab platform.
-
High Precision Conservative Surface Mesh Generation for Swept Volumes
IEEE Transactions on Automation Science and Engineering, 2015Co-Authors: Andreas Von Dziegielewski, Michael Hemmer, Elmar SchomerAbstract: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 general framework to compute a compressed voxelization. The phase is tailored for an easy application of parallelization techniques. We show this for our exemplary implementation and provide a multicore solution, as well as a GPU-based solution using CUDA. For the meshing phase we utilize and extend the well known Delaunay refinement such that it generates an adaptive conservative approximation that obeys the user defined upper bound on the one-sided Hausdorff distance to the Swept Volume. The approach is able to handle inputs of high complexity and compute an approximation with a very high precision, which we demonstrate on real industrial data sets.
-
ICRA - High quality conservative surface mesh generation for Swept Volumes
2012 IEEE International Conference on Robotics and Automation, 2012Co-Authors: Andreas Von Dziegielewski, Michael Hemmer, Elmar SchomerAbstract: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 general framework to compute a compressed voxelization. The phase is tailored for an easy application of parallelization techniques. We show this for our exemplary implementation and provide a multi-core solution as well as a GPU based solution using CUDA. The meshing phase utilizes Delaunay refinement which we carefully modified such that required guarantees are met. The approach is able to handle inputs of very high complexity at desired precision, which we demonstrate on real industrial data sets.
-
High Quality Surface Mesh Generation for Swept Volumes
2011Co-Authors: Andreas Von Dziegielewski, Michael HemmerAbstract:We present a novel and ecient technique to generate a high quality mesh that approximates the outer boundary of a Swept Volume (SV). Our approach comes with two guarantees. First, the approximation is conservative, i.e. the Swept Volume is enclosed by the output mesh. Second, the one-sided Hausdor distance of the generated mesh to the Swept Volume is upper bounded by a user dened tolerance. Exploiting this tolerance our method produces an anisotropic mesh which nicely adapts to the local complexity of the approximated Swept Volume boundary. The algorithm is two phased: a initialization phase that generates a conservative voxelization of the Swept Volume, and the actual mesh generation which is based on CGAL’s Delaunay renement implementation.
