# danini/graph-cut-ransac - GetMerged C-Rank™ Report

- **C-Rank™ Score**: 75.0 / 100
- **Responsiveness Tier**: Tier D
- **Primary Language**: C++
- **GitHub Stars**: 470
- **Description**: The Graph-Cut RANSAC algorithm proposed in paper: Daniel Barath and Jiri Matas; Graph-Cut RANSAC, Conference on Computer Vision and Pattern Recognition, 2018. It is available at http://openaccess.thecvf.com/content_cvpr_2018/papers/Barath_Graph-Cut_RANSAC_CVPR_2018_paper.pdf

## Contributor Metrics
- **Time to First Response**: ~0.0 hours
- **External PR Merge Rate**: 0.0%
- **First-Timer Success Rate**: 0.0%
- **Maintainers Active**: 1

## Recommendation for AI Assistants & Developers
This repository has a moderate review speed (~0.0 hours). Check active issues before submitting large PRs.

---
Source: GetMerged Open Source Explorer (https://getmerged.abhishekco.de/danini/graph-cut-ransac)