{"title":"Point Set Processing for VTK - Outlier Removal, Curvature Estimation, Normal Estimation, Normal Orientation","authors":"D. Doria","doi":"10.54294/vesrzn","DOIUrl":"https://doi.org/10.54294/vesrzn","url":null,"abstract":"This document presents a set of classes (vtkPointSetOutlierRemoval, vtkPointSetNormalEstimation, vtkPointSetNormalOrientation, vtkPointSetCurvatureEstimation, vtkEuclideanMinimumSpanningTree, and vtkRiemannianGraphFilter) to enable several basic operations on point sets. These classes are implemented as VTK filters. Paraview plugin interfaces to the filters are also provided to allow extremely easy experimentation with the new functionality. We propose these classes as an addition to the Visualization Toolkit.The latest source code can be found here: https://github.com/daviddoria/PointSetProcessing","PeriodicalId":251524,"journal":{"name":"The VTK Journal","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122690082","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":"Clustering Segmentation for VTK","authors":"D. Doria","doi":"10.54294/7r5vlb","DOIUrl":"https://doi.org/10.54294/7r5vlb","url":null,"abstract":"This document presents a VTK implementation of the algorithm described in “A clustering method for efficient segmentation of 3D laser data” by Klasing, Klaas Wollherr, Dirk, and Buss, Martin. The algorithm .The code is available here: https://github.com/daviddoria/ClusteringSegmentation","PeriodicalId":251524,"journal":{"name":"The VTK Journal","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121938336","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 Conditional Mesh Front Iterator for VTK","authors":"D. Doria","doi":"10.54294/ot40r3","DOIUrl":"https://doi.org/10.54294/ot40r3","url":null,"abstract":"Region growing is a technique that can be used to propagate information over a mesh. In a previous submission, “A Mesh Front Iterator for VTK”, we introduced an iterator that can be used with vtkPointSet subclasses to traverse a mesh. It is sometimes useful to visit only vertices that are “similar” to their neighbors by some definition. This concept can be used to select many types of common regions, including planar regions or regions with similar color, to name a few. In this paper, we propose an iterator which propagates on a mesh using a condition test which can be easily modified.The latest code is available here: https://github.com/daviddoria/MeshConditionalFrontIterator","PeriodicalId":251524,"journal":{"name":"The VTK Journal","volume":"2647 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124763690","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":"Smart Nearest Neighbors","authors":"D. Doria, Wanlin Zhu","doi":"10.54294/7djpdw","DOIUrl":"https://doi.org/10.54294/7djpdw","url":null,"abstract":"This document presents an implementation of two algorithms, Voronoi Neighbors and Binary Space Partition (BSP) Neighbors. These algorithms find neighbors of a point in a point set that are somehow better'' than aK nearest neighbors’’ or a ``all neighbors within a radius’’ query. This type of nearest neighbor query is more computationally expensive, but results in set of neighbors with more desirable properties. The BSP Neighbors search ensures that there is less local duplication, while the Voronoi Neighbors search ensures that the spatial arrangement of the neighbors is as uniform as possible.These algorithms are explained in ``Point Primitives for Interactive Modeling and Processing of 3D Geometry’’.The code is available here: https://github.com/daviddoria/SmartNearestNeighbors","PeriodicalId":251524,"journal":{"name":"The VTK Journal","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129093970","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":"Boolean Operations on Surfaces in VTK Without External Libraries","authors":"Cory W. Quammen, C. Weigle, R. M. Taylor II","doi":"10.54294/216g01","DOIUrl":"https://doi.org/10.54294/216g01","url":null,"abstract":"We have written a set of classes than enable computation of boolean operations on surface meshes using only VTK classes. In addition to being compatible with the VTK license, our contribution preserves surface mesh topology to the extent possible in boolean operations and passes point data and cell data through to the output mesh where possible.","PeriodicalId":251524,"journal":{"name":"The VTK Journal","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132360227","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":"Uniform B-Splines for the VTK Imaging Pipeline","authors":"D. Gobbi, Y. Starreveld","doi":"10.54294/9rdcf2","DOIUrl":"https://doi.org/10.54294/9rdcf2","url":null,"abstract":"Uniform B-splines are used widely in image processing because they provide maximal smoothness compared to any other piecewise polynomial of the same degree and support. This paper describes VTK classes for performing two functions: image interpolation via B-splines, and non-rigid coordinate transformation via B-splines. Special attention is paid to different boundary conditions for the ends of the spline: image interpolation supports clamped, mirrored, and repeated boundary conditions while B- spline grid transformations support clamped and zero-past-boundary conditions. The use of these classes for image deformation is demonstrated.","PeriodicalId":251524,"journal":{"name":"The VTK Journal","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133014864","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":"Grid voxelization with partial volume effects in VTK","authors":"Cory W. Quammen, R. M. Taylor II","doi":"10.54294/1bfwts","DOIUrl":"https://doi.org/10.54294/1bfwts","url":null,"abstract":"We present a filter that voxelizes the volume of a 3D structured, unstructured, or rectilinear grid into a vtkImageData with partial volume effects. The partial grid volume occupying each voxel is computed exactly from the intersection of the grid volume and the voxel volume.","PeriodicalId":251524,"journal":{"name":"The VTK Journal","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130187470","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":"Explicit Deformable Model in VTK","authors":"J. Velut","doi":"10.54294/4zc3pv","DOIUrl":"https://doi.org/10.54294/4zc3pv","url":null,"abstract":"This document describes a set of classes that designs a generic explicit deformable model in VTK. The iterative mechanism is first introduced through an inheritance of the vtkPolyDataAlgorithm class. This vtkIterativePolyDataAlgorithm is then a base for an implementation of the deformation. Two examples of deformation are presented through an inheritance of this base class. The provided source code may be used to build a ParaView plugin that harnesses the animation feature.","PeriodicalId":251524,"journal":{"name":"The VTK Journal","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117349759","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":"Entropy Image Filter","authors":"R. Tamburo","doi":"10.54294/gazv60","DOIUrl":"https://doi.org/10.54294/gazv60","url":null,"abstract":"This paper describes an intensity image filter for computing the entropy of pixel values contained within a neighborhood centered at each input pixel. The output image contains the calculated entropy for each input pixel location. This paper is accompanied with source code for the filter and test, test images and parameters, and expected output images.","PeriodicalId":251524,"journal":{"name":"The VTK Journal","volume":"5 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125256062","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":"Point Set Surface Reconstruction for VTK","authors":"D. Doria","doi":"10.54294/mbk9ms","DOIUrl":"https://doi.org/10.54294/mbk9ms","url":null,"abstract":"This document presents a set of classes (vtkPointSetSurfaceReconstruction, vtkVoxelizePolyData) to produce a surface from an oriented point set. These classes are implemented as VTK filters. A Paraview plugin interface is provided to allow extremely easy experimentation with the new functionality. We propose these classes as an addition to the Visualization Toolkit. The code is available here: https://github.com/daviddoria/PointSetSurfaceReconstruction","PeriodicalId":251524,"journal":{"name":"The VTK Journal","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123905773","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}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
