New Results on Dynamic Planar Point Location
نویسندگان
چکیده
A point location scheme is presented for an n-veriet dynamic planar subdivision whose underlying graph is only required to be connected. The scheme uses O(n) space, yields an O(log2 n) query time and an O(1ogn) update time. Insertion (resp. deleiion) of an arbitrary k-edge chain inside a region can be performed in O(klog(n+k)) (resp. O(k1ogn)) iime. The scheme is then ectended to speed up the insertion/deletion of a kedge monotone chain to O(log2nloglogn+k) time (or O(1ogn loglogn + k) iime for an oltemative model of input), but ai ihe ecpense of increasing the other time bounds slightly. All bounds are worst-case. Additional results include a generalizaiion to planar subdivisions consisting of algebraic segments of bounded degree and a persistent scheme for planar point location.
منابع مشابه
Energy Dissipation Rate Control Via a Semi-Analytical Pattern Generation Approach for Planar Three-Legged Galloping Robot based on the Property of Passive Dynamic Walking
In this paper an Energy Dissipation Rate Control (EDRC) method is introduced, which could provide stable walking or running gaits for legged robots. This method is realized by developing a semi-analytical pattern generation approach for a robot during each Single Support Phase (SSP). As yet, several control methods based on passive dynamic walking have been proposed by researchers to provide an...
متن کاملDynamic Behavior Analysis of a Planar Four-bar Linkage with Multiple Clearances Joint
In practice, clearances in the joints are inevitable due to tolerances, and defects arising from design and manufacturing. In the presence of clearance at a joint, a mechanism gains some additional, uncontrollable degrees of freedom which are the source of error. Moreover, joints undergo wear and backlashes and so cannot be used in precision mechanisms. In this study, the dynamic behaviour of ...
متن کاملA Uniied Approach to Dynamic Point Location, Ray Shooting and Shortest Paths in Planar Maps a Uniied Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps
We describe a new technique for dynamically maintaining the trapezoidal decomposition of a planar map M with n vertices, and apply it to the development of a uniied dynamic data structure that supports point-location, ray-shooting, and shortest-path queries in M. The space requirement is O(n logn). Point-location queries take time O(log n). Ray-shooting and shortest-path queries take time O(log...
متن کاملA Space-Efficient Framework for Dynamic Point Location
Let G be a planar subdivision with n vertices. A succinct geometric index for G is a data structure that occupies o(n) bits beyond the space required to store the coordinates of the vertices of G, while supporting efficient queries. We describe a general framework for converting dynamic data structures for planar point location into succinct geometric indexes, provided that the subdivision G to...
متن کاملI/o-eecient Dynamic Planar Point Location
We present the rst provably I/O-e cient dynamic data structure for point location in a general planar subdivision. Our structure uses O(N=B) disk blocks to store a subdivision of size N , where B is the disk block size. Queries can be answered in O(log2 B N) I/Os in the worst-case, and insertions and deletions can be performed in O(log B N) and O(log B N) I/Os amortized, respectively. Previousl...
متن کامل