A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Turning unorganized points into contours
Proceedings the Eighth Pacific Conference on Computer Graphics and Applications
Preserved Fulltext
We present a Voxelcoding algorithm which assembles unorganized points into contours in a straightforward and efficient way. ...
There are a variety of research applications that require reconstruction of objects from unorganized points. ...
We present a Voxel-coding algorithm which turns unorganized points into contours accurately and efficiently. ...
doi:10.1109/pccga.2000.883947
pmid:19759833
pmcid:PMC2744089
dblp:conf/pg/ZhouT00
fatcat:3v4rbepherbfngmwx5xrikpx6m
On evaluating methods for recovering image curve fragments
2012
2012 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
edges are grouped into contour segments. ...
Curve fragments, as opposed to unorganized edge elements, are of interest and use in a large number of applications such as multiview reconstructions, tracking, motionbased segmentation, and object recognition ...
The pairing of each of these contour fragments is in turn found in the first set, adding c2 to the group, and then c5 is added in another iteration. ...
doi:10.1109/cvprw.2012.6238927
dblp:conf/cvpr/GuoK12
fatcat:z7txnve6rbfkpb6shknzzdpkpu
Page 365 of Review of Educational Research Vol. 2, Issue 5
[page]
1932
Review of Educational Research
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
This in turn was ...
The California State Department of Education (94: 20) developed a 500 point score card subdivided into fourteen major divisions. ...
Page 365 of Review of Educational Research Vol. 2, Issue 5
[page]
1932
Review of Educational Research
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
This in turn was
365 ...
The California State Department of Education (94: 20) developed a 500 point score card subdivided into fourteen major divisions. ...
A SURVEY ON METHODS FOR RECONSTRUCTING SURFACES FROM UNORGANIZED POINT SETS / PAVIRŠIŲ REKONSTRUKCIJOS IŠ NESTRUKTŪRIZUOTŲ TAŠKŲ RINKINIŲ METODŲ APŽVALGA
2011
Mokslas: Lietuvos Ateitis
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper addresses the issue of reconstructing and visualizing surfaces from unorganized point sets. ...
The problem of reconstructing surfaces from their unorganized point sets is common for many diverse areas, including computer graphics, computer vision, computational geometry or reverse engineering. ...
In turn, this calls for some connectivity structure to associate with the point set. There are several algorithms for producing a 3D mesh from unorganized point sets. ...
doi:10.3846/mla.2011.002
fatcat:z3t4esaf75avpi7fw5t6tmnlia
From laser-scanned data to feature human model: a system based on fuzzy logic concept
2003
Computer-Aided Design
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
In our approach, the feature human model is constructed by unorganized cloud points obtained from 3D laser scanners. ...
This paper describes an approach of constructing feature human models from unorganized cloud points according to the feature templates using fuzzy logic. ...
Fig. 9 shows the turning points of a horizontal cutting plane. If the angle on one point is "sharp", the point is a turning point. ...
doi:10.1016/s0010-4485(01)00209-3
fatcat:mwf2jsfei5btzn3bmspzwchsfe
Surface reconstruction from unorganized points
1992
Computer graphics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We describe and demonstrate an algorithm that takes as input an unorganized set of points fx1; : : : ; x n g IR 3 on or near an unknown manifold M, and produces as output a simplicial surface that approximates ...
This problem naturally arises in a variety of practical situations such as range scanning an object from multiple view points, recovery of biological shapes from two-dimensional slices, and interactive ...
For instance, the mesh of Figure 3a was randomly sampled to yield 1000 unorganized points, and these in turn were used to reconstruct the surface in Figure 3c . ...
doi:10.1145/142920.134011
fatcat:gvpduekmubgdhmak2ef4clfdme
Surface reconstruction from unorganized points
1992
Proceedings of the 19th annual conference on Computer graphics and interactive techniques - SIGGRAPH '92
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We describe and demonstrate an algorithm that takes as input an unorganized set of points fx1; : : : ; x n g IR 3 on or near an unknown manifold M, and produces as output a simplicial surface that approximates ...
This problem naturally arises in a variety of practical situations such as range scanning an object from multiple view points, recovery of biological shapes from two-dimensional slices, and interactive ...
For instance, the mesh of Figure 3a was randomly sampled to yield 1000 unorganized points, and these in turn were used to reconstruct the surface in Figure 3c . ...
doi:10.1145/133994.134011
fatcat:dl7dfrfqlfd6fc3ijpvtmv7rje
Parameterization and parametric design of mannequins
2005
Computer-Aided Design
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
The entire human body is subdivided into a certain number of feature patches interpolating the given cloud points. ...
In this paper, we begin the parameterization with the unorganized cloud points of human bodies obtained from 3D laser scanners. ...
Therefore, we cut the cloud
points there and find the 4 turning points on the contours. ...
doi:10.1016/j.cad.2004.05.001
fatcat:u2ug2drvcbegtgjuimelo3xiya
Alternative Optical Acquisition Technique for Supporting Reverse Engineering Process
2017
International Journal of Materials Mechanics and Manufacturing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
rotary table started to turn while the laser spot was detecting the object's surface from the bottommost contour. ...
Acquiring Process In 3D laser scanner application, it provides the unorganized point cloud data representing product's shape ( Fig. 4(a) ). ...
doi:10.18178/ijmmm.2017.5.4.335
fatcat:vpsxida2orc2fnioggy5otro4y
Shape from Phase: An Integrated Level Set and Probability Density Shape Representation
2014
2014 22nd International Conference on Pattern Recognition
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
To answer this question, we turn to the estimation of density functions next. Density functions estimated from unorganized point-sets come in both parametric and non-parametric flavors. ...
The function ψ at present is unnormalized but can be turned into a square-root density (a probability amplitude) via normalization (ψ → ψ ψ 2 ) which can then be used to compute shape descriptors dependent ...
doi:10.1109/icpr.2014.18
dblp:conf/icpr/CorringR14
fatcat:i4ojchgxungknhhcld75anntbe
Reconstruction Of Surface For Image Processing
2016
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this method, sample points are first aggregated on a volumetric grid. ...
A labeling algorithm that relies on intrinsic properties of the smooth scalar field which emerging after the aggregation, is used to classify grid points as exterior or interior to the surface. ...
By tracing the zero iso-contour a smooth scalar field emerges and the implicit surface is turned into a triangulated one. ...
doi:10.5281/zenodo.50962
fatcat:ilccqqigirarrkavd5iqv5mobu
Contour-based surface reconstruction using MPU implicit models
2007
Graphical Models
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The technique interprets the pixels that make up the contours as points in R 3 and employs Multi-level Partition of Unity (MPU) implicit models to create a surface that approximately fits to the 3D points ...
Since MPU implicit models additionally require surface normal information at each point, an algorithm that estimates normals from the contour data is also described. ...
We also survey techniques for creating surfaces from sets of unorganized points. ...
doi:10.1016/j.gmod.2006.09.007
pmid:18496609
pmcid:PMC2390921
fatcat:ijssoacwyvec7n533vtniqn5qa
Contour Detection in Unstructured 3D Point Clouds
2016
2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Contours are important intermediate features for structuring point clouds and converting them into high-quality surface or solid models, and are extensively used in graphics and mapping applications. ...
Yet, detecting them in unstructured, inhomogeneous point clouds turns out to be surprisingly difficult, and existing line detection algorithms largely fail. ...
A possible approach is to first turn the point cloud into a triangle mesh with all-purpose methods like Poisson reconstruction [15] , and then analyze the mesh to find contours. ...
doi:10.1109/cvpr.2016.178
dblp:conf/cvpr/HackelWS16
fatcat:dyzf6p2y4vgm5hxmf7ro6pgt34
Implicit meshes for surface reconstruction
2006
IEEE Transactions on Pattern Analysis and Machine Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
It relies on a technique that can turn a completely arbitrary triangulated mesh, such as one taken from the web, into an implicit surface that closely approximates it and can deform in tandem with it. ...
We achieve this by attaching a volumetric primitive to each facet of the explicit mesh to turn it into an implicit mesh as shown in Fig. 1 . ...
Here, by simply turning them into implicit meshes and retaining the same parameterization, we can further refine them using silhouette information. ...
doi:10.1109/tpami.2006.37
pmid:16468628
fatcat:fuijqakwvzcu7fadtejycr7rcy
« Previous
Showing results 1 — 15 out of 1,837 results