Results 1  10
of
92
Discrete Mobile Centers
 Discrete and Computational Geometry
, 2001
"... We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a variable subset of the nodes as cluster centers. This subset has the property that (1) balls of the given radius centered a ..."
Abstract

Cited by 96 (15 self)
 Add to MetaCart
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a variable subset of the nodes as cluster centers. This subset has the property that (1) balls of the given radius centered at the chosen nodes cover all the others and (2) the number of centers selected is a constantfactor approximation of the minimum possible. As the nodes move, an eventbased kinetic data structure updates the clustering as necessary. This kinetic data structure is shown to be responsive, efficient, local, and compact. The produced cover is also smooth, in the sense that wholesale cluster rearrangements are avoided. The algorithm can be implemented without exact knowledge of the node positions, if each node is able to sense its distance to other nodes up to the cluster radius. Such a kinetic clustering can be used in numerous applications where mobile devices must be interconnected into an adhoc network to collaboratively perform some tasks. 1
Deformable free space tilings for kinetic collision detection
 International Journal of Robotics Research
, 2000
"... We present kinetic data structures for detecting collisions between a set of polygons that are not only moving continuously but whose shapes can also change continuously with time. We construct a planar subdivision of the common exterior of the polygons, called a pseudotriangulation, that certifies ..."
Abstract

Cited by 76 (13 self)
 Add to MetaCart
We present kinetic data structures for detecting collisions between a set of polygons that are not only moving continuously but whose shapes can also change continuously with time. We construct a planar subdivision of the common exterior of the polygons, called a pseudotriangulation, that certifies their disjointness. We show different schemes for maintaining pseudotriangulations as a kinetic data structure, and we analyze their performance. Specifically, we first describe an algorithm for maintaining a pseudotriangulation of a point set, and show that the pseudotriangulation changes only quadratically many times if points move along algebraic arcs of constant degree. We then describe an algorithm for maintaining a pseudotriangulation of a set of convex polygons. Finally, we extend our algorithm to maintaining a pseudotriangulation of a set of simple polygons.
Range Searching
, 1996
"... Range searching is one of the central problems in computational geometry, because it arises in many applications and a wide variety of geometric problems can be formulated as a rangesearching problem. A typical rangesearching problem has the following form. Let S be a set of n points in R d , an ..."
Abstract

Cited by 70 (1 self)
 Add to MetaCart
Range searching is one of the central problems in computational geometry, because it arises in many applications and a wide variety of geometric problems can be formulated as a rangesearching problem. A typical rangesearching problem has the following form. Let S be a set of n points in R d , and let R be a family of subsets; elements of R are called ranges . We wish to preprocess S into a data structure so that for a query range R, the points in S " R can be reported or counted efficiently. Typical examples of ranges include rectangles, halfspaces, simplices, and balls. If we are only interested in answering a single query, it can be done in linear time, using linear space, by simply checking for each point p 2 S whether p lies in the query range.
A distributed algorithm for managing multitarget identities in wireless adhoc sensor networks
 In IPSN ’03: Information Processing in Sensor Networks
, 2003
"... Abstract. This paper presents a scalable distributed algorithm for computing and maintaining multitarget identity information. The algorithm builds on a novel representational framework, IdentityMass Flow, to overcome the problem of exponential computational complexity in managing multitarget ide ..."
Abstract

Cited by 58 (11 self)
 Add to MetaCart
Abstract. This paper presents a scalable distributed algorithm for computing and maintaining multitarget identity information. The algorithm builds on a novel representational framework, IdentityMass Flow, to overcome the problem of exponential computational complexity in managing multitarget identity explicitly. The algorithm uses local information to efficiently update the global multitarget identity information represented as a doubly stochastic matrix, and can be efficiently mapped to nodes in a wireless ad hoc sensor network. The paper describes a distributed implementation of the algorithm in sensor networks. Simulation results have validated the IdentityMass Flow framework and demonstrated the feasibility of the algorithm. 1
Motion planning: A journey of robots, molecules, digital actors, and other artifacts
 International Journal of Robotics Research
, 1999
"... During the last three decades motion planning has emerged as a crucial and productive research area in robotics. In the mid80's the most advanced planners were barely able to compute collisionfree paths for objects crawling in planar workspaces. Today, planners e ciently deal with robots with ..."
Abstract

Cited by 58 (3 self)
 Add to MetaCart
During the last three decades motion planning has emerged as a crucial and productive research area in robotics. In the mid80's the most advanced planners were barely able to compute collisionfree paths for objects crawling in planar workspaces. Today, planners e ciently deal with robots with many degrees of freedom in complex environments. Techniques also exist to generate quasioptimal trajectories, coordinate multiple robots, deal with dynamic and kinematic constraints, and handle dynamic environments. This paper describes some of these achievements, presents new problems that have recently emerged, discusses applications likely to motivate future research, and nally gives expectations for the coming years. It stresses the fact that nonrobotics applications (e.g., graphic animation, surgical planning, computational biology) are growing in importance and are likely to shape future motion planning research more than robotics itself. 1
Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions
 In Proc. 14th Annu. ACM Sympos. Comput. Geom
, 1998
"... The straight skeleton of a polygon is a variant of the medial axis, introduced by Aichholzer et al., defined by a shrinking process in which each edge of the polygon moves inward at a fixed rate. We construct the straight skeleton of an ngon with r reflex vertices in time O(n 1+" +n 8=11+& ..."
Abstract

Cited by 46 (1 self)
 Add to MetaCart
The straight skeleton of a polygon is a variant of the medial axis, introduced by Aichholzer et al., defined by a shrinking process in which each edge of the polygon moves inward at a fixed rate. We construct the straight skeleton of an ngon with r reflex vertices in time O(n 1+" +n 8=11+" r 9=11+" ), for any fixed " ? 0, improving the previous best upper bound of O(nr log n). Our algorithm simulates the sequence of collisions between edges and vertices during the shrinking process, using a technique of Eppstein for maintaining extrema of binary functions to reduce the problem of finding successive interactions to two dynamic range query problems: (1) maintain a changing set of triangles in IR 3 and answer queries asking which triangle would be first hit by a query ray, and (2) maintain a changing set of rays in IR 3 and answer queries asking for the lowest intersection of any ray with a query triangle. We also exploit a novel characterization of the straight skeleton as a ...
Collision detection for deforming necklaces
 IN SYMP. ON COMPUTATIONAL GEOMETRY
, 2002
"... In this paper, we propose to study deformable necklaces — flexible chains of balls, called beads, in which only adjacent balls may intersect. Such objects can be used to model macromolecules, muscles, rope, and other ‘linear ’ objects in the physical world. In this paper, we exploit this linearity ..."
Abstract

Cited by 36 (11 self)
 Add to MetaCart
In this paper, we propose to study deformable necklaces — flexible chains of balls, called beads, in which only adjacent balls may intersect. Such objects can be used to model macromolecules, muscles, rope, and other ‘linear ’ objects in the physical world. In this paper, we exploit this linearity to develop geometric structures associated with necklaces that are useful in physical simulations. We show how these structures can be implemented efficiently and maintained under necklace deformation. In particular, we study a bounding volume hierarchy based on spheres built on a necklace. Such a hierarchy is easy to compute and is suitable for maintenance when the necklace deforms, as our theoretical and experimental results show. This hierarchy can be used for collision and selfcollision detection. In particular, we achieve an upper bound of O(nlog n) in two dimensions and O(n 2−2/d) in ddimensions, d ≥ 3, for collision checking. To our knowledge, this is the first subquadratic bound proved for a collision detection algorithm using predefined hierarchies. In addition, we show that the power diagram, with the help of some additional mechanisms, can be also used to detect selfcollisions of a necklace in certain ways complementary to the sphere hierarchy.
Deformable spanners and applications
 In Proc. of the 20th ACM Symposium on Computational Geometry (SoCG’04
, 2004
"... For a set S of points in R d,ansspanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidean distance between the points. In this paper we propose a new sparse (1 + ε)spanner with O(n/ε d) edges, where ε is a spe ..."
Abstract

Cited by 35 (5 self)
 Add to MetaCart
For a set S of points in R d,ansspanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidean distance between the points. In this paper we propose a new sparse (1 + ε)spanner with O(n/ε d) edges, where ε is a specified parameter. The key property of this spanner is that it can be efficiently maintained under dynamic insertion or deletion of points, as well as under continuous motion of the points in both the kinetic data structures setting and in the more realistic blackbox displacement model we introduce. Our deformable spanner succinctly encodes all proximity information in a deforming point cloud, giving us efficient kinetic algorithms for problems such as the closest pair, the near neighbors of all points, approximate nearest neighbor search (aka approximate Voronoi diagram), wellseparated pair decomposition, and approximate kcenters. 1
An experimental analysis of selfadjusting computation
 In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI
, 2006
"... Selfadjusting computation uses a combination of dynamic dependence graphs and memoization to efficiently update the output of a program as the input changes incrementally or dynamically over time. Related work showed various theoretical results, indicating that the approach can be effective for a r ..."
Abstract

Cited by 34 (18 self)
 Add to MetaCart
Selfadjusting computation uses a combination of dynamic dependence graphs and memoization to efficiently update the output of a program as the input changes incrementally or dynamically over time. Related work showed various theoretical results, indicating that the approach can be effective for a reasonably broad range of applications. In this article, we describe algorithms and implementation techniques to realize selfadjusting computation and present an experimental evaluation of the proposed approach on a variety of applications, ranging from simple list primitives to more sophisticated computational geometry algorithms. The results of the experiments show that the approach is effective in practice, often offering orders of magnitude speedup from recomputing the output from scratch. We believe this is the first experimental evidence that incremental computation of any type is effective in practice for a reasonably broad set of applications.
Maintaining Approximate Extent Measures of Moving Points
 In Proc. 12th ACMSIAM Sympos. Discrete Algorithms
, 2001
"... We present approximation algorithms for maintaining various descriptors of the extent of moving points in R d . We first describe a data structure for maintaining the smallest orthogonal rectangle containing the point set. We then use this data structure to maintain the approximate diameter, smal ..."
Abstract

Cited by 31 (4 self)
 Add to MetaCart
We present approximation algorithms for maintaining various descriptors of the extent of moving points in R d . We first describe a data structure for maintaining the smallest orthogonal rectangle containing the point set. We then use this data structure to maintain the approximate diameter, smallest enclosing disk, width, and smallest area or perimeter bounding rectangle of a set of moving points in R 2 so that the number of events is only a constant. This contrasts with\Omega\Gamma n 2 ) events that data structures for the maintenance of those exact properties have to handle. 1 Introduction With the rapid advances in positioning systems, e.g., GPS, adhoc networks, and wireless communication, it is becoming increasingly feasible to track and record the changing position of continuously moving objects. These developments have raised a wide range of challenging geometric problems involving moving objects, including efficient data structures for answering proximity queries, fo...