Fully dynamic delaunay triangulation in logarithmic expected time per operation
نویسندگان
چکیده
منابع مشابه
Fully Dynamic Delauney Triangulation in Logarithmic Expected Time per Operation
The Delaunay Tree is a hierarchical data structure that has been introduced in [7] and analyzed in [6, 4]. For a given set of sites S in the plane and an order of insertion for these sites, the Delaunay Tree stores all the successive Delaunay triangulations. As proved before, the Delaunay Tree allows the insertion of a site in logarithmic expected time and linear expected space, when the insert...
متن کاملFully Dynamic Delaunay Triangulation in Logarithmic Expected Time per Operation Triangulation de Delaunay pleinement dynamique en temps moyen logarithmique par op eration
The Delaunay Tree is a hierarchical data structure that has been introduced in [6] and analyzed in [7,4]. For a given set of sites S in the plane and an order of insertion for these sites, the Delaunay Tree stores all the successive Delaunay triangulations. As proved before, the Delaunay Tree allows the insertion of a site in logarithmic expected time and linear expected space, when the inserti...
متن کاملThe Expected Extremes in a Delaunay Triangulation
We give an expected-case analysis of Delaunay triangulations. To avoid edge effects we consider a unit-intensity Poisson process in Euclidean d-space, and then limit attention to the portion of the triangulation within a cube of side n1/d. For d equal to two, we calculate the expected maximum edge length, the expected minimum and maximum angles, and the average aspect ratio of a triangle. We al...
متن کاملA Comparison of Two Fully-Dynamic Delaunay Triangulation Methods
Two fully-dynamic Delaunay triangulation methods, which differ in their point-location strategies, are proposed. One method is derived from the (bucket-based) BucketInc scheme of Su and Drysdale. The other is a new method based on a quadtree partitioning of the triangulation domain. The two methods are compared experimentally, and their relative merits discussed.
متن کاملDynamic Parallel 3D Delaunay Triangulation
Delaunay meshing is a popular technique for mesh generation. Usually, the mesh has to be refined so that certain fidelity and quality criteria are met. Delaunay refinement is achieved by dynamically inserting and removing points in/from a Delaunay triangulation. In this paper, we present a robust parallel algorithm for computing Delaunay triangulations in three dimensions. Our triangulator offe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1992
ISSN: 0925-7721
DOI: 10.1016/0925-7721(92)90025-n