remove.intersections: Remove intersections between adjacent segments in a closed...
In retistruct: Retinal Reconstruction Program
Description
Usage
Arguments
Value
Author(s)
Description
Suppose segments AB and CD intersect. Point B is replaced by the
intersection point, defined B'. Point C is replaced by a point C'
on the line B'D. The maximum distance of B'C' is given by the
parameter d. If the distance l B'D is less than 2d, the distance
B'C' is l/2.
Usage
1
remove.intersections(P, d = 50)
Arguments
P
The points, as a 2-column matrix
d
Criterion for maximum distance when points are inserted
Value
A new closed path without intersections
Author(s)
David Sterratt
retistruct documentation built on April 4, 2020, 5:08 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Value Author(s)
Description
Suppose segments AB and CD intersect. Point B is replaced by the intersection point, defined B'. Point C is replaced by a point C' on the line B'D. The maximum distance of B'C' is given by the parameter d. If the distance l B'D is less than 2d, the distance B'C' is l/2.
Usage
1 | remove.intersections(P, d = 50)
|
Arguments
P |
The points, as a 2-column matrix |
d |
Criterion for maximum distance when points are inserted |
Value
A new closed path without intersections
Author(s)
David Sterratt
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.