Dynamic data structures for fat objects and their applications

Alon Efrat, Matthew J. Katz, Franck Nielsen, Micha Sharir

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

15 Scopus citations


We present several efficient dynamic data structures for point-enclosure queries involving convex fat objects in ℝ2 or ℝ3. These structures are more efficient than alternative known structures because they exploit the fatness of the objects. We then apply these structures to obtain efficient solutions to three problems: (i) Finding a perfect matching between a set of points and a set of convex fat objects. (ii) Finding a piercing set for a collection of convex fat objects, whose size is within a constant factor off the optimum size. (iii) Constructing a data structure for answering bounded-length segment- shooting queries: Given a set of fat objects in the plane as above, and a query oriented segment (formula presented) whose length is relatively short, find the first object hit by (formula presented).

Original languageEnglish
Title of host publicationAlgorithms and Data Structures - 5th International Workshop, WADS 1997, Proceedings
EditorsFrank Dehne, Jorg-Rudiger Sack, Andrew Rau-Chaplin, Roberto Tamassia
PublisherSpringer Verlag
Number of pages10
ISBN (Print)3540633073, 9783540633075
StatePublished - 1 Jan 1997
Event5th International Workshop on Algorithms and Data Structures, WADS 1997 - Halifax, Canada
Duration: 6 Aug 19978 Aug 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference5th International Workshop on Algorithms and Data Structures, WADS 1997

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Dynamic data structures for fat objects and their applications'. Together they form a unique fingerprint.

Cite this