Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Fast segmentation of range images into planar regions by scan line grouping
Machine Vision and Applications
A new Voronoi-based surface reconstruction algorithm
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Hierarchical mesh decomposition using fuzzy clustering and cuts
ACM SIGGRAPH 2003 Papers
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Discriminative Learning of Markov Random Fields for Segmentation of 3D Scan Data
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
ACM SIGGRAPH 2006 Papers
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Randomized cuts for 3D mesh analysis
ACM SIGGRAPH Asia 2008 papers
On fusion of range and intensity information using Graph-Cut for planar patch segmentation
International Journal of Intelligent Systems Technologies and Applications
EuroMed'12 Proceedings of the 4th international conference on Progress in Cultural Heritage Preservation
| Hi-index | 0.00 |
The reconstruction of 3D objects from a point-cloud is based on sufficient separation of the points representing objects of interest from the points of other, unwanted objects. This operation called segmentation is discussed in this paper. We present an interactive unstructured point-cloud segmentation based on graph cut method where the cost function is derived from euclidean distance of point-cloud points. The graph topology and direct 3D point-cloud segmentation are the novel parts of our work. The segmentation is presented on real application, the terrain reconstruction of a complex miniature paper model, the Langweil model of Prague.