Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(1)
Data Structure
Related Publications
(56)
Kinetic Data Structures  A State of the Art Report
Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points
Kinetic Medians and kdTrees
Maintaining the Extent of a Moving Point Set
Kinetic Connectivity for Unit Disks
Subscribe
Academic
Publications
Data structures for mobile data
Data structures for mobile data,10.1145/314161.314435,Julien Basch,Leonidas J. Guibas,John Hershberger
Edit
Data structures for mobile data
(
Citations: 226
)
BibTex

RIS

RefWorks
Download
Julien Basch
,
Leonidas J. Guibas
,
John Hershberger
Conference:
ACMSIAM Symposium on Discrete Algorithms  SODA
, pp. 747756, 1997
DOI:
10.1145/314161.314435
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
portal.acm.org
)
(
www.informatik.unitrier.de
)
(
portal.acm.org
)
Citation Context
(145)
...Dynamic graph algorithms [6,7] and kinetic algorithms [8,9,
10
] incorporate nonstationary candidate ranking by making use of structures such as topology trees [6] and dynamic trees [11]...
Viswanath Gunturi
,
et al.
Minimum Spanning Tree on SpatioTemporal Networks
...We focus on the handling of kinetic data through the model of kinetic data structures (KDSs) proposed by Basch, Guibas, and Hershberger [
5
]...
...Standard problems which have been tackled include finding the convex hull [
5
], Voronoi diagram [2], and minimum spanning tree on geometric graphs [6]...
Sorelle A. Friedler
,
et al.
Approximation algorithm for the kinetic robust Kcenter problem
...Basch, Guibas, and Hershberger [
6
] give data structures for maintaining convex hulls and closest pairs for mobile geographic data...
David Eppstein
,
et al.
PrivacyPreserving DataOblivious Geometric Algorithms for Geographic ...
...Each node has its own mobility plan, which is composed of direction vectors, velocity, acceleration, and so on. Basch et al. [2], [
3
] proposed an elegant method to handle topology updates for mobile nodes...
Shlomi Dolev
,
et al.
Boundedhop strong connectivity for flocking swarms
...The concept of smoothed motion complexity is closely related to the concept of kinetic data structures (KDS), which was introduced by Basch et al. [
3
]...
...Interesting kinetic data structures have been developed, for instance for connectivity of discs [10] and rectangles [12], convex hulls [
3
], proximity problems [4], and collision detection for simple polygons [14]...
...Basch et al. [
3
] developed a KDS to maintain a bounding box of a moving point set in Rd. The number of updates...
...Therefore, researchers investigate data structures that can be eciently maintained under continuous motion, e.g., to answer proximity queries [4], maintain a clustering [11], a convex hull [
3
], or some connectivity information of the moving point set [12]...
...In particular, in the framework of kinetic data structures [
3
] many interesting results on data structures for moving objects have been obtained...
Valentina Damerowy
,
et al.
Smoothed analysis of lefttoright maxima with applications
References
(23)
Algorithms for dynamic closest pair and n body potential fields
(
Citations: 39
)
Paul B. Callahan
,
S. Rao Kosaraju
Conference:
ACMSIAM Symposium on Discrete Algorithms  SODA
, pp. 263272, 1995
Maintenance of Configurations in the Plane
(
Citations: 265
)
Mark H. Overmars
,
Jan Van Leeuwen
Journal:
Journal of Computer and System Sciences  JCSS
, vol. 23, no. 2, pp. 166204, 1981
An Optimal Algorithm for ClosestPair Maintenance
(
Citations: 41
)
Sergei Bespamyatnikh
Journal:
Discrete & Computational Geometry  DCG
, vol. 19, no. 2, pp. 175195, 1998
Incremental collision detection for polygonal models
(
Citations: 2
)
Madhav K. Ponamgi
,
Ming C. Lin
,
Dinesh Manocha
Conference:
Symposium on Computational Geometry  SOCG
, pp. 445446, 1995
Voronoi Diagrams over Dynamic Scenes
(
Citations: 37
)
Thomas Roos
Journal:
Discrete Applied Mathematics  DAM
, vol. 43, no. 3, pp. 243259, 1993
Sort by:
Citations
(226)
Minimum Spanning Tree on SpatioTemporal Networks
(
Citations: 2
)
Viswanath Gunturi
,
Shashi Shekhar
,
Arnab Bhattacharya
Journal:
Computing Research Repository  CORR
, vol. abs/1003.1, pp. 149158, 2010
Approximation algorithm for the kinetic robust Kcenter problem
(
Citations: 1
)
Sorelle A. Friedler
,
David M. Mount
Journal:
Computational Geometry: Theory and Applications  COMGEO
, vol. 43, no. 67, pp. 572586, 2010
PrivacyPreserving DataOblivious Geometric Algorithms for Geographic Data
David Eppstein
,
Michael T. Goodrich
,
Roberto Tamassia
Journal:
Computing Research Repository  CORR
, vol. abs/1009.1, pp. 1322, 2010
Boundedhop strong connectivity for flocking swarms
Shlomi Dolev
,
Michael Segal
,
Hanan Shpungin
Conference:
Modeling and Optimization in Mobile, AdHoc and Wireless Networks  WIOPT
, pp. 177185, 2010
Visibility of a Moving Segment
Mojtaba Nouri Bygi
,
Mohammad Ghodsi
Published in 2010.