Systematic local flip rules are generalized Delaunay rules (Extended Abstract) (ResearchIndex)

Systematic local flip rules are generalized Delaunay rules (Extended Abstract) (1993) (Make Corrections)
Timothy Lambert

Home/Search Context Related

View or download:
unsw.edu.au/pub/users/andrewt...92.ps.Z
unsw.edu.au/school/publicat...308.ps.gz
Cached:  PS.gz  PS  PDF  DjVu  Image  Update  Help

From:  unsw.edu.au/sch...SE_publications (more)
Homepages:  T.Lambert  [2]  HPSearch  (Update Links)

Rate this article:

(best)
Comment on this article

(Enter summary)
Abstract: ) Timothy Lambert Abstract A locally optimized triangulation (LOT) of a set of sites can be defined by a flip rule that determines which diagonal of a convex quadrilateral should be included in the triangulation. A flip rule is systematic if there is a unique LOT. It is local if the only new edges added when inserting a new site in the triangulation are adjacent to the new site. I prove that the only systematic local flip rules correspond to generalizations of convex distance function... (Update)

Similar documents (at the sentence level):
5.0%: The Delaunay triangulation maximizes the mean inradius - Lambert (1994) (Correct)

Active bibliography (related documents): More All
0.2: Calculus and Numerics on Levi-Civita Fields - Berz (1996) (Correct)
0.2: Exponentiation in power series fields - Kuhlmann, Kuhlmann, Shelah (1996) (Correct)
0.2: Ordinals and Interactive Programs - Hancock (2000) (Correct)

Similar documents based on text: More All
0.3: Local Optimization of Triangular Surface Meshes for General.. - Jaromczyk, Wang (Correct)
0.2: Nonlinear Wave Equations For Relativity - van Putten, Eardley (1995) (Correct)
0.2: Simple Polygons that Cannot be Deflated - Thomas Fevens Mcgill (Correct)

BibTeX entry: (Update)

@inproceedings{ lambertlambertsystematic,
    author = "Timothy Lambert",
    title = "Systematic local flip rules are generalized Delaunay rules",
    pages = "352--357",
    url = "citeseer.nj.nec.com/lambert93systematic.html" }

Citations (may not include all citations):
684 Computer Graphics: Principles and Practice (context) - Foley, van Dam et al. - 1990
219 Primitives for the manipulation of general subdivisions and .. (context) - Guibas, Stolfi - 1985
201 Voronoi diagrams---a survey of a fundamental geometric data .. (context) - Aurenhammer - 1991
102 Mesh generation and optimal triangulation - Bern, Eppstein - 1992
85 Randomized incremental construction of Delaunay and Voronoi .. (context) - Guibas, Knuth et al. - 1992
76 the angle condition in the finite element method (context) - Babuska, Aziz - 1976
49 Two algorithms for constructing the Delaunay triangulation (context) - Lee, Schachter - 1980
29 Locally equiangular triangulations (context) - Sibson - 1978
25 International Computer Science Institute (context) - Omohundro, triangulation et al. - 1990
8 Generation of a triangular grid with application to contour .. (context) - Lawson - 1972
5 volume 400 of Lecture Notes in Computer Science (context) - Klein, Abstract - 1989
5 Surface representation based on triangular grids (context) - De Floriani - 1987
4 An introduction to the theory of surreal numbers (context) - Gonshor - 1986
2 Local optimization of triangulations (context) - Lambert - 1993
1 Zur kinematischen Ordnung ebener JordenKurven (context) - Bol - 1936
1 Surface construction based upon triangulations (context) - Nielson, Franke - 1983
1 Ein Satz uber konvexe geschlossene Kurven (context) - Fujiwara - 1920
1 A practical algorithm for computing the Delaunay triangulati.. (context) - Scot - 1990

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