Julien Basch
- AMS92.Pankaj K. Agarwal, J. Matou#ek, and S. Suri. Faxthest neighbors, maximum spanning trees and related problems in higher dimensions. Comput. Geom. TheorV Appl., 1(4):189-201, 1992. Google Scholar
Digital Library
- AS89.C. Aragon and R. Seidel. Randomized search trees. In Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci., pages 540-545, 1989.Google ScholarDigital Library
- BDIZ.J. Basch, H. Devarajan, P. Indyk, and L. Zhang. Probabilistic analysis for combinatorial functions of moving points. This volume.Google Scholar
- BGH97.J. Ba.sch, L.J. Guibas, and J. Hershberger. Data structures for mobile data. In Proc. 8th A CM-SIA M Sympos. Discrete Algorithms, page to appear, 1997. Google ScholarDigital Library
- BS80.J.L. Bentley and j. B. Saxe. Decomposable searching problems I: Static-to-dynamic transformation. J. Algorithms, 1:301-358, 1980.Google ScholarCross Ref
- GGST86.H. N. Gabow, Z. Galil, T. Spencer, and R. E. Tarjan. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica, 6:109-122, 1986. Google ScholarDigital Library
- KGS.Dong-Jin Kim, Leonidas J. Guibas, and Sung-Yong Shin. Fast collision detection among multiple moving spheres. This volume. Google ScholarDigital Library
- KKT95.D. Karger, P. N. Klein, and R. E. Tarjan. A randomized linear-time algorithm to find minimum spanning trees. J. A CM, 42:321-328, 1995. Google ScholarDigital Library
- KTI95.N. Katoh, T. Tokuyama, and K. Iwano. On minimum and maximum spanning trees of linearly moving points. Discrete Comput. Geom., 13:161-176, 1995.Google ScholarDigital Library
- Meh84.K. Mehlhorn. Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry, volume 3 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, West Germany, 1984. Google ScholarDigital Library
- Mul94.K. Mulmuley. Computat{onal Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs, NJ, 1994.Google Scholar
- Ove83.M.H. Overmars. The Design o} Dynamic Data Struetu#t, volume 156 of Lecture Notes in Computer Science. Springer-Verlag, Heidelberg, West Germany, 1983. Google ScholarDigital Library
- Smi92.M. Smid. Maintaining the minimal distance of a point set in polylogarithmic time. Discrete Comput. Geom., 7:415--431, 1992.Google ScholarDigital Library
- ST83.D.D. Sleator and R. E. Tarjan. A data structure for dynamic trees. J. Comput. Syst. Sci., 26(3):362-381, 1983. Google ScholarDigital Library
- Vai84.P.M. Vaidya. A fast approximation for minimum spanning trees in k-dimensional space. In Proc. #Sth Annu. IEEE Sympos. Found. Comput. Sci., pages 403-407, 1984.Google ScholarDigital Library
- WL85.D.E. Willard and G. S. Lueker. Adding range restriction capability to dynamic data structures. J. A CM, 32:597--617, 1985. Google ScholarDigital Library
- Yao82.A.C. Y#o. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput., 11:721-736, 1982.Google ScholarCross Ref
Index Terms
- Proximity problems on moving points
Recommendations
Common best proximity points: global minimization of multi-objective functions
Given non-empty subsets A and B of a metric space, let $${S{:}A{\longrightarrow} B}$$ and $${T {:}A{\longrightarrow} B}$$ be non-self mappings. Due to the fact that S and T are non-self mappings, the equations Sx = x and Tx = x are likely to have no common solution, known as a common fixed point ...
Semantic proximity search on heterogeneous graph by proximity embedding
AAAI'17: Proceedings of the Thirty-First AAAI Conference on Artificial IntelligenceMany real-world networks have a rich collection of objects. The semantics of these objects allows us to capture different classes of proximities, thus enabling an important task of semantic proximity search. As the core of semantic proximity search, we ...
Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects
ESA '94: Proceedings of the Second Annual European Symposium on Algorithms
Comments