Sciweavers

3 search results - page 1 / 1
» Constant-Level Greedy Triangulations Approximate the MWT Wel...
Sort
View
JCO
1998
96views more  JCO 1998»
13 years 10 months ago
Constant-Level Greedy Triangulations Approximate the MWT Well
Oswin Aichholzer, Franz Aurenhammer, Günter R...
OA
1989
237views Algorithms» more  OA 1989»
14 years 3 months ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph
SGP
2003
14 years 11 days ago
Provably Good Surface Sampling and Approximation
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point” technique proposed by Chew. Given a surface S, it progressively adds poin...
Steve Oudot, Jean-Daniel Boissonnat