![]() Zhu, Geometric spanners for routing in mobile networks, IEEE J. 8bw ZZZZZZ 1053-8119 Neuroimage Crossref ISI Google Scholar Dale, Cortical surface‐based analysis II: Inflation, flattening, and a surface‐based coordinate system, Neuro Image, 9 ( 1999), pp. Thomas Erlebach , , Klaus Jansen and , Eike Seidel, Polynomial‐time approximation schemes for geometric graphs, SIAM, Philadelphia, PA, 2001, 671–679 1958541 Google Scholar Brent Clark , , Charles Colbourn and , David Johnson, Unit disk graphs, Discrete Math., 86 ( 1990), 165–177 91i:05105 Crossref ISI Google Scholar Tamassia, Dynamic algorithms in computational geometry, Proc. Kosaraju, A decomposition of multidimensional point sets withapplications to k‐nearest‐neighbors and n‐body potential fields, J. Kosaraju, Algorithms for dynamic closest pair and n‐body potential fields, ACM, New York, 1995, 263–272 96e:68125 Google Scholar , 34th Annual Symposium on Foundations of Computer Science, Proceedings of the symposium (FOCS ’93) held in Palo Alto, California, November 3–5, 1993, IEEE Computer Society Press, 1993, 0–0, xiii+745 95m:68008 Google Scholar ![]() Kosaraju, Faster algorithms for some geometric graph problems in higher dimensions, ACM, New York, 1993, 291–300 94a:05184 Google Scholar ![]() Heinz Breu and , David Kirkpatrick, Unit disk graph recognition is NP‐hard, Comput. Chew , , Gautam Das , , Michiel Smid and , Christos Zaroliagis, Planar spanners and approximate shortest path queries among obstacles in the plane, Lecture Notes in Comput. Motwani, Fast estimation of diameter and shortest paths (without matrix multiplication), ACM, New York, 1996, 547–553 1381960 Google Scholar Pankaj Agarwal , , Herbert Edelsbrunner , , Otfried Schwarzkopf and , Emo Welzl, Euclidean minimum spanning trees and bichromatic closest pairs, Discrete Comput. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |