{"title":"Smooth Surface Constructions via a Higher-Order Level-Set Method","authors":"C. Bajaj, Guoliang Xu, Qin Zhang","doi":"10.1109/CADCG.2007.4407841","DOIUrl":"https://doi.org/10.1109/CADCG.2007.4407841","url":null,"abstract":"We present a general framework for a higher-order spline level-set (HLS) method and apply this to smooth surface constructions. Starting from a first order energy functional, we obtain a general level set formulation of geometric partial differential equation, and provide an efficient approach to solve this partial differential equation using a C2 spline basis. We also present a fast cubic spline interpolation algorithm based on convolution and the Z-transform, which exploits the local relationship of interpolatory cubic spline coefficients with respect to given function data values. We provide two demonstrative smooth surface construction examples of our HLS method. The first is the construction of a smooth surface model (an implicit solvation interface) of bio-molecules in solvent, given their individual atomic coordinates and solvated radii. The second is the smooth surface reconstruction from a cloud of points generated from a 3D surface scanner.","PeriodicalId":143046,"journal":{"name":"2007 10th IEEE International Conference on Computer-Aided Design and Computer Graphics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133125173","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}
{"title":"Transistor Level Timing Analysis Considering Multiple Inputs Simultaneous Switching","authors":"Zhentao Li, Shuming Chen","doi":"10.1109/CADCG.2007.4407901","DOIUrl":"https://doi.org/10.1109/CADCG.2007.4407901","url":null,"abstract":"To overcome the problems of traditional delay models, this paper uses a circuit simulator to calculate gate delay in static timing analysis. We analyzed the effect of multiple inputs simultaneous switching(MISS) on gate delay and proposed a MISS model to calculate the worst case gate delay. Based on this model, we developed the test waveform generation algorithms for complementary CMOS logic and pass transistor logic. By combining gate delay simulation with functional model extraction techniques of transistor circuits, we implemented a transistor level static timing analysis tool called SpiceTime. Results on ten IS-CAS85 benchmark circuits indicated that modules of significant size can be verified by SpiceTime with high precisions.","PeriodicalId":143046,"journal":{"name":"2007 10th IEEE International Conference on Computer-Aided Design and Computer Graphics","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115330542","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}
{"title":"Surface Remeshing on Triangular Domain for CAD Applications","authors":"Qingwei Guo, Weining Yue, Guoping Wang","doi":"10.1109/CADCG.2007.4407893","DOIUrl":"https://doi.org/10.1109/CADCG.2007.4407893","url":null,"abstract":"In this paper a systematic remeshing method of triangle mesh surface is proposed for CAD applications. A density-sensitive edge marking function is proposed for surface resampling. Surface energy minimization is used to redistribute vertices for face geometry regularization. A simulated annealing method is proposed for vertex connectivity optimization. During each stage, the deviations from original mesh are prevented, and the boundaries and features are well preserved. While all modifications are performed locally, the error-prone global parameterization is entirely avoided. The advantage and robustness of this technique are verified by many examples from real-world product design.","PeriodicalId":143046,"journal":{"name":"2007 10th IEEE International Conference on Computer-Aided Design and Computer Graphics","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115516165","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}
{"title":"Applications of Complete Orthogonal V-system with Multiresolution Property","authors":"Xiaochun Wang, Yanyan Liang, Hui Ma, Ruixia Song","doi":"10.1109/CADCG.2007.4407849","DOIUrl":"https://doi.org/10.1109/CADCG.2007.4407849","url":null,"abstract":"V-system, a new class of complete orthogonal system in L2[0,1], is the generalization of the well-known Haar system and consists of not only smooth functions but also discontinuous functions at multi-levels. Therefore, the V-system can be applied to represent the information with both continuous and discontinuous signals, which is fundamentally different from that of Fourier orthogonal system. In this paper, we first describe the multiresolution property of the V-system, then point out that a graphics group can be reconstructed precisely by finite terms of the V-series, finally discuss the classification and recognition of graphics groups using the V-descriptor. It shows from the experiments that the V-system can be applied to the fields of reconstruction of graphics group and pattern recognition.","PeriodicalId":143046,"journal":{"name":"2007 10th IEEE International Conference on Computer-Aided Design and Computer Graphics","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116676465","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}
{"title":"High Resolution Medical Models and Geometric Reasoning starting from CT/MR Images","authors":"Karupppasamy Subburaj, B. Ravi","doi":"10.1109/CADCG.2007.4407925","DOIUrl":"https://doi.org/10.1109/CADCG.2007.4407925","url":null,"abstract":"The ubiquitous availability of high power' computers has opened up the possibility of handling large (high resolution) volumetric data to accurately represent medical models, and performing geometric reasoning for various applications. In this paper, we present an efficient protocol to reconstruct accurate medical models from CT/MR images having equal or unequal values of slice thickness, inter slice distance, and pixel size. It involves modifying the slice thickness while leaving the in-slice resolution intact; issues such as slice overlap and inter-slice gap are handled using slice based interpolation. Noise reduction and better delineation of object boundaries and segmentation are performed in voxel space. Geometric analysis of reconstructed volumetric data is performed to generate internal thickness mapping, useful for pre-operative planning and custom implant design. A test case of pelvic model reconstruction from CT slices is described to illustrate the algorithms.","PeriodicalId":143046,"journal":{"name":"2007 10th IEEE International Conference on Computer-Aided Design and Computer Graphics","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126985060","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}
{"title":"A Meaningful Mesh Segmentation Based on Local Self-similarity Analysis","authors":"Zhi-Quan Cheng, Gang Dang, Shiyao Jin","doi":"10.1109/CADCG.2007.4407896","DOIUrl":"https://doi.org/10.1109/CADCG.2007.4407896","url":null,"abstract":"On the basis of minima rule from the cognitive theory, this paper presents an algorithm decomposing a mesh into smaller parts by feature contours, gotten from the minima negative curvature vertices. The algorithm is carried out in two steps. Firstly, to avoid over-segmentation, our method excludes unimportant local adjacent similar contours. Secondly, the remnant salient contours are automatically completed to form short loops around mesh's parts, constrained by two near parallel cutting planes that are determined by principal component analysis of all vertices. The algorithm has been demonstrated on many meshes, and the results show that it not only can perceptual group the adjacent self-similarity regions, but also can achieve reasonable segmentations.","PeriodicalId":143046,"journal":{"name":"2007 10th IEEE International Conference on Computer-Aided Design and Computer Graphics","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127036445","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}
{"title":"Low-Level Vision Based Super-Resolution Image Reconstruction","authors":"K. Xie, Hai-long Guo, Hai-long Guo","doi":"10.1109/CADCG.2007.4407931","DOIUrl":"https://doi.org/10.1109/CADCG.2007.4407931","url":null,"abstract":"In the process of super-resolution image reconstruction, corner detection and interpolation are two key technologies. In this paper, we proposed two improved methods for them. Firstly we propose a variable threshold for the allowed variation in brightness within the USAN area. The approach makes corner well-distributed and can reduce lost and false corners relatively. Experiments confirm that the method is anti-noisy and has the less computation. Secondly a new adaptive interpolation approach based on circular-area is presented. The approach can adoptively select the interpolation method based on the gray feature of an image.","PeriodicalId":143046,"journal":{"name":"2007 10th IEEE International Conference on Computer-Aided Design and Computer Graphics","volume":"142 7-8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129423891","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}
{"title":"B-spline Surfaces of Clustered Point Sets with Normal Maps","authors":"Yanci Zhang, Hanqiu Sun, E. Wu","doi":"10.1109/CADCG.2007.4407856","DOIUrl":"https://doi.org/10.1109/CADCG.2007.4407856","url":null,"abstract":"In this paper, we propose a novel method that represents the highly-complex point sets by clustering the points to normal-mapped B-spline surfaces (NBSs). The main idea is to construct elaborate normal maps on simple surfaces for the realistic rendering of complex point-set models. Based on this observation, we developed the coarse, normal-mapped B-spline surfaces to approximate the original point datasets with fine surface details. In our algorithm, a genetic clustering algorithm is proposed to automatically segment the point samples into several clusters according to their statistical properties, and a network of B-spline patches with normal maps are constructed according to the clustering results. Our experimental results show that this representation facilitates the modeling and rendering of complex point sets without losing the visual qualities.","PeriodicalId":143046,"journal":{"name":"2007 10th IEEE International Conference on Computer-Aided Design and Computer Graphics","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126131805","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}
{"title":"Interactive Model Decomposition","authors":"Yu-Shuen Wang, Tong-Yee Lee, Chao-Hung Lin","doi":"10.1109/CADCG.2007.4407898","DOIUrl":"https://doi.org/10.1109/CADCG.2007.4407898","url":null,"abstract":"In this paper, we propose an interactive model decomposition scheme. In preprocess, we automatically build a protrusive graph (PG) for any given 3D model. The purpose of the PG is to give the user a good clue to partition the model into visually-significant parts. Then, this scheme can interactively partition models according to the user-specified partitioning requirement. Finally, an iterative clustering is used to stabilize our partitions and a smoothing refinement is used to smooth the boundary between adjacent partitions. The experimental results show that the proposed scheme is a flexible and powerful method to decompose models into their significant components.","PeriodicalId":143046,"journal":{"name":"2007 10th IEEE International Conference on Computer-Aided Design and Computer Graphics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130818667","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}
{"title":"3D Model Deformation via Conformal Mapping","authors":"Zhongxuan Luo, Junxiao Xue","doi":"10.1109/CADCG.2007.4407927","DOIUrl":"https://doi.org/10.1109/CADCG.2007.4407927","url":null,"abstract":"In this paper, we introduce conformal mapping to 3D model deformation. The surface of the solid model is represented by base-patch and cross-section function. Accordingly, the shape of the 3D model can be modified by interactive means, such as changing the corresponding base-patch with conformal mapping and adjusting a cross-section function. There are two features of the proposed method. First, due to the properties of conformal mapping, the scheme satisfies the local demands on rigidity and still allows for considerable global deformation. Second, the deformation effect is predictable and the transformation function of the deformation can be expressed analytically. The proposed transformation of 3D deformation is continuous, not self- intersection, and topologically consistent. Some examples are presented in the end of the paper to illustrate the efficiency of our approach.","PeriodicalId":143046,"journal":{"name":"2007 10th IEEE International Conference on Computer-Aided Design and Computer Graphics","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131633652","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}