Chan, Timothy M.; Rahul, Saladi; Xue, Jie Range closest-pair search in higher dimensions. (English) Zbl 1474.68414 Comput. Geom. 91, Article ID 101669, 9 p. (2020). MSC: 68U05 68P05 PDFBibTeX XMLCite \textit{T. M. Chan} et al., Comput. Geom. 91, Article ID 101669, 9 p. (2020; Zbl 1474.68414) Full Text: DOI arXiv
Chan, Timothy M.; Skrepetos, Dimitrios Dynamic data structures for approximate Hausdorff distance in the word RAM. (English) Zbl 1381.65020 Comput. Geom. 60, 37-44 (2017). MSC: 65D18 PDFBibTeX XMLCite \textit{T. M. Chan} and \textit{D. Skrepetos}, Comput. Geom. 60, 37--44 (2017; Zbl 1381.65020) Full Text: DOI
Chan, Timothy M.; Rahmati, Zahed Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points. (English) Zbl 1381.65019 Comput. Geom. 60, 2-7 (2017). MSC: 65D18 PDFBibTeX XMLCite \textit{T. M. Chan} and \textit{Z. Rahmati}, Comput. Geom. 60, 2--7 (2017; Zbl 1381.65019) Full Text: DOI
Chan, Timothy M.; Hu, Nan Geometric red-blue set cover for unit squares and related problems. (English) Zbl 1314.65029 Comput. Geom. 48, No. 5, 380-385 (2015). MSC: 65D18 PDFBibTeX XMLCite \textit{T. M. Chan} and \textit{N. Hu}, Comput. Geom. 48, No. 5, 380--385 (2015; Zbl 1314.65029) Full Text: DOI
Chan, Timothy M.; Pathak, Vinayak Streaming and dynamic algorithms for minimum enclosing balls in high dimensions. (English) Zbl 1281.65029 Comput. Geom. 47, No. 2, Part B, 240-247 (2014). MSC: 65D18 PDFBibTeX XMLCite \textit{T. M. Chan} and \textit{V. Pathak}, Comput. Geom. 47, No. 2, Part B, 240--247 (2014; Zbl 1281.65029) Full Text: DOI
Kamousi, Pegah; Chan, Timothy M.; Suri, Subhash Closest pair and the post office problem for stochastic points. (English) Zbl 1315.65018 Comput. Geom. 47, No. 2, Part B, 214-223 (2014). Reviewer: Krzystof Gdawiec (Sosnowiec) MSC: 65D18 68W25 PDFBibTeX XMLCite \textit{P. Kamousi} et al., Comput. Geom. 47, No. 2, Part B, 214--223 (2014; Zbl 1315.65018) Full Text: DOI
Chan, Timothy M.; Grant, Elyot Exact algorithms and APX-hardness results for geometric packing and covering problems. (English) Zbl 1283.52032 Comput. Geom. 47, No. 2, Part A, 112-124 (2014). MSC: 52C45 90C39 PDFBibTeX XMLCite \textit{T. M. Chan} and \textit{E. Grant}, Comput. Geom. 47, No. 2, Part A, 112--124 (2014; Zbl 1283.52032) Full Text: DOI
Chan, Timothy M.; Chen, Eric Y. Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection. (English) Zbl 1254.65033 Comput. Geom. 43, No. 8, 636-646 (2010). MSC: 65D18 68U05 PDFBibTeX XMLCite \textit{T. M. Chan} and \textit{E. Y. Chen}, Comput. Geom. 43, No. 8, 636--646 (2010; Zbl 1254.65033) Full Text: DOI
Chan, Timothy M. A (slightly) faster algorithm for Klee’s measure problem. (English) Zbl 1180.65022 Comput. Geom. 43, No. 3, 243-250 (2010). Reviewer: Ivana Linkeová (Praha) MSC: 65D18 65D17 PDFBibTeX XMLCite \textit{T. M. Chan}, Comput. Geom. 43, No. 3, 243--250 (2010; Zbl 1180.65022) Full Text: DOI
Abbott, Timothy G.; Burr, Michael A.; Chan, Timothy M.; Demaine, Erik D.; Demaine, Martin L.; Hugg, John; Kane, Daniel; Langerman, Stefan; Nelson, Jelani; Rafalin, Eynat; Seyboth, Kathryn; Yeung, Vincent Dynamic ham-sandwich cuts in the plane. (English) Zbl 1181.65029 Comput. Geom. 42, No. 5, 419-428 (2009). Reviewer: Jason Hanson (Redmond) MSC: 65D18 52B55 PDFBibTeX XMLCite \textit{T. G. Abbott} et al., Comput. Geom. 42, No. 5, 419--428 (2009; Zbl 1181.65029) Full Text: DOI Link
Chan, Timothy M. Three problems about simple polygons. (English) Zbl 1102.65021 Comput. Geom. 35, No. 3, 209-217 (2006). MSC: 65D18 PDFBibTeX XMLCite \textit{T. M. Chan}, Comput. Geom. 35, No. 3, 209--217 (2006; Zbl 1102.65021) Full Text: DOI
Chan, Timothy M. Faster core-set constructions and data-stream algorithms in fixed dimensions. (English) Zbl 1103.65064 Comput. Geom. 35, No. 1-2, 20-35 (2006). Reviewer: Efstratios Rappos (Athens) MSC: 65K05 90C59 PDFBibTeX XMLCite \textit{T. M. Chan}, Comput. Geom. 35, No. 1--2, 20--35 (2006; Zbl 1103.65064) Full Text: DOI
Brönnimann, Hervé; Chan, Timothy M. Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time. (English) Zbl 1089.65014 Comput. Geom. 34, No. 2, 75-82 (2006). MSC: 65D18 52B55 PDFBibTeX XMLCite \textit{H. Brönnimann} and \textit{T. M. Chan}, Comput. Geom. 34, No. 2, 75--82 (2006; Zbl 1089.65014) Full Text: DOI
Chan, Timothy M.; Goodrich, Michael T.; Kosaraju, S. Rao; Tamassia, Roberto Optimizing area and aspect ratio in straight-line orthogonal tree drawings. (English) Zbl 1008.05038 Comput. Geom. 23, No. 2, 153-162 (2002). MSC: 05C10 05C85 68U05 05C05 PDFBibTeX XMLCite \textit{T. M. Chan} et al., Comput. Geom. 23, No. 2, 153--162 (2002; Zbl 1008.05038) Full Text: DOI
Chan, Timothy M. Reporting curve segment intersections using restricted predicates. (English) Zbl 0957.68090 Comput. Geom. 16, No. 4, 245-256 (2000). MSC: 68R10 68W05 PDFBibTeX XMLCite \textit{T. M. Chan}, Comput. Geom. 16, No. 4, 245--256 (2000; Zbl 0957.68090) Full Text: DOI
Chan, Timothy M. More planar two-center algorithms. (English) Zbl 0948.68196 Comput. Geom. 13, No. 3, 189-198 (1999). MSC: 68U05 68W05 PDFBibTeX XMLCite \textit{T. M. Chan}, Comput. Geom. 13, No. 3, 189--198 (1999; Zbl 0948.68196) Full Text: DOI