Graphical Models and Image Processing最新文献_第2页

Approximate Implicitization Using Monoid Curves and Surfaces 使用单曲线和曲面的近似隐式化

Graphical Models and Image Processing Pub Date : 1999-07-01 DOI: 10.1006/gmip.1999.0497

Thomas W. Sederberg , Jianmin Zheng , Kris Klimaszewski , Tor Dokken

引用次数: 39

An Algebraic Solution to Surface Recovery from Cross-Sectional Contours 从横截面轮廓面恢复的代数解

Graphical Models and Image Processing Pub Date : 1999-07-01 DOI: 10.1006/gmip.1999.0499

G Cong , B Parvin

{"title":"An Algebraic Solution to Surface Recovery from Cross-Sectional Contours","authors":"G Cong , B Parvin","doi":"10.1006/gmip.1999.0499","DOIUrl":"https://doi.org/10.1006/gmip.1999.0499","url":null,"abstract":"<div><p>A new approach for reconstruction of 3D surfaces from 2D cross-sectional contours is presented. By using the so-called “equal importance criterion,” we reconstruct the surface based on the assumption that every point in the region contributes equally to the surface reconstruction process. In this context, the problem is formulated in terms of a partial differential equation, and we show that the solution for dense contours (contours in close proximity) can be efficiently derived from the distance transform. In the case of sparse contours, we add a regularization term to ensure smoothness in surface recovery. The approach is also generalized to other types of cross-sectional contours, where the spine may not be a straight line. The proposed technique allows for surface recovery at any desired resolution. The main advantages of our method is that inherent problems due to correspondence, tiling, and branching are avoided. In contrast to existing implicit methods, we find an optimal field function and develop an interpolation method that does not generate any artificial surfaces. We will demonstrate that the computed high-resolution surface is well represented for subsequent geometric analysis. We present results on both synthetic and real data.</p></div>","PeriodicalId":100591,"journal":{"name":"Graphical Models and Image Processing","volume":"61 4","pages":"Pages 222-243"},"PeriodicalIF":0.0,"publicationDate":"1999-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1006/gmip.1999.0499","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"92079317","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}

引用次数: 24

Shape Reconstruction from Contours Using Isotopic Deformation 利用同位素变形从等高线重建形状

Graphical Models and Image Processing Pub Date : 1999-05-01 DOI: 10.1006/gmip.1999.0494

Kikuo Fujimura , Eddy Kuo

{"title":"Shape Reconstruction from Contours Using Isotopic Deformation","authors":"Kikuo Fujimura , Eddy Kuo","doi":"10.1006/gmip.1999.0494","DOIUrl":"10.1006/gmip.1999.0494","url":null,"abstract":"<div><p>A method for shape reconstruction from contours using isotopic deformation is presented. The proposed method considers the case where one contour encloses the other contour when they are projected in a common plane, as is the case for terrain contour maps. Unlike many other methods which generate piecewise linear interpolation, the proposed method smoothly interpolates between two contours located in parallel planes. The algorithm runs in <em>O</em>(<em>nk</em>+<em>n</em> log <em>n</em>) time, where <em>n</em> is the total number of vertices in two contours and <em>k</em> is an integer variable less than <em>n</em> which indicates how convoluted the contours are (the larger, the more convoluted). The running time of the algorithm is shown to be worst-case optimal for the class of task defined. The reconstructed shape is free of self-intersections and it can incorporate given feature correspondences. The method is extended to handle bifurcations and is shown to cope easily with some cases which are problematic for some other algorithms. The method proposed is suitable for terrain modeling, since reconstructed shapes generated by the method do not have overhangs. Experimental results are included to illustrate the feasibility of the approach.</p></div>","PeriodicalId":100591,"journal":{"name":"Graphical Models and Image Processing","volume":"61 3","pages":"Pages 127-147"},"PeriodicalIF":0.0,"publicationDate":"1999-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1006/gmip.1999.0494","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115833498","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

Parameter-Controlled Volume Thinning 参数控制体积细化

Graphical Models and Image Processing Pub Date : 1999-05-01 DOI: 10.1006/gmip.1999.0495

Nikhil Gagvani , Deborah Silver

引用次数: 149

Approximating Curves via Alpha Shapes 通过Alpha形状逼近曲线

Graphical Models and Image Processing Pub Date : 1999-05-01 DOI: 10.1006/gmip.1999.0496

Takis Sakkalis , Ch Charitos

引用次数: 16

Topologically Reliable Approximation of Trimmed Polynomial Surface Patches 修剪多项式表面斑块的拓扑可靠逼近

Graphical Models and Image Processing Pub Date : 1999-03-01 DOI: 10.1006/gmip.1999.0483

Wonjoon Cho , Takashi Maekawa , Nicholas M. Patrikalakis , Jaime Peraire

{"title":"Topologically Reliable Approximation of Trimmed Polynomial Surface Patches","authors":"Wonjoon Cho , Takashi Maekawa , Nicholas M. Patrikalakis , Jaime Peraire","doi":"10.1006/gmip.1999.0483","DOIUrl":"10.1006/gmip.1999.0483","url":null,"abstract":"<div><p>We present an unstructured triangular mesh generation algorithm that approximates a set of mutually nonintersecting simple trimmed polynomial parametric surface patches within a user specified geometric tolerance. The proposed method uses numerically robust interval geometric representations/computations and also addresses the problem of topological consistency (homeomorphism) between the exact geometry and its approximation. Those are among the most important outstanding issues in geometry approximation problems. We also extract important differential geometric features of input geometry for use in the approximation. Our surface tessellation algorithm is based on the unstructured Delaunay mesh approach which leads to an efficient adaptive triangulation. A robust decision criterion is introduced to prevent possible failures in the conventional Delaunay triangulation. To satisfy the prescribed geometric tolerance, an adaptive node insertion algorithm is employed and furthermore, an efficient method to compute a tight upper bound of the approximation error is proposed. Unstructured triangular meshes for free-form surfaces frequently involve triangles with high aspect ratio and, accordingly, result in ill-conditioned meshing. Our proposed algorithm constructs 2D triangulation domains which sufficiently preserve the shape of triangles when mapped into 3D space and, furthermore, the algorithm provides an efficient method that explicitly controls the aspect ratio of the triangular elements.</p></div>","PeriodicalId":100591,"journal":{"name":"Graphical Models and Image Processing","volume":"61 2","pages":"Pages 84-109"},"PeriodicalIF":0.0,"publicationDate":"1999-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1006/gmip.1999.0483","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130649833","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}

引用次数: 18

On Surface Approximation Using Developable Surfaces 利用可展曲面的曲面逼近

Graphical Models and Image Processing Pub Date : 1999-03-01 DOI: 10.1006/gmip.1999.0487

H.-Y. Chen , I.-K. Lee , S. Leopoldseder , H. Pottmann , T. Randrup , J. Wallner

引用次数: 84

Photogrammetric Texture Mapping onto Planar Polygons 摄影测量纹理映射到平面多边形

Graphical Models and Image Processing Pub Date : 1999-03-01 DOI: 10.1006/gmip.1999.0491

Frederick M. Weinhaus , Robert N. Devich

{"title":"Photogrammetric Texture Mapping onto Planar Polygons","authors":"Frederick M. Weinhaus , Robert N. Devich","doi":"10.1006/gmip.1999.0491","DOIUrl":"10.1006/gmip.1999.0491","url":null,"abstract":"<div><p>This paper presents a mathematical description of texture mapping onto planar polygons from a photogrammetry viewpoint. In principle, this approach can accommodate textures acquired from a variety of camera systems including panoramic, strip, pushbroom, multispectral scanners and synthetic aperture radar, as well as the common frame (snap-shot) camera. The main focus of this paper, however, is the frame camera. When this type of camera photographs an object obliquely, the transformation between polygon and texture is characterized by a perspective projection rather than an affine transformation. In particular, we derive the rational linear texture mapping transformation equation and show how to compute its coefficients in two ways using known values for the relevant camera parameters. We also show that the denominator term in this transformation is not equivalent to perspective depth as it is when the textures are face-on to the polygon surface. Although the specific case of perspective texture projection onto planar polygons has been discussed before using techniques based upon homogeneous coordinates, we believe that this paper will be interesting and beneficial due to the intuitive basis of the photogrammetry concepts.</p></div>","PeriodicalId":100591,"journal":{"name":"Graphical Models and Image Processing","volume":"61 2","pages":"Pages 63-83"},"PeriodicalIF":0.0,"publicationDate":"1999-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1006/gmip.1999.0491","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128642040","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

Euclidean Paths: A New Representation of Boundary of Discrete Regions 欧几里得路径:离散区域边界的一种新表示

Graphical Models and Image Processing Pub Date : 1999-01-01 DOI: 10.1006/gmip.1999.0488

Jean-Pierre Braquelaire, Anne Vialard

引用次数: 35

C-Bézier curves and surfaces c - bsamzier曲线和曲面

Graphical Models and Image Processing Pub Date : 1999-01-01 DOI: 10.1006/GMIP.1999.0490

Jiwen Zheng

引用次数: 50