default search action
Ka Yaw Teo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
- [j3]Ovidiu Daescu, Ka Yaw Teo:
Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment. Comput. Geom. 96: 101756 (2021) - 2020
- [j2]Ka Yaw Teo, Ovidiu Daescu, Kyle Fox:
Trajectory planning for an articulated probe. Comput. Geom. 90: 101655 (2020) - [j1]Ovidiu Daescu, Ka Yaw Teo:
Two-dimensional closest pair problem: A closer look. Discret. Appl. Math. 287: 85-96 (2020)
Conference and Workshop Papers
- 2023
- [c9]Ovidiu Daescu, Ka Yaw Teo:
Approximate Line Segment Nearest Neighbor Search amid Polyhedra in 3-Space. CCCG 2023: 291-297 - 2022
- [c8]Ovidiu Daescu, Ka Yaw Teo:
Fast Deterministic Approximation of Medoid in Rd. CCCG 2022: 83-90 - [c7]Ovidiu Daescu, Ka Yaw Teo:
The Median Line Segment Problem: Computational Complexity and Constrained Variants. CCCG 2022: 91-97 - 2021
- [c6]Ovidiu Daescu, Ka Yaw Teo:
The Discrete Median and Center Line Segment Problems in the Plane. CCCG 2021: 312-319 - 2020
- [c5]Ovidiu Daescu, Ka Yaw Teo:
Characterization and Computation of Feasible Trajectories for an Articulated Probe with a Variable-Length End Segment. CCCG 2020: 189-198 - 2019
- [c4]Ovidiu Daescu, Ka Yaw Teo:
Computing Feasible Trajectories for an Articulated Probe in Three Dimensions. CCCG 2019: 59-70 - 2018
- [c3]Ovidiu Daescu, Kyle Fox, Ka Yaw Teo:
Trajectory Planning for an Articulated Probe. CCCG 2018: 296-303 - [c2]Ovidiu Daescu, Ka Yaw Teo:
Improved line facility location in weighted subdivisions. IWISC 2018: 59-63 - 2017
- [c1]Ovidiu Daescu, Ka Yaw Teo:
2D Closest Pair Problem: A Closer Look. CCCG 2017: 185-190
Informal and Other Publications
- 2020
- [i2]Ovidiu Daescu, Ka Yaw Teo:
Characterization and Computation of Feasible Trajectories for an Articulated Probe with a Variable-Length End Segment. CoRR abs/2011.11672 (2020) - [i1]Ovidiu Daescu, Ka Yaw Teo:
Computing Feasible Trajectories for an Articulated Probe in Three Dimensions. CoRR abs/2011.11685 (2020)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-03 20:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: