International Conference on Smart Media and Applications最新文献_第8页

Partial entity structure: a compact non-manifold boundary representation based on partial topological entities 部分实体结构:基于部分拓扑实体的紧凑非流形边界表示

International Conference on Smart Media and Applications Pub Date : 2001-05-01 DOI: 10.1145/376957.376976

Sang Hun Lee, Kunwoo Lee

{"title":"Partial entity structure: a compact non-manifold boundary representation based on partial topological entities","authors":"Sang Hun Lee, Kunwoo Lee","doi":"10.1145/376957.376976","DOIUrl":"https://doi.org/10.1145/376957.376976","url":null,"abstract":"Non-manifold boundary representations have gained a great deal of popularity in recent years and various representation schemes have been proposed because they allow an even wider range of objects for various applications than conventional manifold representations. However, since these schemes are mainly interested in describing sufficient adjacency relationships of topological entities, the models represented in these schemes occupy too much storage space redundantly although they are very efficient in answering queries on topological adjacency relationships. Storage requirement can arise as a crucial problem in models in which topological data is more dominant than geometric data, such as tessellated or mesh models.\u0000To solve this problem, in this paper, we propose a compact non-manifold boundary representation, called the partial entity structure, which allows the reduction of the storage size to half that of the radial edge structure, which is known as a time efficient non-manifold data structure, while allowing full topological adjacency relationships to be derived without loss of efficiency. This representation contains not only the conventional primitive entities like the region, face, edge, and vertex, but also the partial topological entities such as the partial-face, partial-edge, and partial-vertex for describing non-manifold conditions at vertices, edges, and faces. In order to verify the time and storage efficiency of the partial entity structure, the time complexity of basic query procedures and the storage requirement for typical geometric models are derived and compared with those of existing schemes. Furthermore, a set of the generalized Euler operators and typical high-level modeling capabilities such as Boolean operations are also implemented to confirm that our data structure is sound and easy to be manipulated.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"113 3 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":"123505539","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}

引用次数: 91

Blend recognition algorithm and applications 混合识别算法及应用

International Conference on Smart Media and Applications Pub Date : 2001-05-01 DOI: 10.1145/376957.376970

S. Venkataraman, M. Sohoni, G. Elber

引用次数: 37

The computation of circumcircles of three circles 三个圆的圆的计算

International Conference on Smart Media and Applications Pub Date : 2001-05-01 DOI: 10.1145/376957.377048

Deok-Soo Kim, Donguk Kim, K. Sugihara

引用次数: 1

Representation and extraction of volumetric attributes using trivariate splines: a mathematical framework 用三变量样条表示和提取体积属性:一个数学框架

International Conference on Smart Media and Applications Pub Date : 2001-05-01 DOI: 10.1145/376957.376984

William Martin, E. Cohen

引用次数: 80

A volumetic approach to interactive CSG modeling and rendering 交互式CSG建模和渲染的体积方法

International Conference on Smart Media and Applications Pub Date : 1999-06-01 DOI: 10.1145/304012.304058

Hongsheng Chen, S. Fang

{"title":"A volumetic approach to interactive CSG modeling and rendering","authors":"Hongsheng Chen, S. Fang","doi":"10.1145/304012.304058","DOIUrl":"https://doi.org/10.1145/304012.304058","url":null,"abstract":"Volume-based graphics techniques, such as volume rendering and voxelization, have been attracting enormous research attention recently. But they have not yet played a significant role in solid modeling and its CAD/CAM applicatiions. Although there have been many fast rendering algorithms for CSG models[6,9], volume-based techniques have the benefit of explicitly generating the volume representations for the CSG models, wh,ich can be very useful for m.any volume related operations such as volume rendering, integral property computation, finite element analysis and layered manufacturing for rapid prototyping. A volume is a scalar field sampled at a 3D regular grid over a volume space. For a solid object, a binary volume with only 0 and 1 intensity values can be used. The process of converting a geometric model into a volume representation is called uoseli::ation[3]. Conceptually, CSG voxelization is a set membership classification problem agatinst the CSG model for all voxels in a volume space. Early CSG voxelization methods (can date back to the spatial enumeration by point classification[5]. Several more recent works have also been reported[l, 4, 71. Unfortunately, these algorithms are all computationally very expensive, thus do not provide interactive performance. In this .paper, we present a new volumetric solution for the fast volume conversion and rendering of CSG models. It uses existing hardware features in standard 3D graphics systems (e.g. OpenGL), and interactively generates a volume representation for each CSG model in a 3D texture memory, which can then be volume rendered in real time by 3D texture mapping[2, 81, or saved into main memory for post-processing operations and computations.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114652188","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}

引用次数: 11

Generation of swept volumes of toroidal endmills in five-axis motion using space curves 利用空间曲线生成五轴运动环面立铣刀的掠积

International Conference on Smart Media and Applications Pub Date : 1999-06-01 DOI: 10.1145/304012.304050

D. Roth, S. Bedi, F. Ismail

{"title":"Generation of swept volumes of toroidal endmills in five-axis motion using space curves","authors":"D. Roth, S. Bedi, F. Ismail","doi":"10.1145/304012.304050","DOIUrl":"https://doi.org/10.1145/304012.304050","url":null,"abstract":"Accurate prediction of the swept volume of a cutting tool is essential in NC verification algorithms for detecting deficiencies in a proposed tool path, such as gouging, undercutting and interference. This paper explores a new technique for generating the swept volume of a toroidal endmill, and analyzes the results obtained for two test cases. For a given tool location along a path, a curve on the cutting surface of the tool is identified that rs:presents the imprint of the tool on the machined surface. This curve will be designated a space curve as it is defined in 3D spa.ce. The method relies on forward difference information obtained from a G-code or cutter location data file in order to compute the space curves. Once several su.ccessive space curves have been identified, a facetted surface model of the footprint of the tool along a pass may be readily calculated and compared with the design surface. The method has b,een verified for two test cases: a) 5-axis tool path on a hemispherical cavity and b) a 5-axis tool path on the complex surface of a turbine blade. Results from the new method are compared with the slow, but dependable mycasting technique. It is concluded that the new technique offers al fast and accurate method of verifying multi-axis tool paths. In the future, it is hoped that the simulation can be extended to all cutter shapes, and not be limited to toroidal cutters. CR Categories and Sub.ject Descriptors: 1.6.4 [Simulation and Modeling]: Model Validation and Analysis Additional","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127472208","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}

引用次数: 5

Consistent updates in dual representation systems 双重表示系统的一致更新

International Conference on Smart Media and Applications Pub Date : 1999-06-01 DOI: 10.1145/304012.304019

S. Raghothama, V. Shapiro

引用次数: 37

Conceptual design for mechatronic assemblies 机电一体化组件概念设计

International Conference on Smart Media and Applications Pub Date : 1999-06-01 DOI: 10.1145/304012.304059

S. Lombeyda, W. Regli

引用次数: 7

Synthesis of bent sheet metal parts from design features 从设计特点综合弯曲钣金件

International Conference on Smart Media and Applications Pub Date : 1999-06-01 DOI: 10.1145/304012.304024

R. Bush, C. Séquin

{"title":"Synthesis of bent sheet metal parts from design features","authors":"R. Bush, C. Séquin","doi":"10.1145/304012.304024","DOIUrl":"https://doi.org/10.1145/304012.304024","url":null,"abstract":"We consider the problem of automatically synthesizing a 2.5 D sheet-metal part in the presence of other parts in an assembly. The part is to be fabricated by cutting or stamping a single piece of sheet metal, and then bending it along straight folds. The inputs to the problem are flat regions (design features) arranged in general 3D position. These regions represent the important interfaces to other parts or to the world. The synthesized part must be realizable from a single sheet of material by cutting and bending; it must also avoid other parts in the assembly, and incorporate the flat regions. We present a three stage algorithm that solves this synthesis problem. The first stage computes a 3D global connectivity graph that indicates which pairs of features should be connected to one another by synthesized, uniform-width spars of material. The second stage calculates a folding plan that determines how the 3D shape can be folded flat. Executing this plan transforms the 3D problem into a simpler 2D one. The final stage is the spar synthesis stage which calculates constant-width, flat spars to join each pair of features that the connectivity graph indicates should be connected. These spars have constraints on their shape that arise due to obstacles, topological consistency, fold geometry, and minimal weight. We have built a simple, 3D CAD system that allows the designer to directly manipulate the design features for a single part and create simple obstacles representing other parts that must be avoided. The system synthesizes, at interactive speeds, the outline of the 2D flattened part as well as the 3D part. CR","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"70 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134545827","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}

引用次数: 4

Computing the Voronoi diagram of a 3-D polyhedron by separate computation of its symbolic and geometric parts 计算三维多面体的Voronoi图，分别计算其符号部分和几何部分

International Conference on Smart Media and Applications Pub Date : 1999-06-01 DOI: 10.1145/304012.304029

Michal Etzion, A. Rappoport

引用次数: 38