C. H. Gao, F. Langbein, A. Marshall, Ralph Robert Martin
{"title":"Approximate congruence detection of model features for reverse engineering","authors":"C. H. Gao, F. Langbein, A. Marshall, Ralph Robert Martin","doi":"10.1109/SMI.2003.1199603","DOIUrl":"https://doi.org/10.1109/SMI.2003.1199603","url":null,"abstract":"Reverse engineering allows the geometric reconstruction of simple mechanical parts. However, the resulting models suffer from inaccuracies caused by errors in measurement and reconstruction so such models do not have the exact congruence, symmetries and other regularities the original designer intended. We wish to impose such regularities in a beautification process. The paper discusses the particular problem of detecting approximate congruence between parts (e.g. a pair of handles) of a reconstructed B-rep model, so that a subsequent step can enforce them exactly. A practical detection algorithm is given for models defined using planes, spheres, cylinders, cones and tori. Analysis of the algorithm and experimental results show that expected congruence are detected reasonably quickly.","PeriodicalId":439885,"journal":{"name":"2003 Shape Modeling International.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124792988","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":"In search of textons","authors":"H. Shum","doi":"10.1109/SMI.2003.1199616","DOIUrl":"https://doi.org/10.1109/SMI.2003.1199616","url":null,"abstract":"Texture analysis and synthesis have been studied extensively by many vision and graphics researchers. A very useful concept in texture analysis is texton or the basic element of a texture image. However, it remains unclear how to define a texton despite the fact that Julesz proposed the term \"texton\" more than twenty years ago. The author proposes a two-level statistical model with textons and their distribution for texture analysis and synthesis, with the emphasis on how to define textons computationally. Specifically, the author presents recent work on searching for 2D textons in patch-based texture synthesis (ACM ToG, July 2001), 3D textons in bi-directional texture function (BTF) synthesis (Siggraph'2002) and 1D motion textons in motion texture synthesis (Siggraph'2002).","PeriodicalId":439885,"journal":{"name":"2003 Shape Modeling International.","volume":"18 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125815163","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":"Ray tracing point set surfaces","authors":"A. Adamson, M. Alexa","doi":"10.1109/SMI.2003.1199627","DOIUrl":"https://doi.org/10.1109/SMI.2003.1199627","url":null,"abstract":"Point set surfaces (PSS) are a smooth manifold surface approximation from a set of sample points. The surface definition is based on a projection operation that constructs local polynomial approximations and respects a minimum feature size. We present techniques for ray tracing PSSs. For the computation of ray-surface intersection the properties of the projection operation are exploited. The surface is enclosed by a union of minimum feature size spheres. A ray is intersected with the spheres first and inside the spheres with local polynomial approximations. Our results show that 2-3 projections are sufficient to accurately intersect a ray with the surface.","PeriodicalId":439885,"journal":{"name":"2003 Shape Modeling International.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134097787","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":"An overview on properties and efficacy of topological skeletons in shape modeling","authors":"S. Biasotti, S. Marini, M. Mortara, G. Patané","doi":"10.1109/SMI.2003.1199624","DOIUrl":"https://doi.org/10.1109/SMI.2003.1199624","url":null,"abstract":"The paper investigates the main issues related to the definition of abstraction tools for deriving high-level descriptions of complex geometric models. Among the wide range of shape descriptors, topological graph-like representations not only give a powerful and synthetic sketch of the object, but also capture its inner structure, that is how features connect together to give the overall shape. This aspect makes them useful to describe complex 3D objects in various applications like modeling, morphing, matching and recognition. The paper surveys the main properties of skeletons developed in shape modeling for representing objects.","PeriodicalId":439885,"journal":{"name":"2003 Shape Modeling International.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131664476","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":"An interpolatory subdivision for volumetric models over simplicial complexes","authors":"Yu-Sung Chang, K. T. McDonnell, Hong Qin","doi":"10.1109/SMI.2003.1199610","DOIUrl":"https://doi.org/10.1109/SMI.2003.1199610","url":null,"abstract":"Subdivision has gained popularity in computer graphics and shape modeling during the past two decades, yet volumetric subdivision has received much less attention. In this paper, we develop a new subdivision scheme, which can interpolate all of the initial control points in 3D and generate a continuous volume in the limit. We devise a set of solid subdivision rules to facilitate a simple subdivision procedure. The conversion between the subdivided mesh and a simplicial complex is straightforward and effective, which can be directly utilized in solid meshing, finite element simulation, and other numerical processes. In principle, our solid subdivision process is a combination of simple linear interpolations in 3D. Affine operations of neighboring control points produce new control points in the next level, yet inherit the original control points and achieve the interpolatory effect. A parameter is offered to control the tension between control points. The interpolatory property of our solid subdivision offers many benefits, which are desirable in many design applications and physics simulations, including intuitive manipulation on control points and ease of constraint enforcement in numerical procedures. We outline a proof that can guarantee the convergence and C/sup 1/ continuity of our volumetric subdivision and limit volumes in regular cases. In addition to solid subdivision, we derive special rules to generate C/sup 1/ surfaces as B-reps and to model shapes of non-manifold topology. Several examples demonstrate the ability of our subdivision to handle complex manifolds easily. Numerical experiments and future research suggestions for extraordinary cases are also presented.","PeriodicalId":439885,"journal":{"name":"2003 Shape Modeling International.","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128077620","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}
Hari Sundar, D. Silver, N. Gagvani, Sven J. Dickinson
{"title":"Skeleton based shape matching and retrieval","authors":"Hari Sundar, D. Silver, N. Gagvani, Sven J. Dickinson","doi":"10.1109/SMI.2003.1199609","DOIUrl":"https://doi.org/10.1109/SMI.2003.1199609","url":null,"abstract":"We describe a novel method for searching and comparing 3D objects. The method encodes the geometric and topological information in the form of a skeletal graph and uses graph matching techniques to match the skeletons and to compare them. The skeletal graphs can be manually annotated to refine or restructure the search. This helps in choosing between a topological similarity and a geometric (shape) similarity. A feature of skeletal matching is the ability to perform part-matching, and its inherent intuitiveness, which helps in defining the search and in visualizing the results. Also, the matching results, which are presented in a per-node basis can be used for driving a number of registration algorithms, most of which require a good initial guess to perform registration. We also describe a visualization tool to aid in the selection and specification of the matched objects.","PeriodicalId":439885,"journal":{"name":"2003 Shape Modeling International.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129260456","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":"Higher order prediction for geometry compression","authors":"S. Gumhold, R. Amjoun","doi":"10.1109/SMI.2003.1199602","DOIUrl":"https://doi.org/10.1109/SMI.2003.1199602","url":null,"abstract":"A lot of techniques have been developed for the encoding of triangular meshes as this is a widely used representation for the description of surface models. Although methods for the encoding of the neighbor information, the connectivity, are near optimal, there is still room for better en-codings of vertex locations, the geometry. Our geometry encoding strategy follows the predictive coding paradigm, which is based on a region growing encoding order. Only the delta vectors between original and predicted locations are encoded in a local coordinate system, which splits into two tangential and one normal component. In this paper we introduce so-called higher order prediction for an improved encoding of the normal component. We first encode the tangential components with parallelogram prediction. Then we fit a higher order surface to the so far encoded geometry. As we encode the normal component as a bending angle, it is found by intersecting the higher order surface with the circle defined by the tangential components. Experimental results show that our strategy allows saving one bit per vertex for the normal component independent of the tangential prediction rule used.","PeriodicalId":439885,"journal":{"name":"2003 Shape Modeling International.","volume":"190 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121348389","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":"Watermarking 2D vector maps in the mesh-spectral domain","authors":"Ryutarou Ohbuchi, Hiroo Ueda, S. Endoh","doi":"10.1109/SMI.2003.1199619","DOIUrl":"https://doi.org/10.1109/SMI.2003.1199619","url":null,"abstract":"The paper proposes a digital watermarking algorithm for 2D vector digital maps. The watermark is a robust, informed-detection watermark to be used to prevent such abuses as an intellectual property rights violation. The algorithm proposed in the paper embeds watermarks in the frequency-domain representation of a 2D vector digital map. Our method treats vertices in the map as a point set, and imposes connectivity among the points by using Delaunay triangulation. The method then computes the mesh-spectral coefficients (Karni, 2000) from the mesh created. Modifications of the coefficients according to the message bits, and inverse transforming the coefficients back into the coordinate domain produces the watermarked map. Our evaluation experiments showed that the watermark produced by the method is resistant against additive random noise, similarity transformation, vertex insertion and removal. It is also resistant, to some extent, against cropping. Compared to our previous algorithm (Ohbuchi, 2002), the algorithm described in this paper showed significantly improved attack resiliency.","PeriodicalId":439885,"journal":{"name":"2003 Shape Modeling International.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131579325","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}
J. Rossignac, M. Allen, W. Book, A. Glezer, I. Ebert‐Uphoff, Christopher D. Shaw, D. Rosen, S. Askins, Jing Bai, P. Bosscher, Joshua Gargus, Byungmoon Kim, Ignacio Llamas, Austina Nguyen, G. Yuan, Haihong Zhu
{"title":"Finger sculpting with Digital Clay: 3D shape input and output through a computer-controlled real surface","authors":"J. Rossignac, M. Allen, W. Book, A. Glezer, I. Ebert‐Uphoff, Christopher D. Shaw, D. Rosen, S. Askins, Jing Bai, P. Bosscher, Joshua Gargus, Byungmoon Kim, Ignacio Llamas, Austina Nguyen, G. Yuan, Haihong Zhu","doi":"10.1109/SMI.2003.1199620","DOIUrl":"https://doi.org/10.1109/SMI.2003.1199620","url":null,"abstract":"The NSF Digital Clay project is focused on the design, prototyping, integration, and validation of a computer-controlled physical device capable of taking any of a wide range of possible shapes in response to changes in a digital 3D model or to changes in the pressure exercised upon it by human hands. Although it clearly is a natural and unavoidable evolution of 3D graphical user interfaces, its unprecedented capabilities constitute a major leap in technologies and paradigms for 3D display, for 3D input, and for collaborative 3D design. In this paper, we provide an overview of the Digital Clay project and discuss the challenges, design choices, and initial solutions for a new finger sculpting interface designed for the Digital Clay and prototyped using conventional 3D I/O hardware.","PeriodicalId":439885,"journal":{"name":"2003 Shape Modeling International.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128236043","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":"Hardware-accelerated visualization of volume-sampled distance fields","authors":"Shuntaro Yamazaki, K. Kase, K. Ikeuchi","doi":"10.1109/SMI.2003.1199626","DOIUrl":"https://doi.org/10.1109/SMI.2003.1199626","url":null,"abstract":"We present a method of visualizing volume-sampled distance fields, taking advantage of hardware-acceleration of modern graphics hardware. Although conventional distance fields can represent only 2-manifold surfaces in a stable way, we have developed a technique of representing both manifold and non-manifold surfaces in a volume created by sampling a segmented distance field. The volume-sampled distance fields can be visualized effectively with pre-integrated volume rendering by embedding the interpolating function as a lookup table called vertex generation diagram into graphics hardware. We developed a simple system for smoothly blending two surface models in the distance function domain, and confirmed that our proposed representation of surface models is applicable to existing methods of geometric processing using implicit representations. We also confirmed that proposed methods of deformation and visualization can be executed at sufficient quality and speed using commodity graphics hardware on a standard PC.","PeriodicalId":439885,"journal":{"name":"2003 Shape Modeling International.","volume":"206 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134484089","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}