Efficient Computation of Shortest Path-Concavity for 3D Meshes
H. Zimmer, M. Campen, L. Kobbelt, in: 2013 IEEE Conference on Computer Vision and Pattern Recognition, IEEE, 2013.
Download
No fulltext has been uploaded.
Conference Paper
| Published
| English
Author
Zimmer, Henrik;
Campen, MarcelLibreCat 
;
Kobbelt, Leif
;
Kobbelt, LeifDepartment
Publishing Year
Proceedings Title
2013 IEEE Conference on Computer Vision and Pattern Recognition
LibreCat-ID
Cite this
Zimmer H, Campen M, Kobbelt L. Efficient Computation of Shortest Path-Concavity for 3D Meshes. In: 2013 IEEE Conference on Computer Vision and Pattern Recognition. IEEE; 2013. doi:10.1109/cvpr.2013.280
Zimmer, H., Campen, M., & Kobbelt, L. (2013). Efficient Computation of Shortest Path-Concavity for 3D Meshes. 2013 IEEE Conference on Computer Vision and Pattern Recognition. https://doi.org/10.1109/cvpr.2013.280
@inproceedings{Zimmer_Campen_Kobbelt_2013, title={Efficient Computation of Shortest Path-Concavity for 3D Meshes}, DOI={10.1109/cvpr.2013.280}, booktitle={2013 IEEE Conference on Computer Vision and Pattern Recognition}, publisher={IEEE}, author={Zimmer, Henrik and Campen, Marcel and Kobbelt, Leif}, year={2013} }
Zimmer, Henrik, Marcel Campen, and Leif Kobbelt. “Efficient Computation of Shortest Path-Concavity for 3D Meshes.” In 2013 IEEE Conference on Computer Vision and Pattern Recognition. IEEE, 2013. https://doi.org/10.1109/cvpr.2013.280.
H. Zimmer, M. Campen, and L. Kobbelt, “Efficient Computation of Shortest Path-Concavity for 3D Meshes,” 2013, doi: 10.1109/cvpr.2013.280.
Zimmer, Henrik, et al. “Efficient Computation of Shortest Path-Concavity for 3D Meshes.” 2013 IEEE Conference on Computer Vision and Pattern Recognition, IEEE, 2013, doi:10.1109/cvpr.2013.280.
Google Scholar