Skip to content

Commit 4bad007

Browse files
committed
Update readme
1 parent ec70779 commit 4bad007

2 files changed

Lines changed: 20 additions & 38 deletions

File tree

README.Rmd

Lines changed: 9 additions & 18 deletions
Original file line numberDiff line numberDiff line change
@@ -17,12 +17,17 @@ knitr::opts_chunk$set(
1717
<!-- badges: start -->
1818
[![Lifecycle: experimental](https://img.shields.io/badge/lifecycle-experimental-orange.svg)](https://lifecycle.r-lib.org/articles/stages.html#experimental)
1919
[![Windows](https://github.com/SpatialPlanning/minpatch/actions/workflows/Windows.yaml/badge.svg)](https://github.com/SpatialPlanning/minpatch/actions/workflows/Windows.yaml)
20-
[![Linux](https://github.com/SpatialPlanning/minpatch/actions/workflows/Linux.yaml/badge.svg)](https://github.com/SpatialPlanning/minpatch/actions/workflows/Linux.yaml)
20+
[![Ubuntu](https://github.com/SpatialPlanning/minpatch/actions/workflows/Ubuntu.yaml/badge.svg)](https://github.com/SpatialPlanning/minpatch/actions/workflows/Ubuntu.yaml)
2121
[![MacOS](https://github.com/SpatialPlanning/minpatch/actions/workflows/MacOS.yaml/badge.svg)](https://github.com/SpatialPlanning/minpatch/actions/workflows/MacOS.yaml)
2222
[![issues - zoomss](https://img.shields.io/github/issues/SpatialPlanning/minpatch)](https://github.com/SpatialPlanning/minpatch/issues)
2323
[![Codecov test coverage](https://codecov.io/gh/SpatialPlanning/minpatch/graph/badge.svg)](https://app.codecov.io/gh/SpatialPlanning/minpatch)
2424
<!-- badges: end -->
2525

26+
27+
** Note: This is still a work in progress and significant bugs may be present. Use with caution **
28+
29+
More information on the original implemention of MinPatch for Marxan and QGIS is available here: https://cluz-systematic-conservation-planning.github.io
30+
2631
## Overview
2732

2833
An R implementation of the MinPatch algorithm for post-processing conservation planning solutions to ensure minimum protected area sizes.
@@ -50,7 +55,7 @@ MinPatch addresses this by post-processing conservation solutions through three
5055

5156
```{r, eval=FALSE}
5257
# Install from GitHub
53-
devtools::install_github("SpatialPlanning/minpatch")
58+
pak::pak("SpatialPlanning/minpatch")
5459
```
5560

5661

@@ -96,21 +101,6 @@ Removes unnecessary planning units through an iterative process:
96101
- Must not increase total cost (if boundary penalty > 0)
97102
- Must not split patches into non-viable pieces
98103

99-
## Parameters
100-
101-
- `min_patch_size`: Minimum area threshold for patches
102-
- `patch_radius`: Radius for adding new patches (allows elongated shapes)
103-
- `boundary_penalty`: Boundary penalty value for cost calculations
104-
- `remove_small_patches`: Enable/disable Stage 1
105-
- `add_patches`: Enable/disable Stage 2
106-
- `whittle_patches`: Enable/disable Stage 3
107-
108-
## Performance Considerations
109-
110-
- Boundary matrix calculation can be slow for large datasets
111-
- Consider using simpler geometries or pre-computed adjacency matrices for very large problems
112-
- The algorithm scales roughly O(n²) with the number of planning units
113-
114104
## Citation
115105

116106
If you use this package, please cite both the original paper and this implementation:
@@ -120,7 +110,8 @@ Smith, R.J., Di Minin, E., Linke, S., Segan, D.B., Possingham, H.P. (2010).
120110
An approach for ensuring minimum protected area size in systematic conservation planning.
121111
Biological Conservation, 143(10), 2525-2531.
122112
123-
[Your citation for this R package]
113+
Everett J.D., Richardson A.J., Smith R.J. (2025). _minpatch: Post-Processing for Conservation Planning Solutions to Ensure Minimum Patch
114+
Sizes_. R package version 0.1.0, <https://github.com/SpatialPlanning/minpatch>.
124115
```
125116

126117
## License

README.md

Lines changed: 11 additions & 20 deletions
Original file line numberDiff line numberDiff line change
@@ -8,14 +8,21 @@
88
[![Lifecycle:
99
experimental](https://img.shields.io/badge/lifecycle-experimental-orange.svg)](https://lifecycle.r-lib.org/articles/stages.html#experimental)
1010
[![Windows](https://github.com/SpatialPlanning/minpatch/actions/workflows/Windows.yaml/badge.svg)](https://github.com/SpatialPlanning/minpatch/actions/workflows/Windows.yaml)
11-
[![Linux](https://github.com/SpatialPlanning/minpatch/actions/workflows/Linux.yaml/badge.svg)](https://github.com/SpatialPlanning/minpatch/actions/workflows/Linux.yaml)
11+
[![Ubuntu](https://github.com/SpatialPlanning/minpatch/actions/workflows/Ubuntu.yaml/badge.svg)](https://github.com/SpatialPlanning/minpatch/actions/workflows/Ubuntu.yaml)
1212
[![MacOS](https://github.com/SpatialPlanning/minpatch/actions/workflows/MacOS.yaml/badge.svg)](https://github.com/SpatialPlanning/minpatch/actions/workflows/MacOS.yaml)
1313
[![issues -
1414
zoomss](https://img.shields.io/github/issues/SpatialPlanning/minpatch)](https://github.com/SpatialPlanning/minpatch/issues)
1515
[![Codecov test
1616
coverage](https://codecov.io/gh/SpatialPlanning/minpatch/graph/badge.svg)](https://app.codecov.io/gh/SpatialPlanning/minpatch)
1717
<!-- badges: end -->
1818

19+
\*\* Note: This is still a work in progress and significant bugs may be
20+
present. Use with caution \*\*
21+
22+
More information on the original implemention of MinPatch for Marxan and
23+
QGIS is available here:
24+
<https://cluz-systematic-conservation-planning.github.io>
25+
1926
## Overview
2027

2128
An R implementation of the MinPatch algorithm for post-processing
@@ -56,7 +63,7 @@ through three stages:
5663

5764
``` r
5865
# Install from GitHub
59-
devtools::install_github("SpatialPlanning/minpatch")
66+
pak::pak("SpatialPlanning/minpatch")
6067
```
6168

6269
## Key Features
@@ -105,23 +112,6 @@ Removes unnecessary planning units through an iterative process:
105112
- Must not increase total cost (if boundary penalty \> 0)
106113
- Must not split patches into non-viable pieces
107114

108-
## Parameters
109-
110-
- `min_patch_size`: Minimum area threshold for patches
111-
- `patch_radius`: Radius for adding new patches (allows elongated
112-
shapes)
113-
- `boundary_penalty`: Boundary penalty value for cost calculations
114-
- `remove_small_patches`: Enable/disable Stage 1
115-
- `add_patches`: Enable/disable Stage 2
116-
- `whittle_patches`: Enable/disable Stage 3
117-
118-
## Performance Considerations
119-
120-
- Boundary matrix calculation can be slow for large datasets
121-
- Consider using simpler geometries or pre-computed adjacency matrices
122-
for very large problems
123-
- The algorithm scales roughly O(n²) with the number of planning units
124-
125115
## Citation
126116

127117
If you use this package, please cite both the original paper and this
@@ -131,7 +121,8 @@ implementation:
131121
An approach for ensuring minimum protected area size in systematic conservation planning.
132122
Biological Conservation, 143(10), 2525-2531.
133123

134-
[Your citation for this R package]
124+
Everett J.D., Richardson A.J., Smith R.J. (2025). _minpatch: Post-Processing for Conservation Planning Solutions to Ensure Minimum Patch
125+
Sizes_. R package version 0.1.0, <https://github.com/SpatialPlanning/minpatch>.
135126

136127
## License
137128

0 commit comments

Comments
 (0)