Abstract | ||
---|---|---|
We present a novel algorithm based on least-squares minimization to approximate point cloud data in 2D plane with a smooth B-spline curve. The point cloud data may represent an open curve with self intersection and sharp corner. Unlike other existing ... |
Year | DOI | Venue |
---|---|---|
2005 | 10.1109/SMI.2005.25 | SMI |
Keywords | Field | DocType |
smooth b-spline curve,sharp corner,least-squares minimization,open curve,point cloud data,novel algorithm,self intersection,hierarchical spatial caching,approximate point cloud data,interactive implicit modeling,assembly,visualization,computational geometry,lazy evaluation,computer animation,tree data structures,acceleration,feedback,surface reconstruction,data visualisation,interactive visualization,shape,computer science | Voxel,Data visualization,Visualization,Computer science,Computational geometry,Lazy evaluation,Tree (data structure),Theoretical computer science,Computer animation,Grid | Conference |
ISBN | Citations | PageRank |
0-7695-2379-X | 16 | 0.69 |
References | Authors | |
16 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ryan Schmidt | 1 | 567 | 26.74 |
Brian Wyvill | 2 | 1130 | 278.50 |
Eric Galin | 3 | 599 | 39.12 |