Pub Date : 2001-10-16DOI: 10.1109/PCCGA.2001.962854
R. Pajarola
The article presents an optimized view-dependent meshing framework for adaptive and continuous level-of-detail (LOD) rendering in real-time. Multiresolution triangle mesh representations are an important tool for adapting triangle mesh complexity in real-time rendering environments. Ideally, for interactive visualization, a triangle mesh is simplified to the maximal tolerated perceptual error, and thus mesh simplification is view-dependent. The paper introduces an efficient hierarchical multiresolution triangulation framework based on a half-edge triangle mesh data structure, and presents an optimized computation of several view-dependent error metrics within that framework, providing conservative error bounds. The presented approach called FastMesh, is highly efficient both in space and time cost, and it spends only a fraction of the time required for rendering to perform the error calculations and dynamic mesh updates.
{"title":"FastMesh: efficient view-dependent meshing","authors":"R. Pajarola","doi":"10.1109/PCCGA.2001.962854","DOIUrl":"https://doi.org/10.1109/PCCGA.2001.962854","url":null,"abstract":"The article presents an optimized view-dependent meshing framework for adaptive and continuous level-of-detail (LOD) rendering in real-time. Multiresolution triangle mesh representations are an important tool for adapting triangle mesh complexity in real-time rendering environments. Ideally, for interactive visualization, a triangle mesh is simplified to the maximal tolerated perceptual error, and thus mesh simplification is view-dependent. The paper introduces an efficient hierarchical multiresolution triangulation framework based on a half-edge triangle mesh data structure, and presents an optimized computation of several view-dependent error metrics within that framework, providing conservative error bounds. The presented approach called FastMesh, is highly efficient both in space and time cost, and it spends only a fraction of the time required for rendering to perform the error calculations and dynamic mesh updates.","PeriodicalId":387699,"journal":{"name":"Proceedings Ninth Pacific Conference on Computer Graphics and Applications. Pacific Graphics 2001","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122556796","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-10-16DOI: 10.1109/PCCGA.2001.962861
Masayuki Hisada, A. Belyaev, T. Kunii
The paper proposes an approach for stable extraction of the skeleton of a polygonal surface and detection of surface features, ridges and ravines, corresponding to skeletal edges. The approach adapts the three-dimensional Voronoi diagram technique for skeleton extraction, explores the singularity theory for ridge and ravine detection, and combines several filtering methods for skeleton denoising and for selecting perceptually salient ridges and ravines. Rather than extract the skeleton as a CW-complex, we approximate it with a two-sided surface. It allows us to use standard mesh editing tools for skeleton denoising and achieve stable extraction of the ridges and ravines.
{"title":"A 3D Voronoi-based skeleton and associated surface features","authors":"Masayuki Hisada, A. Belyaev, T. Kunii","doi":"10.1109/PCCGA.2001.962861","DOIUrl":"https://doi.org/10.1109/PCCGA.2001.962861","url":null,"abstract":"The paper proposes an approach for stable extraction of the skeleton of a polygonal surface and detection of surface features, ridges and ravines, corresponding to skeletal edges. The approach adapts the three-dimensional Voronoi diagram technique for skeleton extraction, explores the singularity theory for ridge and ravine detection, and combines several filtering methods for skeleton denoising and for selecting perceptually salient ridges and ravines. Rather than extract the skeleton as a CW-complex, we approximate it with a two-sided surface. It allows us to use standard mesh editing tools for skeleton denoising and achieve stable extraction of the ridges and ravines.","PeriodicalId":387699,"journal":{"name":"Proceedings Ninth Pacific Conference on Computer Graphics and Applications. Pacific Graphics 2001","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130285401","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-10-16DOI: 10.1109/PCCGA.2001.962865
Kai Poutrain, M. Contensin
While almost all collision detection algorithms have been linked to a particular object representation scheme, few attempts have been made using hybrid methods to exploit the advantages of multiple representations of objects. In this paper we present a collision detection algorithm based on a dual b-rep/CSG representation of concave polyhedra initially represented in b-rep. Our method naturally combines the use of bounding volumes, hierarchical subdivision, and space partitioning to perform the interference test.
{"title":"Dual b-rep-CSG collision detection for general polyhedra","authors":"Kai Poutrain, M. Contensin","doi":"10.1109/PCCGA.2001.962865","DOIUrl":"https://doi.org/10.1109/PCCGA.2001.962865","url":null,"abstract":"While almost all collision detection algorithms have been linked to a particular object representation scheme, few attempts have been made using hybrid methods to exploit the advantages of multiple representations of objects. In this paper we present a collision detection algorithm based on a dual b-rep/CSG representation of concave polyhedra initially represented in b-rep. Our method naturally combines the use of bounding volumes, hierarchical subdivision, and space partitioning to perform the interference test.","PeriodicalId":387699,"journal":{"name":"Proceedings Ninth Pacific Conference on Computer Graphics and Applications. Pacific Graphics 2001","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125444752","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-05-01DOI: 10.1109/PCCGA.2001.962860
D. Steiner, A. Fischer
Reverse engineering (RE) deals with an enormous number of irregular and scattered digitized points that require intensive processing in order to reconstruct the surfaces of an object. Surface reconstruction of freeform objects is based on geometrical and topological criteria. Current fitting methods reconstruct an object using a bottom-up approach, from points to a dense mesh, and finally into smoothed connected freeform sub-surfaces. This type of reconstruction, however, can cause topological problems that lead to undesired surface fitting results. Such problems are particularly common with concave shapes. To avoid problems of this type, the paper proposes a new method that automatically detects the topological structure of an object as a base for surface fitting. The topological reconstruction method described in the paper is based on two stages: (1) creating 3D non-self-intersecting iso-curves from a 3D triangular mesh and (2) extracting a topological graph. The feasibility of the proposed topological reconstruction method is demonstrated on several examples using freeform objects with complex topologies.
{"title":"Topology recognition of 3D closed freeform objects based on topological graphs","authors":"D. Steiner, A. Fischer","doi":"10.1109/PCCGA.2001.962860","DOIUrl":"https://doi.org/10.1109/PCCGA.2001.962860","url":null,"abstract":"Reverse engineering (RE) deals with an enormous number of irregular and scattered digitized points that require intensive processing in order to reconstruct the surfaces of an object. Surface reconstruction of freeform objects is based on geometrical and topological criteria. Current fitting methods reconstruct an object using a bottom-up approach, from points to a dense mesh, and finally into smoothed connected freeform sub-surfaces. This type of reconstruction, however, can cause topological problems that lead to undesired surface fitting results. Such problems are particularly common with concave shapes. To avoid problems of this type, the paper proposes a new method that automatically detects the topological structure of an object as a base for surface fitting. The topological reconstruction method described in the paper is based on two stages: (1) creating 3D non-self-intersecting iso-curves from a 3D triangular mesh and (2) extracting a topological graph. The feasibility of the proposed topological reconstruction method is demonstrated on several examples using freeform objects with complex topologies.","PeriodicalId":387699,"journal":{"name":"Proceedings Ninth Pacific Conference on Computer Graphics and Applications. Pacific Graphics 2001","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129838272","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：