N. Dadoun
- ACGOYl.Aggtuwal. A. Chazelle, B. Guibas. L., O'Dunlaing, C., and Yap, C., "Parallel Computational Geometry (extended abstract)", Proc. of the 26th E?Z Symposium on Foundations of Computer Science (1985), pp. 468-477.Google Scholar
- ACGOY2.Aggarwal. A., Chazelle, B., Guibas, L. O'Dunlaing, C., and Yap, C., "Parallel Computational Geometry ", To Appear in Algorithmica (1987).Google Scholar
- AG.Atallah. M.J. and Goodrich, M.T., "Efficient Plane Sweeping in Parallel (Preliminary Version)", Proc. of the 2nd ACM Symposium on Computational Geometry (1986). pp. 216-225. Google ScholarDigital Library
- CDH.Chrobak, M., Dii, K., and Hagerup, T., "Parallel S-Colouring of Planar Graphs", Preprint (1987).Google Scholar
- CV.Cole, R. and Vi&kin. U., "Deterministic Coin Tossing and Accelerating Cascades: Micro and Macro Techniques for Designing Parallel Algorithms". Proc. of the 18th ACM Symposium on Theory of Computing (1986). pp. 206-219. Google ScholarDigital Library
- DKl.Dobkin. D.P. and Kirkpatrick, D.G., "Fast Detection of Polyhedral Intersections", Proc. Internutiotuzl Colloquium on Automata, Languages and Programming (1982). pp. 154-165. Google ScholarDigital Library
- DK2.Dobkin, D.P. and Kirkpatrick, D.G., "Fast Detection of Polyhedral Intersection", Theoretical Computer Science 27 (1983). pp. 241-253.Google Scholar
- DK3.Dobkin. D.P. and Kirkpatrick, D.G., "A Linear Time Algorithm for Determining the Separation of Convex Polyhedra", Journal of Algorithms 6.3 (1985). JJJ. 381-392.Google ScholarCross Ref
- DK4.Dobkin, D.P. and Kirkpatrick, D.G., "Fast Algorithms for Preprocessed Polyhedral Intersection Detection", In Preparation.Google Scholar
- EKA.Edahiro, M., Kokubo. I. and Asano, T., "A New Point-Location Algorithm and Its Practical Efficiency - Comparison with Existing Algorithms", ACM Tranwcti ens on Graphics 3. 2 (1984). pp. 86-109. Google ScholarDigital Library
- KW.Karp. R.M. and Wigderson, A., "A Fast Parallel Algorithm for the Maximal Independent Set Problem", Proc. of the 16th ACM Symposium on Theory of Computing (1984). pp. 266-272. Google ScholarDigital Library
- K.Kirkpatrick, D.G., "Optimal Search In Planar Subdivisions" SIAM Journal of Computing 12,l (1983). pp. 28-35.Google ScholarCross Ref
- LM.Lipton, R.J., and Miller, R.E. "A Batching Method for Coloring Planar Graphs", Information Processing Letters 7,4 (1978). pp. 185-188.Google ScholarCross Ref
- L.Luby. M. "A Simple Parallel Algorithm for the Maximal Independent Set Problem", Proc. of the 17th ACM Symposium on Theory of Computing (1985). pp. l-10. Google ScholarDigital Library
- MR.Miller, G.L. and Reif, J.H., "Parallel Tree Contraction and Its Application", Proc. of the 26th IEEE Symposium on Foundations of Computer Science (1985). pp- 478-489.Google ScholarDigital Library
- PH.Preparata. F., and Hong, S. J., "Convex Hulls of Finite Sets of Points in Two and Three Dimensions", Communications of the ACM 20 (1978). pp. 87-93. Google ScholarDigital Library
- SH.Shamos. M. I. and Hoey. D., "Closest Point Problems" Proc. of the 16th IEEE Symposium on Foundations of Computer Science (1975), pp. 151-162.Google Scholar
Index Terms
- Parallel processing for efficient subdivision search
Recommendations
Efficient parallel processing for K-nearest-neighbor search in spatial databases
ICCSA'06: Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part VEven though the problem of k nearest neighbor (kNN) query is well-studied in serial environment, there is little prior work on parallel kNN search processing in parallel one. In this paper, we present the first Best-First based Parallel kNN (BFPkNN) ...
General triangular midpoint subdivision
Smoothness of general triangular midpoint surfaces for arbitrary control meshes. C 1 analysis tools for infinite classes of triangular subdivision schemes.New spectral properties of subdivision matrices.Smoothness analysis of Loop subdivision surfaces. ...
Efficient Parallel Processing for KNN Queries
ICIDE 2017: Proceedings of the 2017 International Conference on Industrial Design EngineeringThe most efficient algorithms so far for top-k query over sorted lists are the best position algorithms, BPA and BPA2 and they can be deduced to answering parallel k nearest neighbor (PkNN) of a given query point q. However, BPA and BPA2 may still incur ...
Comments