Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

SODA
2004
ACM

favoriteEmaildiscussreport

94views Algorithms» more SODA 2004»

A time efficient Delaunay refinement algorithm

13 years 5 months ago

A time efficient Delaunay refinement algorithm

Download www.cs.cmu.edu

In this paper we present a Delaunay refinement algorithm for generating good aspect ratio and optimal size triangulations. This is the first algorithm known to have sub-quadratic running time. The algorithm is based on the extremely popular Delaunay refinement algorithm of Ruppert. We know of no prior refinement algorithm with an analyzed subquadratic time bound. For many natural classes of meshing problems, our time bounds are comparable to know bounds for quadtree methods.

Gary L. Miller

Real-time Traffic

Algorithms | Delaunay Refinement Algorithm | Prior Refinement Algorithm | Refinement Algorithm | SODA 2004 |

claim paper

Related Content

» An Efficient Query Structure for Mesh Refinement

» Selfimproving algorithms for delaunay triangulations

» Efficient minimum spanning tree construction without Delaunay triangulation

» On Deletion in Delaunay Triangulations

» Efficient Linear Macromodeling via DiscreteTime TimeDomain Vector Fitting

» Adaptive parametrization of multivariate Bsplines for image registration

» Filtering and Refinement A TwoStage Approach for Efficient and Effective Anomaly Detection

» Accurate integration of multiview range images using kmeans clustering

» Refined statistical static timing analysis through

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2004
Where	SODA
Authors	Gary L. Miller

Comments (0)