检索结果-内蒙古大学图书馆

arXiv 2017年

作者： Pan, Rongjiang Skala, Vaclav School of Computer Science and Technology Shandong University Jinan China Centre of Computer Graphics and Data Visualization Department of Computer Science and Engineering University of West Bohemia Plzen Czech Republic

We introduce a continuous global optimization method to the field of surface reconstruction from discrete noisy cloud of points with weak information on orientation. The proposed method uses an energy functional combining flux-based data-fit measures and a regularization term. A continuous convex relaxation scheme assures the global minima of the geometric surface functional. The reconstructed surface is implicitly represented by the binary segmentation of vertices of a 3D uniform grid and a triangulated surface can be obtained by extracting an appropriate isosurface. Unlike the discrete graph-cut solution, the continuous global optimization entails advantages like memory requirements, reduction of metrication errors for geometric quantities, allowing globally optimal surface reconstruction at higher grid resolutions. We demonstrate the performance of the proposed method on several oriented point clouds captured by laser scanners. Experimental results confirm that our approach is robust to noise, large holes and non-uniform sampling density under the condition of very coarse orientation information. Copyright © 2017, The Authors. All rights reserved.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

Surface reconstruction with higher-order smoothness

arXiv

引用

arXiv 2017年

作者： Pan, Rongjiang Skala, Vaclav School of Computer Science and Technology Shandong University Jinan250100 China Centre of Computer Graphics and Data Visualization Department of Computer Science and Engineering University of West Bohemia Plzen Czech Republic

This work proposes a method to reconstruct surfaces with higher-order smoothness from noisy 3D measurements. The reconstructed surface is implicitly represented by the zero level-set of a continuous valued embedding function. The key idea is to find a function whose higher-order derivatives are regularized and whose gradient is best aligned with a vector field defined by the input point set. In contrast to methods based on the first-order variation of the function that are biased towards the constant functions and treat the extraction of the isosurface without aliasing artifacts as an afterthought, we impose higher-order smoothness directly on the embedding function. After solving a convex optimization problem with a multi-scale iterative scheme, a triangulated surface can be extracted using the marching cubes algorithm. We demonstrated the proposed method on several data sets obtained from raw laser-scanners and multi-view stereo approaches. Experimental results confirm that our approach allows us to reconstruct smooth surfaces from points in the presence of noise, outliers, large missing parts and very coarse orientation information. Copyright © 2017, The Authors. All rights reserved.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Implicit surface modeling suitable for inside/outside tests with radial basis functions

Implicit surface modeling suitable for inside/outside tests ...

引用

2007 10th IEEE International Conference on computer Aided Design and computer graphics, CAD/graphics 2007

作者： Pan, Rongjiang Skala, Vaclav School of Computer Science and Technology Shandong University Jinan 250100 China Centre of Computer Graphics and Data Visualization Department of Computer Science and Engineering University of West Bohemia Plzen 306 14 Czech Republic

ISBN: (纸本)9781424415793

We describe a method for computing an implicit function that represents a surface by its zero level set, given a set of points scattered over the surface and associated with surface normal vectors. This implicit function is defined as a linear combination of compactly supported radial basis functions. Our method is suitable for testing whether a given point is interior or exterior to the surface, previously only associated with globally supported or globally regularized radial basis functions. We use a two-level interpolation approach. In the coarse scale interpolation, we set basis function centers by a grid that covers the enlarged bounding box of the given point set and compute their signed distances to the underlying surface using local quadratic approximations of the nearest surface points. Then a fitting to the residual errors on the surface points and additional off-surface points is performed with fine scale basis functions. The final function is the sum of the two intermediate functions and is a good approximation of the signed distance field to the surface in the bounding box. Examples of surface reconstruction and set operations between shapes are provided. © 2007 IEEE.

关键词： Interpolation

来源：评论

学校读者我要写书评

暂无评论

Implicit Surface Modeling Suitable for Inside/Outside Tests with Radial Basis Functions

Implicit Surface Modeling Suitable for Inside/Outside Tests ...

引用

2007 10th IEEE International Conferences on computer Aided Design and computer graphics(CAD/graphics 2007)

作者： Vaclav Skala Centre of Computer Graphics and Data Visualization Department of Computer Science and EngineeringUniversity of West BohemiaPlzenCzech Republic30614

We describe a method for computing an implicit function that represents a surface by its zero level set,given a set of points scattered over the surface and associated with surface normal *** implicit function is defined as a linear combination of compactly supported radial basis *** method is suitable for testing whether a given point is interior or exterior to the surface,previously only associated with globally supported or globally regularized radial basis *** use a two-level interpolation *** the coarse scale interpolation,we set basis function centers by a grid that covers the enlarged bounding box of the given point set and compute their signed distances to the underlying surface using local quadratic approximations of the nearest surface *** a fitting to the residual errors on the surface points and additional off-surface points is performed with fine scale basis *** final function is the sum of the two intermediate functions and is a good approximation of the signed distance field to the surface in the bounding *** of surface reconstruction and set operations between shapes are provided.

关键词： Implicit Surface Modeling Suitable for Inside/Outside Tests with Radial Basis Functions

来源：评论

学校读者我要写书评

暂无评论

Implicit Surface Modeling Suitable for Inside/Outside Tests with Radial Basis Functions

Implicit Surface Modeling Suitable for Inside/Outside Tests ...

引用

IEEE International Conference on computer-Aided Design and computer graphics

作者： Rongjiang Pan Vaclav Skala School of Computer Science and Technology Shandong University Jinan China Centre of Computer Graphics and Data Visualization Department of Computer Science and Engineering University of West Bohemia Plzen Czech Republic

关键词： Testing Surface fitting Surface reconstruction computer science Interpolation computer graphics data visualization data engineering Level set Scattering

来源：评论

学校读者我要写书评

暂无评论

On triangulations

引用

International Conference on Computational Science and its Applications, ICCSA 2004

作者： Kolingerová, Ivana Centre of Computer Graphics and Data Visualization Department of Computer Science and Engineering University of West Bohemia Plze Czech Republic

ISBN: (纸本)3540220569

Triangulations in 2D and 3D are a necessary part of many applications. This paper brings a brief survey of main triangulations used in computer graphics and computational geometry, then focuses on Delaunay and greedy triangulations in 2D and 3D and presents their most important properties and algorithms. Then three applications from computer graphics and image processing areas are presented and results discussed. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Triangulation

来源：评论

学校读者我要写书评

暂无评论

Multi-path algorithm for triangle strips

Multi-path algorithm for triangle strips

引用

computer graphics International

作者： P. Vanecek I. Kolingerova Centre of Computer Graphics and Data Visualization Department of Computer Science and Engineering University of West Bohemia Pilsen Czech Republic

Triangle surface models belong to the most popular type of geometric objects description in computer graphics. Therefore, the problem of fast visualization of this type of data is often solved. One of popular approaches is stripification, i.e., a conversion of triangle surface into strips of triangles. This enables to reduce the rendering time by reduction data size and by avoiding of redundant lighting and transformations computations. In this paper we present a new stripification algorithm for static fully triangulated meshes. Our new algorithm is based on the dual graph of triangulation. The experimental results show that our stripification produces much lower number of triangle strips than other stripification algorithms (except one)

关键词： Strips computer graphics data visualization Rendering (computer graphics) Costs computer science data engineering Solid modeling Application software computer aided manufacturing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：