Abstract: A minimally invasive dilation device includes a plurality of rigid arms radially arrayed about a center and a dilating member positioned between the arms. A stylus may occupy the center. An outer flexible sleeve may be circumferentially secured to the arms, lying within or without the plurality of arms. An inner mesh may surround the stylus and dilating member. The device may be introduced into tissue toward a targeted area, while in a closed configuration. The dilating member may be a balloon, wherein upon inflation of the balloon, the arms are pushed radially outward, expanding the device and dilating the surrounding tissue. The dilating member may be a tube, wherein upon insertion of the tube, the arms are pushed radially outward. A cannula may be inserted inside the plurality of arms to keep the arms in an open configuration, and the dilating member may be withdrawn, providing an open passageway through the device to the targeted area. The device may be used with a neural monitoring system.

Abstract: This disclosure generally discloses a bidirectional constrained path search mechanism. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes, subject to one or more constraints, such that the bidirectional paths share a common set of resources. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes, subject to one or more constraints, by determining a forward path that satisfies a set of forward path constraints associated with the forward path and determining a reverse path that satisfies a set of reverse path constraints associated with the reverse path. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes in a single path search iteration, such as via a traversal of a weighted directed graph, thereby improving performance.

Abstract: This disclosure generally discloses a bidirectional constrained path search mechanism. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes, subject to one or more constraints, such that the bidirectional paths share a common set of resources. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes, subject to one or more constraints, by determining a forward path that satisfies a set of forward path constraints associated with the forward path and determining a reverse path that satisfies a set of reverse path constraints associated with the reverse path. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes in a single path search iteration, such as via a traversal of a weighted directed graph, thereby improving performance.