Back to my home page.

Dynamic Data Structures for Fat Objects and Their Applications

Alon Efrat, Matthew J. Katz, Frank Nielsen and Micha Sharir

Abstract:
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more general class of objects - (β,δ)-covered objects - which are not necessarily convex, see definition below. These structures are more efficient than alternative known structures, because they exploit the fatness of objects. We then apply these structures to obtain efficient solutions to two problems: Key words: fat objects, dynamic data structure, point enclosure, containment matching, piercing set.
Get the paper here.
 
The original publication is available at Elsevier Science.
 
Ask the PDF paper here (284 Kb size, 16 pages, 3 figures) © Elsevier Science.
 
doi: 10.1016/S0925-7721(99)00059-0
Bibtex entry:

@Article{ekns-ddsfo:2000
	, author =	"Alon Efrat and Mstthew J. Katz and Frank Nielsen and Micha Sharir"
	, title =	"Dynamic Data Structures for Fat Objects and Their Applications"
	, journal =	"Comput. Geom. Theory Appl."
	, volume =	15
	, number =	4
	, year =	2000
	, pages =	"215-227"
	, doi = {10.1016/S0925-7721(99)00059-0}
 }


@InProceedings{ekns-ddsfo:1997
	, author =	"Alon Efrat and Matthew J. Katz and Frank Nielsen and Micha Sharir"
	, title =	"Dynamic Data Structures for Fat Objects and Their Applications"
	, booktitle =	"Proc. 5th Workshop Algorithms Data Struct."
	, year =	1997
	, pages =	"297--306"
}


Related publications:

© Copyright notice.
Last updated, 2003.