Ka Yaw Teo

According to our database, Ka Yaw Teo authored at least 9 papers between 2017 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2022

The Median Line Segment Problem: Computational Complexity and Constrained Variants.

Ovidiu Daescu, Ka Yaw Teo

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

Fast Deterministic Approximation of Medoid in R^d.

Ovidiu Daescu, Ka Yaw Teo

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2021

Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment.

Ovidiu Daescu, Ka Yaw Teo

Comput. Geom., 2021

The Discrete Median and Center Line Segment Problems in the Plane.

Ovidiu Daescu, Ka Yaw Teo

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020

Two-dimensional closest pair problem: A closer look.

Ovidiu Daescu, Ka Yaw Teo

Discret. Appl. Math., 2020

Trajectory planning for an articulated probe.

Ka Yaw Teo, Ovidiu Daescu, Kyle Fox

Comput. Geom., 2020

2019

Computing Feasible Trajectories for an Articulated Probe in Three Dimensions.

Ovidiu Daescu, Ka Yaw Teo

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018

Improved line facility location in weighted subdivisions.

Ovidiu Daescu, Ka Yaw Teo

Proceedings of the 3rd International Workshop on Interactive and Spatial Computing, 2018

2017

2D Closest Pair Problem: A Closer Look.

Ovidiu Daescu, Ka Yaw Teo

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017