Geometric applications of posets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1272, Issue , 1997, Pages 402-415

  Segal, Michael ^a   Kedem, Klara ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; DATA STRUCTURES;

CONCENTRIC RINGS; GEOMETRIC APPLICATIONS; HIGHER DIMENSIONS; K POINTS; NEAREST NEIGHBORS;

SET THEORY;

EID: 33745845685     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63307-3_78     Document Type: Conference Paper

References (19)

1. M. Aigner "Combinatorical search", Wiley-Teubner Series in CS, John Wiley and Sons, 1988.
2. P.K. Agarwal, M. Sharir "Efficient randomized algorithms for some geometric optimization problems", In Proc. 11th Annu. ACM Symp. Computational Geometry, 1995.
3. J.L. Bentley "Decomposable searching problems", Info. Proc. Lett. 8, 244-251, 1979.
4. M. Blum, R. Floyd, V. Pratt, R. Rivest, R. Tarjan "Time bounds for selection", Journal of Computer and System Sciences, 7(4):448-461, 1973.
5. B.M. Chazelle, L.J. Guibas "Fractional cascading: I. A data structuring technique", Algorithmica, 1, 133-162, 1986.
6. M.T. Dickerson, R-L. Scot Drysdale, J-R. Sack "Simple algorithms for enumerating interpoint distances and finding k nearest neighbors", Internet. J. Comput. Geom. Appl., 2(3):221-239, 1992.
7. M.T. Dickerson, J. Shαgart "A simple algorithm for enumerating longest distances in the plane", Inform. Process. Lett. 45, 269-274, 1993.
8. M.T. Dickerson, D. Eppstein "Algorithms for proximity problems in higher dimensions", Computational Geometry: Theory and Applications 5, 277-291, 1996.
9. A. Efrat, M. Sharir, A. Ziv "Computing the smallest ⅛-enclosing circle and related problems", Computational Geometry 4, 119-136, 1994.
10. J. Erickson, D. Eppstein "Iterated nearest neighbors and finding minimal polytopes", Discrete Comput. Geom 11, 321-350, 1994.
11. R.Y. Flatland, C.H. Stewart "Extending range queries and nearest neighbors", In Proc. 7th Canad. Conf. Comput. Geom., 267-272, 1995.
12. G. Frederickson, D. Johnson, "Generalized selection and ranking: sorted matrices", SIAM J. Comput. 13, 14-30, 1984.
13. D.T. Lee, Y.T. Ching "The power of geometric duality revised", Inf. Proc. Lett. 21, 117-122, 1985.
14. V.B. Le, D.T. Lee "Out-of-roundness problem revisited", IEEE trans. Pattern Anal. Mach. Intell PAMI-13, 217-223, 1991.
15. J. Matoushek "On geometric optimization with few violated constraints", Discrete Comput. Geom., 14 (1995), 365-384.
16. H-P. Lenhof, M. Smid "Sequential and parallel algorithms for the k closest pairs problem", Intemat. J. Comput. Geom. Appl. 5, 273-288, 1995.
17. J. Salowe "Enumerating interdistances in space", Intemat. J. Comput. Geom. Appl. 2, 49-59, 1992.
18. M. Segal, K. Kedem "Enclosing k points in the smallest axis parallel rectangle", In Proc. 8th Canad. Conf. Comput. Geom., 20-25, 1996.
19. M. Smid, R. Janardan "On the width and roundness of a set of points in the plane", In Proc. 7th Canad. Conf. Comput. Geom., 193-198, 1995.