Deok-Soo Kim, Joonghyun Ryu, Hyun-Chan Lee, Hayong Shin, J. Park, Taeboom Jang
{"title":"Fast conversion of dynamic B spline curves into a set of power form polynomial curves","authors":"Deok-Soo Kim, Joonghyun Ryu, Hyun-Chan Lee, Hayong Shin, J. Park, Taeboom Jang","doi":"10.1109/GMAP.2000.838265","DOIUrl":"https://doi.org/10.1109/GMAP.2000.838265","url":null,"abstract":"Computation of the characteristic points such as inflection points or cusp on a curve is often necessary in CAGD applications. When a curve is represented in a B-spline form, such computations can be made easier once it is transformed in a set of polynomial curves in a power form. Once a curve is represented in a power form, a point evaluation can be also made faster due to Horner's rule even though some issues of stability remains. In addition, the implicitization process of a parametric curve using a resultant usually requires the geometry represented in a power form. Usual practice of the transformation of a B-spline curve into a set of piecewise polynomial curves in a power form is done by either a knot refinement followed by basis conversions, or applying a Taylor expansion on the B-spline curve for each knot span. Presented in this paper is a new algorithm, called direct expansion, for the problem. The algorithm first locates the coefficients of all the linear terms that make up the basis functions in a knot span, and then the algorithm directly obtains the power form representation of basis functions by expanding the summation of products of appropriate linear terms. Then, a polynomial segment of a knot span can be easily obtained by the summation of products of the basis functions within the knot span with corresponding control points. Repeating this operation for each knot span, all of the polynomials of the B-spline curve can be transformed into a power form.","PeriodicalId":386798,"journal":{"name":"Proceedings Geometric Modeling and Processing 2000. Theory and Applications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122629258","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":"On-line polygon refining using a low computation subdivision algorithm","authors":"Yuan-Chung Lee, C. Jen","doi":"10.1109/GMAP.2000.838253","DOIUrl":"https://doi.org/10.1109/GMAP.2000.838253","url":null,"abstract":"Subdivision algorithms have been extensively used in computer graphics to produce a more accurate geometry model. For the purpose of integration into the context of a standard graphics pipeline for real-time display, we can only make use of the available information of one triangle. We propose a low computation cost algorithm to subdivide a polygon using vertex coordinates and vertex normal vectors of one triangle. Compared with other suitable algorithms, our algorithm produces decent results with lowest computational complexity. We also consider the generation of interpolated normal vectors and texture mapping parameters. Detailed comparisons among other suitable algorithms are presented.","PeriodicalId":386798,"journal":{"name":"Proceedings Geometric Modeling and Processing 2000. Theory and Applications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129164638","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":"Robust watermarking of polygonal meshes","authors":"M. G. Wagner","doi":"10.1109/GMAP.2000.838252","DOIUrl":"https://doi.org/10.1109/GMAP.2000.838252","url":null,"abstract":"This paper presents two variations of a robust watermarking method for general polygonal meshes of arbitrary topology which can be used for copyright protection, tamper proofing or content annotation purposes. The proposed watermark is immune to translation, rotation, scaling or affine transformation of the mesh and is hard to detect unless the exact encoding parameters are disclosed. Several examples demonstrate the effectiveness of the algorithm.","PeriodicalId":386798,"journal":{"name":"Proceedings Geometric Modeling and Processing 2000. Theory and Applications","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126880335","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":"Reverse engineering B-rep models from multiple point clouds","authors":"T. Várady, Pál Benkö","doi":"10.1109/GMAP.2000.838234","DOIUrl":"https://doi.org/10.1109/GMAP.2000.838234","url":null,"abstract":"The procedure of reconstructing conventional engineering objects from multiple-view 3D point clouds is described. Emphasis is put on producing accurate and topologically consistent B-rep models, ready to be used in computer aided design and manufacture. After describing the basic phases of reverse engineering, related algorithmic difficulties are analyzed. Three particular areas are discussed in more detail: segmenting point data into regions, creating translational and rotational surfaces with smooth, constrained profiles, and finally adding blends. The results of the algorithms are illustrated using a mechanical engineering object, which is a well-known benchmark in the RE community.","PeriodicalId":386798,"journal":{"name":"Proceedings Geometric Modeling and Processing 2000. Theory and Applications","volume":"235 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133880073","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":"Approximating NURBS curves by arc splines","authors":"Xunnian Yang","doi":"10.1109/GMAP.2000.838249","DOIUrl":"https://doi.org/10.1109/GMAP.2000.838249","url":null,"abstract":"It is desirable to approximate a smooth curve by arc splines with the fewest segments within a prescribed tolerance. We present an efficient algorithm for fitting planar smooth curves by arc splines. The main idea is that we construct the optimal arc spline by optimizing the interpolating biarc curve. The scheme consists of three steps: sampling the curve based on consecutive tangent deviation; construct the interpolating arc spline; and reduce the arc number to the minimum within a prescribed tolerance. The algorithm can control the approximating error efficiently and results in the fewest number of arc segments.","PeriodicalId":386798,"journal":{"name":"Proceedings Geometric Modeling and Processing 2000. Theory and Applications","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114413010","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 system for constructing boundary representation solid models from a two-dimensional sketch","authors":"Peter Ashley Clifford Varley, Ralph Robert Martin","doi":"10.1109/GMAP.2000.838235","DOIUrl":"https://doi.org/10.1109/GMAP.2000.838235","url":null,"abstract":"This paper describes a system which converts a two-dimensional sketch with hidden lines removed of a single polyhedral object into a boundary representation solid model. The system improves on a previous system by Grimstead (1997) by analysing the sketch for symmetry elements and regularities. It uses the results of this analysis to produce a more plausible topological completion of the hidden parts of the object, and to enforce exact constraints on the geometry of the boundary-representation model.","PeriodicalId":386798,"journal":{"name":"Proceedings Geometric Modeling and Processing 2000. Theory and Applications","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123404987","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":"Bounding interval rational Bezier curves with interval polynomial Bezier curves","authors":"Falai Chen, T. Sederberg, Wenping Lou","doi":"10.1109/GMAP.2000.838264","DOIUrl":"https://doi.org/10.1109/GMAP.2000.838264","url":null,"abstract":"In this paper we put forward and study the problem of bounding an interval rational Bezier curve with an interval polynomial Bezier curve. We propose three different methods-hybrid method, perturbation method and linear programming method to solve this problem. Examples are illustrated to compare the three different methods. The empirical results show that the perturbation method and the linear programming method produce much tighter bounds than the hybrid method, though they are computationally several times more expensive.","PeriodicalId":386798,"journal":{"name":"Proceedings Geometric Modeling and Processing 2000. Theory and Applications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122096158","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":"Rational parametrization of canal surface by 4 dimensional Minkowski Pythagorean hodograph curves","authors":"H. Choi, Doo-Seok Lee","doi":"10.1109/GMAP.2000.838261","DOIUrl":"https://doi.org/10.1109/GMAP.2000.838261","url":null,"abstract":"Lorentzian geometry with a Minkowski Pythagorean hodograph (MPH) formalism in R/sup 3,1/ gives us a new and insightful method of rational parametrization of canal surfaces. Our previous works about MPH curves in R/sup 3,1/ shows that a curve /spl gamma/(t)=(x(t),y(t),z(t),r(t)) in R/sup 3,1/ can be represented by the PH representation map in Cl(3,1) which avoids the complex root finding algorithm. Our parametrization method gives us the flexibility to represent the canal surfaces within their fiber ambiguities. This paper constitutes the first step of our ongoing work which deals with the issues for canal surfaces in a truly new and intriguing manner such as finding rotation minimizing frames. We believe this is just the tip of the iceberg and the further work will yield many valuable applications in the area of canal surfaces.","PeriodicalId":386798,"journal":{"name":"Proceedings Geometric Modeling and Processing 2000. Theory and Applications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129314761","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":"Effect of fabric properties on cloth draping modeling","authors":"C. Au, Zhiming Wu, M. Yuen","doi":"10.1109/GMAP.2000.838239","DOIUrl":"https://doi.org/10.1109/GMAP.2000.838239","url":null,"abstract":"Cloth draping is of particular interest in the field of garment engineering. Most cloth draping simulation stresses the visual effects of garment design. However, the accuracy of the draping effect should not be overlooked, particularly for garment manufacturing. The accuracy of the draping behaviour is largely affected by the fabric properties. This paper discusses the issue of incorporating the fabric properties into the cloth model, so that its draping behaviour can be realistically simulated. These fabric properties are expressed in terms of a set of measurable mechanical properties. The draping behaviour of the cloth is derived based on elastic theory. Dynamic draping simulation is presented with illustrative examples.","PeriodicalId":386798,"journal":{"name":"Proceedings Geometric Modeling and Processing 2000. Theory and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130780956","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":"Optimization of knots for the multi curve B-spline approximation","authors":"T. Prahasto, S. Bedi","doi":"10.1109/GMAP.2000.838247","DOIUrl":"https://doi.org/10.1109/GMAP.2000.838247","url":null,"abstract":"This article presents a method for multi curve approximation with B-splines. The approximation is formulated as a constrained optimization problem with the least squares error as the objective function and the knot vector as the variables. The method presented in this article is designed to eliminate the well-known lethargic behaviour and to maintain the accuracy of control points. The method for fitting skeletal curves was tested on a single-section case and a multi-section case. The tests showed that the method reduces the objective function significantly. The proposed method has potential applications in the shape design of wings, turbine blades and automotive body panels.","PeriodicalId":386798,"journal":{"name":"Proceedings Geometric Modeling and Processing 2000. Theory and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131311550","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}