Results 1  10
of
41
Improved Incremental Randomized Delaunay Triangulation
, 1997
"... We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, and small memory occupation. The location ..."
Abstract

Cited by 44 (9 self)
 Add to MetaCart
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, and small memory occupation. The location
The Delaunay hierarchy
 Internat. J. Found. Comput. Sci
"... We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small memory occupation and the possibility of fully dynamic insertions and deletions. The location structure is organized into s ..."
Abstract

Cited by 36 (6 self)
 Add to MetaCart
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small memory occupation and the possibility of fully dynamic insertions and deletions. The location structure is organized into several levels. The lowest level just consists of the triangulation, then each level contains the triangulation of a small sample of the level below. Point location is done by walking in a triangulation to determine the nearest neighbor of the query at that level, then the walk restarts from that neighbor at the level below. Using a small subset (3%) to sample a level allows a small memory occupation; the walk and the use of the nearest neighbor to change levels quickly locate the query.
Design and Implementation of a Practical Parallel Delaunay Algorithm
, 1999
"... This paper describes the design and implementation of a practical parallel algorithm for Delaunay triangulation that works well on general distributions. Although there have been many theoretical parallel algorithms for the problem, and some implementations based on bucketing that work well for unif ..."
Abstract

Cited by 31 (4 self)
 Add to MetaCart
This paper describes the design and implementation of a practical parallel algorithm for Delaunay triangulation that works well on general distributions. Although there have been many theoretical parallel algorithms for the problem, and some implementations based on bucketing that work well for uniform distributions, there has been little work on implementations for general distributions. We use the well known reduction of 2D Delaunay triangulation to find the 3D convex hull of points on a paraboloid. Based on this reduction we developed a variant of the Edelsbrunner and Shi 3D convex hull algorithm, specialized for the case when the point set lies on a paraboloid. This simplification reduces the work required by the algorithm (number of operations) from O(n log^2 n) to O(n log n). The depth (parallel time) is O(log^3 n) on a CREW PRAM. The algorithm is simpler than previous O(n log n) work parallel algorithms leading to smaller constants. Initial experiments using a variety of distributions showed that our parallel algorithm was within a factor of 2 in work from the best sequential algorithm. Based on these promising results, the algorithm was implemented using C and an MPIbased toolkit. Compared with previous work, the resulting implementation achieves significantly better speedups over good sequential code, does not assume a uniform distribution of points, and is widely portable due to its use of MPI as a communication mechanism. Results are presented for the IBM SP2, Cray T3D, SGI Power Challenge, and DEC AlphaCluster.
An Empirical Comparison of Techniques for Updating Delaunay Triangulations
, 2004
"... The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic data structures can be used to maintain the triangulation. However, there has been little work so far on how to maintain the ..."
Abstract

Cited by 24 (2 self)
 Add to MetaCart
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic data structures can be used to maintain the triangulation. However, there has been little work so far on how to maintain the triangulation when the points move without explicit motion plans, as in the case of a physical simulation. In this paper we examine how to update Delaunay triangulations after small displacements of the defining points, as might be provided by a physicsbased integrator. We have implemented a variety of update algorithms, many new, toward this purpose. We ran these algorithms on a corpus of data sets to provide running time comparisons and determined that updating Delaunay can be significantly faster than recomputing.
Developing a Practical ProjectionBased Parallel Delaunay Algorithm
 in 12th Annual Symposium on Computational Geometry
, 1996
"... In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in Scientific Computation. Although there have been many theoretical algorithms for the problem, and some implementations b ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in Scientific Computation. Although there have been many theoretical algorithms for the problem, and some implementations based on bucketing that work well for uniform distributions, there has been little work on implementations for general distributions. We use the well known reduction of 2D Delaunay triangulation to 3D convex hull of points on a sphere or paraboloid. A variant of the Edelsbrunner and Shi 3D convex hull is used, but for the special case when the point set lies on either a sphere or a paraboloid. Our variant greatly reduces the constant costs from the 3D convex hull algorithm and seems to be a more promising for a practical implementation than other parallel approaches. We have run experiments on the algorithm using a variety of distributions that are motivated by various problems that use Delau...
Lecture Notes on Delaunay Mesh Generation
, 1999
"... purposes notwithstanding any copyright annotation thereon. The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of the ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
purposes notwithstanding any copyright annotation thereon. The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of the
Some Integral Geometry Tools to Estimate the Complexity of 3D Scenes
, 1997
"... Many problems in computer graphics deal with complex 3D scenes where visibility, proximity, collision detection queries have to be answered. Due to the complexity of these queries and the one of the models they are applied to, data structures most often based on hierarchical decompositions have been ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
Many problems in computer graphics deal with complex 3D scenes where visibility, proximity, collision detection queries have to be answered. Due to the complexity of these queries and the one of the models they are applied to, data structures most often based on hierarchical decompositions have been proposed to solve them. As a result of these involved algorithms/data structures, most of the analysis have been carried out in the worst case and fail to report good average case performances in a vast majority of cases. The goal of this work is therefore to investigate geometric probability tools to characterize average case properties of standard scenes such as architectural scenes, natural models, etc under some standard visibility and proximity requests. In the first part we recall some fundamentals of integral geometry and discuss the classical assumption of measures invariant under the group of motions in the context of non uniform models. In the second one we present simple generali...
Tetrahedra Based Volume Visualization
, 1998
"... . Volume Visualization techniques have advanced considerably since the first international symposium held on this topic eight years ago. This paper briefly reviews the techniques proposed for the visualization of irregular (or scattered) volume datasets. In particular, methods which adopt simplicial ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
. Volume Visualization techniques have advanced considerably since the first international symposium held on this topic eight years ago. This paper briefly reviews the techniques proposed for the visualization of irregular (or scattered) volume datasets. In particular, methods which adopt simplicial decompositions of E 3 space are considered, and this choice is justified both in terms of modeling and visualization. Simplicial complexes are powerful and robust geometric structures, and a number of efficient visualization algorithms have been proposed. We show that simplicial cells (or simply tetrahedral cells since our target is 3D space) may be conceived as being the unifying kernel primitive for the visualization of notregular meshes. 1 Introduction A volume dataset consists of points in E 3 space, with one or more scalar or vector sample values associated with each point. The need for a visual representation of the content of such datasets led to a substantial research effort a...