A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions

Details A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions

2005-01-04

arxiv.org/abs/cs/0501007v1

Computer Science

Computational Geometry

Scientific paper

We propose a new refinement algorithm to generate size-optimal
quality-guaranteed Delaunay triangulations in the plane. The algorithm takes
$O(n \log n + m)$ time, where $n$ is the input size and $m$ is the output size.
This is the first time-optimal Delaunay refinement algorithm.

Affiliated with

Also associated with

No associations

Rating

A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-531791