Ka Yaw Teo

Publication Activity (10 Years)

Years Active: 2017-2023
Publications (10 Years): 15

Top Topics

Nearest Neighbor

Hough Transform

Text Compression

Digital Pictures

Top Venues

Discret. Appl. Math.

Publications

Ovidiu Daescu, Ka Yaw Teo
Approximate Line Segment Nearest Neighbor Search amid Polyhedra in 3-Space. CCCG (2023)
Ovidiu Daescu, Ka Yaw Teo
. CCCG (2022)
Ovidiu Daescu, Ka Yaw Teo
Approximating the discrete and continuous median line segments in d dimensions. CoRR (2022)
Ovidiu Daescu, Ka Yaw Teo
The Median Line Segment Problem: Computational Complexity and Constrained Variants. CCCG (2022)
Ovidiu Daescu, Ka Yaw Teo
The Discrete Median and Center Line Segment Problems in the Plane. CCCG (2021)
Ovidiu Daescu, Ka Yaw Teo
Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment. Comput. Geom. 96 (2021)
Ovidiu Daescu, Ka Yaw Teo
Computing Feasible Trajectories for an Articulated Probe in Three Dimensions. CoRR (2020)
Ka Yaw Teo, Ovidiu Daescu, Kyle Fox
Trajectory planning for an articulated probe. Comput. Geom. 90 (2020)
Ovidiu Daescu, Ka Yaw Teo
Characterization and Computation of Feasible Trajectories for an Articulated Probe with a Variable-Length End Segment. CoRR (2020)
Ovidiu Daescu, Ka Yaw Teo
Two-dimensional closest pair problem: A closer look. Discret. Appl. Math. 287 (2020)
Ovidiu Daescu, Ka Yaw Teo
Characterization and Computation of Feasible Trajectories for an Articulated Probe with a Variable-Length End Segment. CCCG (2020)
Ovidiu Daescu, Ka Yaw Teo
Computing Feasible Trajectories for an Articulated Probe in Three Dimensions. CCCG (2019)
Ovidiu Daescu, Ka Yaw Teo
Improved line facility location in weighted subdivisions. IWISC (2018)
Ovidiu Daescu, Kyle Fox, Ka Yaw Teo
Trajectory Planning for an Articulated Probe. CCCG (2018)
Ovidiu Daescu, Ka Yaw Teo
2D Closest Pair Problem: A Closer Look. CCCG (2017)