Ka Yaw Teo

According to our database1, Ka Yaw Teo authored at least 10 papers between 2017 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Approximate Line Segment Nearest Neighbor Search amid Polyhedra in 3-Space.
Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

2022
The Median Line Segment Problem: Computational Complexity and Constrained Variants.
Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

Fast Deterministic Approximation of Medoid in R<sup>d</sup>.
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.
Comput. Geom., 2021

The Discrete Median and Center Line Segment Problems in the Plane.
Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020
Two-dimensional closest pair problem: A closer look.
Discret. Appl. Math., 2020

Trajectory planning for an articulated probe.
Comput. Geom., 2020

2019
Computing Feasible Trajectories for an Articulated Probe in Three Dimensions.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018
Improved line facility location in weighted subdivisions.
Proceedings of the 3rd International Workshop on Interactive and Spatial Computing, 2018

2017
2D Closest Pair Problem: A Closer Look.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017


  Loading...