Journal Article
@Article
Artikel in Fachzeitschrift


Show entries of:

this year (2018) | last year (2017) | two years ago (2016) | Notes URL

Action:

login to update

Options:








Author, Editor(s)

Author(s):

Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel

dblp
dblp
dblp



BibTeX cite key*:

GuptaJanardanSmid96a-2

Title

Title*:

Algorithms for generalized halfspace range searching and other intersection searching problems

Journal

Journal Title*:

Computational Geometry

Journal's URL:


Download URL
for the article:


Language:

English

Publisher

Publisher's
Name:

Elsevier

Publisher's URL:


Publisher's
Address:

Amsterdam, The Netherlands

ISSN:

0925-7721

Vol, No, pp, Date

Volume*:

6

Number:

1

Publishing Date:

1996

Pages*:

1-19

Number of
VG Pages:


Page Start:


Page End:


Sequence Number:


DOI:


Note, Abstract, ©

Note:


(LaTeX) Abstract:

In a generalized intersection searching problem, a set S of colored geometric objects is to be preprocessed so that, given a query object q, the distinct colors of the objects of S that are intersected by q can be reported or counted efficiently. These problems generalize the well-studied standard intersection searching problems and have many applications. Unfortunately, the solutions known for the standard problems do not yield efficient solutions to the generalized problems. Recently, efficient solutions have been given for generalized problems where the input and query objects are iso-oriented (i.e., axes-parallel) or where the color classes satisfy additional properties (e.g., connectedness). In this paper, efficient algorithms are given for several generalized problems involving objects that are not necessarily iso-oriented. These problems include: generalized halfspace range searching in Image, for any fixed d ≥ 2, and segment intersection searching, triangle stabbing, and triangle range searching in Imagefor certain classes of line segments and triangles. The techniques used include: computing suitable sparse representations of the input, persistent data structures, and filtering search.

URL for the Abstract:


Categories,
Keywords:


HyperLinks / References / URLs:

http://dx.doi.org/10.1016/0925-7721(95)00012-7 

Copyright Message:


Personal Comments:


Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Audience:

Expert

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat


BibTeX Entry:

@ARTICLE{GuptaJanardanSmid96a-2,
AUTHOR = {Gupta, Prosenjit and Janardan, Ravi and Smid, Michiel},
TITLE = {Algorithms for generalized halfspace range searching and other intersection searching problems},
JOURNAL = {Computational Geometry},
PUBLISHER = {Elsevier},
YEAR = {1996},
NUMBER = {1},
VOLUME = {6},
PAGES = {1--19},
ADDRESS = {Amsterdam, The Netherlands},
ISBN = {0925-7721},
}


Entry last modified by Uwe Brahm, 03/02/2010
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Uwe Brahm
Created
12/14/2004 03:51:32 PM
Revisions
7.
6.
5.
4.
3.
Editor(s)
Uwe Brahm
Christine Kiesel
Christine Kiesel
Christine Kiesel
Christine Kiesel
Edit Dates
02/14/2005 08:12:56 PM
14.12.2004 15:53:43
14.12.2004 15:32:04
14.12.2004 15:15:58
14.12.2004 15:09:21
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section