Ka Yaw Teo

most citedComputing Feasible Trajectories for an Articulated Probe in Three Dimensions

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

cs.CG2022

Approximating the discrete and continuous median line segments in $d$ dimensions

Ovidiu Daescu, Ka Yaw Teo

Consider a set $P$ of $n$ points in $R^{d}$ . In the discrete median line segment problem, the objective is to find a line segment bounded by a pair of points in $P$ such tha…

cs.CG2020★ 1 cited

Computing Feasible Trajectories for an Articulated Probe in Three Dimensions

Ovidiu Daescu, Ka Yaw Teo

Consider an input consisting of a set of $n$ disjoint triangular obstacles in $R^{3}$ and a target point $t$ in the free space, all enclosed by a large sphere $S$ of radius…

cs.CG2020

Characterization and Computation of Feasible Trajectories for an Articulated Probe with a Variable-Length End Segment

Ovidiu Daescu, Ka Yaw Teo

An articulated probe is modeled in the plane as two line segments, $ab$ and $b c$ , joined at $b$ , with $ab$ being very long, and $b c$ of some small length $r$ . We investigate a traj…

Approximating the discrete and continuous median line segments in d dimensions

Computing Feasible Trajectories for an Articulated Probe in Three Dimensions

Characterization and Computation of Feasible Trajectories for an Articulated Probe with a Variable-Length End Segment

Approximating the discrete and continuous median line segments in $d$ dimensions