Computing Exact Discrete Minimal Surfaces: Extending and Solving the Shortest Path Problem in 3D with Application to Segmentation

Cite

Text

Grady. "Computing Exact Discrete Minimal Surfaces: Extending and Solving the Shortest Path Problem in 3D with Application to Segmentation." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2006. doi:10.1109/CVPR.2006.82

Markdown

[Grady. "Computing Exact Discrete Minimal Surfaces: Extending and Solving the Shortest Path Problem in 3D with Application to Segmentation." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2006.](https://mlanthology.org/cvpr/2006/grady2006cvpr-computing/) doi:10.1109/CVPR.2006.82

BibTeX

@inproceedings{grady2006cvpr-computing,
  title     = {{Computing Exact Discrete Minimal Surfaces: Extending and Solving the Shortest Path Problem in 3D with Application to Segmentation}},
  author    = {Grady, Leo J.},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2006},
  pages     = {69-78},
  doi       = {10.1109/CVPR.2006.82},
  url       = {https://mlanthology.org/cvpr/2006/grady2006cvpr-computing/}
}