Skip Navigation

The Computer Journal 1997 40(1):22-29; doi:10.1093/comjnl/40.1.22
© 1997 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bozanis, P.
Right arrow Articles by Tsakalidis, A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

New Results on Intersection Query Problems

P. Bozanis, N. Kitsios, C. Makris1 and A. Tsakalidis2

1 Department of Computer Engineering and Informatics, University of Patras, 26500 Patras, 2 Computer Technology Institute, PO Box 1122, 26110 Patras, Greece, 3 Email: bozanis{at}ceid.upatras.gr

We present simple algorithms for three problems belonging to the class of intersection query problems. The first algorithm deals with the static rectangle enclosure problem and can easily be extended to d dimensions, the second algorithm copes with the generalized c-oriented polygon intersection searching problem in two dimensions, while the third solves the static 2-dimensional dominance searching problem with respect to a set of obstacles. All algorithms are simple, are based on persistence and improve previous bounds. Also, as a corollary of the first algorithm, we present a result for the static d-dimensional range searching problem.

Received September 17, 1996. revised June 25, 1997.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.