Pii: S0925-7721(99)00059-0
نویسندگان
چکیده
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 the objects. We then apply these structures to obtain efficient solutions to two problems: (i) finding a perfect containment matching between a set of points and a set of convex fat objects, and (ii) finding a piercing set for a collection of convex fat objects, whose size is optimal up to some constant factor. 2000 Elsevier Science B.V. All rights reserved.
منابع مشابه
Pii: S0925-7721(99)00036-x
A (not necessarily convex) object C in the plane is κ-curved for some constant 0 < κ < 1, if it has constant description complexity, and for each pointp on the boundary ofC, one can place a diskB ⊆ C of radius κ ·diam(C) whose boundary passes throughp. We prove that the combinatorial complexity of the boundary of the union of a set C of n κ-curved objects (e.g., fat ellipses or rounded heart-sh...
متن کاملPii: S0925-7721(99)00016-4
Define a graph GT (n) with one node for each triangulation of a convex n-gon. Place an edge between each pair of nodes that differ by a single flip: two triangles forming a quadrilateral are exchanged for the other pair of triangles forming the same quadrilateral. In this paper we introduce a tree of all triangulations of polygons with any number of vertices which gives a unified framework in w...
متن کاملPii: S0925-7721(01)00059-1
This paper introduces a new approach for improving the performance and versatility of Layered Manufacturing (LM), which is an emerging technology that makes it possible to build physical prototypes of 3D parts directly from their computer models using a “3D printer” attached to a personal computer. Current LM processes work by viewing the computer model as a single, monolithic unit. By contrast...
متن کاملPii: S0925-7721(01)00015-3
In this paper we present a heuristic to reconstruct nonsmooth curves with multiple components. Experiments with several input data reveals the effectiveness of the algorithm in contrast with the other competing algorithms. 2001 Elsevier Science B.V. All rights reserved.
متن کامل