feasible_point: Find Feasible Point in Ellipse Overlap

In fellov: Feasible Ellipse Overlap

Description

feasible_point will find a point in the interior of the intersection of two or more fully specified ellipses. If the intersections is empty NA is returned.

Usage

feasible_point(ell, ...)

Arguments

ell	a list of at least two (non degenerate) ellipses; see wrangle_ellipse.
...	additional arguments to be passed to internal functions.

Details

feasible_point will find a point in the interior of the intersection of two or more fully specified ellipses ell. If the intersections is empty NA is returned.

Value

feasible_point returns an object of class "feasible_point" with the following entries

x	An interior point.
distance	A data.frame with the ellipse specific distances.
optim	The final internal optimization value.
call	The matched call.

See Also

wrangle_ellipse for detailed on ellipse parameterization.

Examples

# two dimensional ellipses
e1 <- list("c" = c(1,2), "P" = matrix(c(2,0,0,1), ncol = 2), "r" = 3)
e2 <- list("c" = c(0,0), "S" = matrix(c(1, 0.2, 0.2, 2), ncol = 2), "r" = 1)

# find point in intersection
feasible_point(list(e1, e2))

# make new ellipse
e3 <- list("c" = c(2,2), "P" = matrix(c(1,0,0,1), ncol = 2), "r" = 0.5)

# now there is no overlap
feasible_point(list(e1, e2, e3))

fellov documentation built on Feb. 21, 2020, 5:07 p.m.