Build a constrained Delaunay triangulation from simple features objects, applying constraints based on input line segments, and triangle properties including maximum area, minimum internal angle. The triangulation code in 'RTriangle' uses the method of Cheng, Dey and Shewchuk (2012, ISBN:9781584887300). For a low-dependency alternative with low-quality path-based constrained triangulation see <https://CRAN.R-project.org/package=decido>.
| Version: | 0.0.6 |
| Depends: | R (≥ 3.3.0) |
| Imports: | dplyr, methods, RTriangle, sf, sp, tibble |
| Suggests: | testthat, covr, knitr, maps, rmarkdown, viridisLite |
| Published: | 2018-03-23 |
| Author: | Michael D. Sumner [aut, cre] |
| Maintainer: | Michael D. Sumner <mdsumner at gmail.com> |
| BugReports: | https://github.com/hypertidy/sfdct/issues |
| License: | CC BY-NC-SA 4.0 |
| URL: | https://github.com/hypertidy/sfdct |
| NeedsCompilation: | no |
| Materials: | README NEWS |
| CRAN checks: | sfdct results |
| Reference manual: | sfdct.pdf |
| Vignettes: |
constrained-triangulation-simple-features |
| Package source: | sfdct_0.0.6.tar.gz |
| Windows binaries: | r-devel: sfdct_0.0.6.zip, r-release: sfdct_0.0.6.zip, r-oldrel: sfdct_0.0.6.zip |
| macOS binaries: | r-release: sfdct_0.0.6.tgz, r-oldrel: sfdct_0.0.6.tgz |
| Old sources: | sfdct archive |
Please use the canonical form https://CRAN.R-project.org/package=sfdct to link to this page.