Build a constrained high quality 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> and for high-quality configurable triangulation see <https://github.com/hypertidy/anglr>. Also consider comparison with the 'GEOS' lib which since version 3.10.0 includes a low quality polygon triangulation method that starts with ear clipping and refines to Delaunay.
Version: 0.3.0 Depends: R (≥ 3.3.0) Imports: dplyr, methods, RTriangle, sf, sp, tibble Suggests: testthat, covr, knitr, maps, rmarkdown, viridisLite Published: 2024-01-09 DOI: 10.32614/CRAN.package.sfdct 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 Documentation: Downloads: Reverse dependencies: Linking:Please use the canonical form https://CRAN.R-project.org/package=sfdct to link to this page.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4