Timothy Moon-Yew Chan

19952019
If you made any changes in Pure, your changes will be visible here soon.

Fingerprint Fingerprint is based on mining the text of the expert's scholarly documents to create an index of weighted terms, which defines the key subjects of each individual researcher.

  • 2 Similar Profiles
Data structures Engineering & Materials Science
Computational geometry Engineering & Materials Science
Query Mathematics
Approximation algorithms Engineering & Materials Science
Random access storage Engineering & Materials Science
Data Structures Mathematics
Linear programming Engineering & Materials Science
Convex Hull Mathematics

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 1995 2019

All-pairs shortest paths in geometric intersection graphs

Chan, T. M-Y. & Skrepetos, D., Jan 1 2019, In : Journal of Computational Geometry. 10, 1, p. 27-41 15 p.

Research output: Contribution to journalArticle

Geometric Graphs
Intersection Graphs
Shortest path
Line segment
Shortest Path Problem

Approximate shortest paths and distance oracles in weighted unit-disk graphs

Chan, T. M-Y. & Skrepetos, D., Jan 1 2019, In : Journal of Computational Geometry. 10, 2, p. 3-20 18 p.

Research output: Contribution to journalArticle

Unit Disk Graph
Weighted Graph
Shortest path
Preprocessing
Data structures

Computing shapley values in the plane

Cabello, S. & Chan, T. M-Y., Jun 1 2019, 35th International Symposium on Computational Geometry, SoCG 2019. Barequet, G. & Wang, Y. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 20. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 129).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Computational geometry

Dynamic geometric data structures via shallow cuttings

Chan, T. M-Y., Jun 1 2019, 35th International Symposium on Computational Geometry, SoCG 2019. Barequet, G. & Wang, Y. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 24. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 129).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Data structures

Faster Approximate Diameter and Distance Oracles in Planar Graphs

Chan, T. M-Y. & Skrepetos, D., Aug 1 2019, In : Algorithmica. 81, 8, p. 3075-3098 24 p.

Research output: Contribution to journalArticle

Planar graph
Voronoi Diagram
Approximation
Recursion
Undirected Graph