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

Edgebreaker: a simple compression for surfaces with handles 压边器:对有手柄的表面进行简单的压缩

International Conference on Smart Media and Applications Pub Date : 2002-06-17 DOI: 10.1145/566282.566324

H. Lopes, G. Tavares, J. Rossignac, A. Szymczak, A. Safonova

引用次数: 45

Cutting 3D freeform objects with genus-n into single boundary surfaces using topological graphs 利用拓扑图将属n的三维自由曲面切割成单个边界曲面

International Conference on Smart Media and Applications Pub Date : 2002-06-17 DOI: 10.1145/566282.566330

D. Steiner, A. Fischer

{"title":"Cutting 3D freeform objects with genus-n into single boundary surfaces using topological graphs","authors":"D. Steiner, A. Fischer","doi":"10.1145/566282.566330","DOIUrl":"https://doi.org/10.1145/566282.566330","url":null,"abstract":"In reverse engineering, surface reconstruction methods for freeform objects are based mainly on geometrical criteria, while topological factors are neglected. Current methods use a bottom-up approach based on local parameterization to reconstruct the object from points to a dense mesh and finally to smooth connected patches. This type of reconstruction, however, can have topological problems that might lead to parameterization difficulties, noisy surface behavior and texture anomalies. Such problems are particularly common with concave objects and shapes with complex topology of genus-n. To avoid the above problems, a new global topological approach for cutting objects with genus-n was developed and implemented. The proposed process is based on two main stages: (1) computing iso-curves on the mesh and extracting the topological graph, and (2) cutting the mesh according to the curve cutting guidelines that are calculated from the topological graph. The resulting mesh is a single boundary mesh and therefore can be flattened onto a disk. The time complexity of the algorithm is O(n log(n)). To demonstrate the feasibility of the cutting process, the mesh was also flattened. The flattened mesh can then be used for global parameterization, surface fitting and texture mapping. The robustness of the cutting process is demonstrated on several examples using sculptured freeform objects with genus-n.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"16 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":"123485045","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}

引用次数: 27

A survey of the persistent naming problem 持久性命名问题的调查

International Conference on Smart Media and Applications Pub Date : 2002-06-17 DOI: 10.1145/566282.566288

D. Marcheix, G. Pierra

引用次数: 61

Interacting with parametrized geometric objects using lambda-terms 使用lambda项与参数化几何对象交互

International Conference on Smart Media and Applications Pub Date : 2002-06-17 DOI: 10.1145/566282.566318

Jean-François Dufourd, Sven Luther

引用次数: 0

Fast volumetric CSG modeling using standard graphics system 快速体积CSG建模使用标准图形系统

International Conference on Smart Media and Applications Pub Date : 2002-06-17 DOI: 10.1145/566282.566312

Duoduo Liao, S. Fang

引用次数: 25

Reconstruction of feature volumes and feature suppression 特征体重构与特征抑制

International Conference on Smart Media and Applications Pub Date : 2002-06-17 DOI: 10.1145/566282.566295

S. Venkataraman, M. Sohoni

引用次数: 39

A geometric algorithm for selecting optimal set of cutters for multi-part milling 多零件铣削优选刀具组合的几何算法

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

Zhiyang Yao, Satyandra K. Gupta, Dana S. Nau

{"title":"A geometric algorithm for selecting optimal set of cutters for multi-part milling","authors":"Zhiyang Yao, Satyandra K. Gupta, Dana S. Nau","doi":"10.1145/376957.376973","DOIUrl":"https://doi.org/10.1145/376957.376973","url":null,"abstract":"For the manufacture of milled parts, it is well known that the size of the cutter significantly affects the machining time. However, for small-batch manufacturing, the time spent on loading tools into the tool magazine and establishing z-length compensation values is just as important. If we can select a set of milling tools that will produce good machining time on more than one type of parts, then several unnecessary machine-tool reconfiguration operations can be eliminated. This paper describes a geometric algorithm for finding an optimal set of cutters for machining a set of 2½D parts. In selecting milling cutters we consider both the tool loading time and the machining time and generate solutions that allow us to minimize the total machining time. Our problem formulation addresses the general problem of how to cover a target region to be milled with a cylindrical cutter without intersecting with the obstruction region; this definition allows us to handle both open and closed edges in the target region. Our algorithm improves upon previous work in the tool selection area in following ways: (1) in selecting cutters, it accounts for the tool loading time, and (2) it can simultaneously consider multiple different parts and select the optimal set of cutters to minimize the total manufacturing time.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"59 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":"123400531","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}

引用次数: 20

A geometric algorithm for automated design of multi-stage molds for manufacturing multi-material objects 多材料多阶段模具自动化设计的几何算法

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

Malay Kumar, Satyandra K. Gupta

{"title":"A geometric algorithm for automated design of multi-stage molds for manufacturing multi-material objects","authors":"Malay Kumar, Satyandra K. Gupta","doi":"10.1145/376957.376989","DOIUrl":"https://doi.org/10.1145/376957.376989","url":null,"abstract":"This paper describes a geometric algorithm for automated design of multi-stage molds for manufacturing multi-material objects. In multi-stage molding process, the desired multi-material object is produced by carrying out multiple molding operations in a sequence, adding one material in the target object in each mold-stage. We model multi-material objects as an assembly of single-material components. Each mold-stage can only add one type of material. Therefore, we need a sequence of mold-stages such that (1) each mold-stage only adds one single-material component either fully or partially, and (2) the molding sequence completely produces the desired object. In other to find a feasible mold-stage sequence, our algorithm decomposes the multi-material object into a number of homogeneous components to find a feasible sequence of homogeneous components that can be added in sequence to produce the desired multi-material object. Our algorithm starts with the final object assembly and considers removing components either completely or partially from the object one-at-a-time such that it results in the previous state of the object assembly. If the component can be removed from the target object leaving the previous state of the object assembly a connected solid then we consider such decomposition a valid step in the stage sequence. This step is recursively repeated on new states of the object assembly, until the object assembly reaches a state where it only consists of one component. When an object-decomposition has been found that leads to a feasible stage sequence, the gross mold for each stage is computed and decomposed into two or more pieces to facilitate the molding operation. We expect that our algorithm will provide a step towards automating the design of multi-stage molds and therefore will help in reducing the mold design lead-time for multi-stage molds.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"9 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":"128031684","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}

引用次数: 9

Intelligent balloon: a subdivision-based deformable model for surface reconstruction of arbitrary topology 智能气球:一种基于细分的任意拓扑曲面重构变形模型

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

Y. Duan, Hong Qin

{"title":"Intelligent balloon: a subdivision-based deformable model for surface reconstruction of arbitrary topology","authors":"Y. Duan, Hong Qin","doi":"10.1145/376957.376963","DOIUrl":"https://doi.org/10.1145/376957.376963","url":null,"abstract":"In this paper, we develop a novel subdivision-based model—Intelligent Balloon—which is capable of recovering arbitrary, complicated shape geometry as well as its unknown topology simultaneously. Our Intelligent Balloon is a parameterized subdivision surface whose geometry and its deformable behaviors are governed by the principle of energy minimization. Our algorithm starts from a simple seed model (of genus zero) that can be arbitrarily initiated by users within regions of interest. The growing behavior of our model is controlled by a locally defined objective function associated with each vertex. Through the numerical integration of function optimization, our algorithm can adaptively subdivide the model geometry, automatically detect self-collision of the model, properly modify its topology (because of the occurrence of self-collision), correctly evolve the model towards the region boundary and reduce fitting error and improve fitting quality via global subdivision. Commonly used mesh optimization techniques are employed throughout the geometric deformation and topological variation in order to ensure the model both locally smooth and globally well conditioned. We have applied our topologically flexible models to such applications as reverse engineering from range data and surface reconstruction from volumetric image data. Our new models prove to be very powerful and extremely useful for boundary representation of complicated solids of arbitrary topology, shape recovery and segmentation for medical imaging, and iso-surface extraction for visualization.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"20 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":"121976373","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}

引用次数: 22

Analysis of boundary representation model rectification 边界表示模型修正分析

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

G. Shen, T. Sakkalis, N. Patrikalakis

引用次数: 17