Removing Local Concavities from Delaunay Triangulations (ResearchIndex)

Removing Local Concavities from Delaunay Triangulations (1994) (Make Corrections)
J.R. Davy, P.M. Dew

View or download:
agora.leeds.ac.uk/scs/doc/...94_26.ps.Z
Cached:  PS.gz  PS  PDF  DjVu  Image  Update  Help

From:  indiana.edu/pub/ucstri/index (more)
Homepages:  J.Davy  [2]  [3]  P.Dew
  HPSearch  (Update Links)

Rate this article:

(best)
Comment on this article

(Enter summary)
Abstract: A number of algorithms for constructing two-dimensional Delaunay triangulations build the triangulation incrementally within a bounding `supertriangle', finally removing the vertices of the supertriangle and edges incident to them. It is shown that such methods may leave potentially large concavities within the boundary of the ensuing triangulation. An upper bound on the size of such concavities is derived and an efficient post-processing algorithm to remove them is presented. Keywords:... (Update)

Active bibliography (related documents): More All
0.5: De la géometrie algorithmique à la construction.. - George (1998) (Correct)
0.5: CARABEAMER: A Treatment Planner for a Robotic.. - Tombropoulos, Adler.. (1998) (Correct)
0.2: Parallel 3D Delaunay Triangulation - Cinoni, Montani, Pereo, Scopino (Correct)

Similar documents based on text: More All
0.2: Parallel CSG, Skeletons and Performance Modelling - Deldari, Davy, Dew (1996) (Correct)
0.2: Constructive Solid Geometry Using Algorithmic Skeletons - Davy, Deldari, Dew (1996) (Correct)
0.1: Snakes, Shapes, and Gradient Vector Flow - Xu, Prince (1998) (Correct)

BibTeX entry: (Update)

@misc{ davy-removing,
  author = "J.R. Davy and P.M. Dew",
  title = "Removing Local Concavities from Delaunay Triangulations",
  url = "citeseer.nj.nec.com/davy94removing.html" }

Citations (may not include all citations):
216 Primitives for the manipulation of general subdivisions and .. (context) - Guibas, Stolfi - 1985
49 Two algorithms for constructing a Delaunay triangulation (context) - Lee, Shachter - 1980
44 Shape reconstructions from planar cross-sections (context) - Boissonnat - 1986
32 surface interpolation (context) - Lawson - 1987
21 A faster divide-and-conquer algorithm for constructing Delau.. (context) - Dwyer - 1987
16 dimensional Delaunay tesselation with application to Voronoi.. (context) - Watson, n- - 1981
10 A Delaunay-based representation of surfaces defined over arb.. (context) - De Floriani, Falcidieno et al. - 1985
7 A note on improving the performance of Delaunay triangulatio.. (context) - Davy, Dew - 1989
2 octree meshing with adaptive analysis (context) - Cheng, Finnegan et al. - 1988
2 An implementation of Watson's algorithm for computing 2-dime.. (context) - Sloan, Houlsby - 1984

Documents on the same site (http://www.cs.indiana.edu/pub/ucstri/index): More
Environment Modelling for Mobile Robots: Neural Learning for.. - van Dam (1998) (Correct)
Broadcasting in Butterfly and DeBruijn Networks - Klasing, Monien, Peine, Stöhr (1992) (Correct)
ILFA - A Project in Experimental Logic Computation - Dunker, Flögel, Büning.. (Correct)

Online articles have much greater impact More about CiteSeer Add search form to your site Submit documents Feedback