International Conference on Smart Media and Applications最新文献

筛选
英文 中文
Estimating depth from line drawing 从线条图估计深度
International Conference on Smart Media and Applications Pub Date : 2002-06-17 DOI: 10.1145/566282.566310
Peter Ashley Clifford Varley, Ralph Robert Martin
{"title":"Estimating depth from line drawing","authors":"Peter Ashley Clifford Varley, Ralph Robert Martin","doi":"10.1145/566282.566310","DOIUrl":"https://doi.org/10.1145/566282.566310","url":null,"abstract":"Our goal is unassisted machine interpretation of a single line drawing of an engineering object (with hidden lines removed) as a B-rep model. As part of this process, we seek to deduce a frontal geometry of the object, a 3D geometric realisation of that part of the object visible in the drawing. Inflation takes a drawing in which all lines have been line-labelled, and creates the frontal geometry by adding a z-coordinate to the x- and y-coordinates of each junction. This depth information comes from compliance functions, interpretations of drawing features expressed as equations in junction z-coordinates. We examine several compliance functions, and assessing their use in interpretation of engineering objects. We also describe a compliance function based on junction labels, and remove its previous restriction to trihedral vertices. We give a comparative analysis of applying combinations of compliance functions to a set of test drawings. As a result, we recommend using edge parallelism in combination with either corner orthogonality or junction label pairs, the latter being more reliable in general. Additional use of face planarity compliance is often beneficial and even necessary.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122155322","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}
引用次数: 36
Hierarchical extraction of iso-surfaces with semi-regular meshes 半规则网格等曲面的分层提取
International Conference on Smart Media and Applications Pub Date : 2002-06-17 DOI: 10.1145/566282.566293
K. Hormann, U. Labsik, M. Meister, G. Greiner
{"title":"Hierarchical extraction of iso-surfaces with semi-regular meshes","authors":"K. Hormann, U. Labsik, M. Meister, G. Greiner","doi":"10.1145/566282.566293","DOIUrl":"https://doi.org/10.1145/566282.566293","url":null,"abstract":"In this paper we present a novel approach to iso-surface extraction which is based on a multiresolution volume data representation and hierarchically approximates the iso-surface with a semi-regular mesh. After having generated a hierarchy of volumes, we extract the iso-surface from the coarsest resolution with a standard Marching Cubes algorithm, apply a simple mesh decimation strategy to improve the shape of the triangles, and use the result as a base mesh. Then we iteratively fit the mesh to the iso-surface at the finer volume levels, thereby subdividing it adaptively in order to be able to correctly reconstruct local features. We also take care of generating an even vertex distribution over the iso-surface so that the final result consists of triangles with good aspect ratio. The advantage of this approach as opposed to the standard method of extracting the iso-surface from the finest resolution with Marching Cubes is that it generates a mesh with subdivision connectivity which can be utilized by several multiresolution algorithms. As an application of our method we show how to reconstruct the surface of archaeological items.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126424129","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
Basic components of the DIJA project DIJA项目的基本组件
International Conference on Smart Media and Applications Pub Date : 2002-06-17 DOI: 10.1145/566282.566317
F. Danesi, Laurent Denis, Y. Gardan, E. Perrin
{"title":"Basic components of the DIJA project","authors":"F. Danesi, Laurent Denis, Y. Gardan, E. Perrin","doi":"10.1145/566282.566317","DOIUrl":"https://doi.org/10.1145/566282.566317","url":null,"abstract":"Our goal is to define and implement a web-based CAD System. Distributing a CAD system over the World Wide Web implies that this system has not any knowledge about its user (his computer and CAD skills, his trade, etc.). Thus, this system has to be adapted to each possible user: from neophyte to CAD system expert. Actual CAD systems have complex computer-human interfaces, which are an obstacle to the modeling task for a non-expert end-user. As our aim is to provide a novice end-user with an easy-to-use CAD system, we are interested in providing a more intuitive interface than a classical one. CAD systems propose interfaces based on constructive modeling methods. Creating geometry using these modeling methods, based for example on Constructive Solid Geometry, parametric models or features based modeling, is a very difficult task for somebody who has never used a CAD system. We present in this paper our approach (called synthetic method by opposition to constructive methods) which overcomes this main difficulty by reversing the modeling process. The general idea of our modeling method is that the user chooses an initial crude shape according to the correct object topology. This choice can be done by choosing an existing object or by giving either a functional description or a rough sketch. The chosen shape will be the basis of the modeling task. The user can deform this initial shape by using specific and intuitive dedicated tools, based on surface deformation and on free-form deformation techniques (FFD). This paper deals with the synthetic method concept, its implementation in a dedicated CAD system called DIJA and the improved boundary representation, which is used as geometric model and contains both the visualization model and the dialog model.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117032519","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}
引用次数: 12
Adaptive implicit modeling using subdivision curves and surfaces as skeletons 使用细分曲线和曲面作为骨架的自适应隐式建模
International Conference on Smart Media and Applications Pub Date : 2002-06-17 DOI: 10.1145/566282.566292
Alexis Angelidis, Marie-Paule Cani
{"title":"Adaptive implicit modeling using subdivision curves and surfaces as skeletons","authors":"Alexis Angelidis, Marie-Paule Cani","doi":"10.1145/566282.566292","DOIUrl":"https://doi.org/10.1145/566282.566292","url":null,"abstract":"Recent work has shown that implicit modeling using levels of details (LODs) is possible thanks to the use of subdivision-curves as skeletons. However, the geometric skeleton of a 3D shape is, in the general case, a graph of interconnected curve segments and surface patches, the exclusive use of curve skeletons is therefore not sufficient. We present a model that uses a graph of interconnected subdivision curves and surfaces as a skeleton, on which a varying radius can be specified in order to control surface thickness. The subdivision levels of the skeleton provide levels of detail for the field function that defines the implicit surface. Its visualization is achieved by generating a coarse mesh that surrounds the skeleton. At high valence skeleton vertices, triangulation topology issues are managed by locally overlapping the iso-surface triangulations. The mesh is then adaptively refined in order to sample the current LOD of the implicit surface within an error tolerance. The last contribution is a new solution to the unwanted blending problem. It avoids blending between parts of the surface that do not correspond to neighboring skeletal elements, and ensures continuity everywhere. All these methods are integrated into an interactive modeling system, where the user can create, view and edit complex shapes at different levels of detail.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"299 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121491191","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}
引用次数: 45
Dual/Primal mesh optimization for polygonized implicit surfaces 多边形隐式曲面的双/原始网格优化
International Conference on Smart Media and Applications Pub Date : 2002-06-17 DOI: 10.1145/566282.566308
Y. Ohtake, A. Belyaev
{"title":"Dual/Primal mesh optimization for polygonized implicit surfaces","authors":"Y. Ohtake, A. Belyaev","doi":"10.1145/566282.566308","DOIUrl":"https://doi.org/10.1145/566282.566308","url":null,"abstract":"A new method for improving polygonizations of implicit surfaces with sharp features is proposed. The method is based on the observation that, given an implicit surface with sharp features, a triangle mesh whose triangles are tangent to the implicit surface at certain inner triangle points gives a better approximation of the implicit surface than the standard marching cubes mesh Lorensen(in our experiments we use VTK marching cubes VTK). First, given an initial triangle mesh, its dual mesh composed of the triangle centroids is considered. Then the dual mesh is modified such that its vertices are placed on the implicit surface and the mesh dual to the modified dual mesh is considered. Finally the vertex positions of that \"double dual\" mesh are optimized by minimizing a quadratic energy measuring a deviation of the mesh normals from the implicit surface normals computed at the vertices of the modified dual mesh. In order to achieve an accurate approximation of fine surface features, these basic steps are combined with adaptive mesh subdivision and curvature-weighted vertex resampling. The proposed method outperforms approaches based on the mesh evolution paradigm in speed and accuracy.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128123584","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}
引用次数: 74
Multi-resolution and slice-oriented feature extraction and segmentation of digitized data 多分辨率、面向切片的数字化数据特征提取与分割
International Conference on Smart Media and Applications Pub Date : 2002-06-17 DOI: 10.1145/566282.566326
G. Patané, M. Spagnuolo
{"title":"Multi-resolution and slice-oriented feature extraction and segmentation of digitized data","authors":"G. Patané, M. Spagnuolo","doi":"10.1145/566282.566326","DOIUrl":"https://doi.org/10.1145/566282.566326","url":null,"abstract":"Given an object digitized as sequences of scan lines, we propose an approach to the extraction of feature lines and object segmentation based on a multi-resolution representation and analysis of the scan data. First, the scan lines are represented using a multi-resolution model which provides a flexible and useful reorganization of the data for simplification purposes and especially for the classification of points according to their level of detail, or scale. Then, scan lines are analyzed from a geometrical point of view in order to decompose each profile into basic patterns which identify 2D features of the profile. Merging the scale and geometric classification, 3D feature lines of the digitized object are reconstructed tracking patterns of similar shape across profiles. Finally, a segmentation is achieved which gives a form-feature oriented view of the digitized data. The proposed approach provides a computationally light solution to the simplification of large models and to the segmentation of object digitized as sequences of scan lines, but it can be applied to a wider range of digitized data.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133258357","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}
引用次数: 10
Application of feature technology to modeling and dimensioning the intermediate geometry of automotive powertrain components 特征技术在汽车动力总成中间几何形状建模及尺寸标注中的应用
International Conference on Smart Media and Applications Pub Date : 2002-06-17 DOI: 10.1145/566282.566327
M. Ramesh, D. Dutta, Nagesh Belludi, Derek Yip-Hoi, Paul Wascher
{"title":"Application of feature technology to modeling and dimensioning the intermediate geometry of automotive powertrain components","authors":"M. Ramesh, D. Dutta, Nagesh Belludi, Derek Yip-Hoi, Paul Wascher","doi":"10.1145/566282.566327","DOIUrl":"https://doi.org/10.1145/566282.566327","url":null,"abstract":"Intermediate parts occur in between process steps during machining. In case of parts produced in high volumes, a detail documentation of intermediate geometry is required for the knowledge of operators, for gauging, as a specification for tooling design and for offline CMM programming & simulation. Currently, manually created approximate 2D drawings and/or manually created 3D models are used for representing the intermediate geometry. The commercial process planning systems provide NC code simulation technique for automatically modeling the intermediate parts. In this paper, we outline the challenges posed by this problem in case of large components in automotive powertrain. We present a system that uses feature technology to address them. The solid models of intermediate parts are generated by sequentially subtracting volumetric machining features from the cast part model and they are dimensioned using reference geometry. This system automatically generates models of intermediate parts independent of the design history and the NC code. It also makes use of the process plan data generated prior to the availability of final and cast part model.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"56 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114113030","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}
引用次数: 8
A linear bound on the complexity of the delaunay triangulation of points on polyhedral surfaces 多面体表面上点的delaunay三角剖分复杂度的线性界
International Conference on Smart Media and Applications Pub Date : 2002-06-17 DOI: 10.1145/566282.566304
D. Attali, J. Boissonnat
{"title":"A linear bound on the complexity of the delaunay triangulation of points on polyhedral surfaces","authors":"D. Attali, J. Boissonnat","doi":"10.1145/566282.566304","DOIUrl":"https://doi.org/10.1145/566282.566304","url":null,"abstract":"Delaunay triangulations and Voronoi diagrams have found numerous applications in surface modeling, surface mesh generation, deformable surface modeling and surface reconstruction. Many algorithms in these applications begin by constructing the three-dimensional Delaunay triangulation of a finite set of points scattered over a surface. Their running-time therefore depends on the complexity of the Delaunay triangulation of such point sets. Although the complexity of the Delaunay triangulation of points may be quadratic in the worst-case, we show in this paper that it is only linear when the points are distributed on a fixed number of well-sampled facets (e.g. the facets of a polyhedron). Our bound is deterministic and the constants are explicitly given.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130215554","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}
引用次数: 62
Biorthogonal wavelets for subdivision volumes 细分体积的双正交小波
International Conference on Smart Media and Applications Pub Date : 2002-06-17 DOI: 10.1145/566282.566296
M. Bertram
{"title":"Biorthogonal wavelets for subdivision volumes","authors":"M. Bertram","doi":"10.1145/566282.566296","DOIUrl":"https://doi.org/10.1145/566282.566296","url":null,"abstract":"We present a biorthogonal wavelet construction based on Catmull-Clark-style subdivision volumes. Our wavelet transform is the three-dimensional extension of a previously developed construction of subdivision-surface wavelets that was used for multiresolution modeling of large-scale isosurfaces. Subdivision surfaces provide a flexible modeling tool for surfaces of arbitrary topology and for functions defined thereon. Wavelet representations add the ability to compactly represent large-scale geometries at multiple levels of detail. Our wavelet construction based on subdivision volumes extends these concepts to trivariate geometries, such as time-varying surfaces, free-form deformations, and solid models with non-uniform material properties. The domains of the repre-sented trivariate functions are defined by lattices composed of arbitrary polyhedral cells. These are recursively subdivided based on stationary rules converging to piecewise smooth limit-geometries. Sharp features and boundaries, defined by specific polygons, edges, and vertices of a lattice are explicitly represented using modified subdivision rules. Our wavelet transform provides the ability to reverse the subdivision process after a lattice has been re-shaped at a very fine level of detail, for example using an automatic fitting method. During this coarsening process all geometric detail is compactly stored in form of wavelet coefficients from which it can be reconstructed without loss.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120935510","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}
引用次数: 16
Web based analysis 基于Web的分析
International Conference on Smart Media and Applications Pub Date : 2002-06-17 DOI: 10.1145/566282.566315
M. P. Carroll, Christopher M. Hawkins
{"title":"Web based analysis","authors":"M. P. Carroll, Christopher M. Hawkins","doi":"10.1145/566282.566315","DOIUrl":"https://doi.org/10.1145/566282.566315","url":null,"abstract":"Most of today's Web based solutions in the CAD/CAE arena are focused on the design and manufacturing part of the equation. As such, they are very focused on data security, sharing, and visualization. The processing of the data is still seen as mainly a desktop/client function. Analysis provides an opportunity to expand the role of the Web from a role of data sharing to one of distributed data processing. For analysis, data visualization is not a static function. Analysis runs can produce enormous results files that will burden even the fastest Web connections. Servers need to process this data into useable form for client requests. Also the Web provides an excellent distributed processing environment, which is crucial for design studies such as simple parametric studies, Design of Experiments (DOE), optimization, and probabilistic studies. Finally, the Web provides an excellent environment for team analysis.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124430454","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}
引用次数: 3
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信