Ka Yaw Teo

14 papers Journal 5Unranked 9

Year	Rank	Type	Title / Venue / Authors
2023	—	`conf`	Approximate Line Segment Nearest Neighbor Search amid Polyhedra in 3-Space. CCCG Ovidiu Daescu, Ka Yaw Teo
2022	—	`conf`	Fast Deterministic Approximation of Medoid in R CCCG Ovidiu Daescu, Ka Yaw Teo
2022	—	`conf`	The Median Line Segment Problem: Computational Complexity and Constrained Variants. CCCG Ovidiu Daescu, Ka Yaw Teo
2021	J	`jnl`	Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment. Comput. Geom. Ovidiu Daescu, Ka Yaw Teo
2021	—	`conf`	The Discrete Median and Center Line Segment Problems in the Plane. CCCG Ovidiu Daescu, Ka Yaw Teo
2020	—	`conf`	Characterization and Computation of Feasible Trajectories for an Articulated Probe with a Variable-Length End Segment. CCCG Ovidiu Daescu, Ka Yaw Teo
2020	J	`jnl`	Characterization and Computation of Feasible Trajectories for an Articulated Probe with a Variable-Length End Segment. CoRR Ovidiu Daescu, Ka Yaw Teo
2020	J	`jnl`	Computing Feasible Trajectories for an Articulated Probe in Three Dimensions. CoRR Ovidiu Daescu, Ka Yaw Teo
2020	J	`jnl`	Trajectory planning for an articulated probe. Comput. Geom. Ka Yaw Teo, Ovidiu Daescu, Kyle Fox
2020	J	`jnl`	Two-dimensional closest pair problem: A closer look. Discret. Appl. Math. Ovidiu Daescu, Ka Yaw Teo
2019	—	`conf`	Computing Feasible Trajectories for an Articulated Probe in Three Dimensions. CCCG Ovidiu Daescu, Ka Yaw Teo
2018	—	`conf`	Improved line facility location in weighted subdivisions. IWISC Ovidiu Daescu, Ka Yaw Teo
2018	—	`conf`	Trajectory Planning for an Articulated Probe. CCCG Ovidiu Daescu, Kyle Fox, Ka Yaw Teo
2017	—	`conf`	2D Closest Pair Problem: A Closer Look. CCCG Ovidiu Daescu, Ka Yaw Teo