Corpus ID: 11980096

Three-Dimensional Constrained Delaunay Triangulation: a Minimalist Approach

@inproceedings{Cavalcanti1999ThreeDimensionalCD,
  title={Three-Dimensional Constrained Delaunay Triangulation: a Minimalist Approach},
  author={P. R. Cavalcanti and U. Mello},
  booktitle={IMR},
  year={1999}
}
  • P. R. Cavalcanti, U. Mello
  • Published in IMR 1999
  • Computer Science
  • In this paper we summarize our experiences with 3D constrained Delaunay triangulation algorithms for industrial applications. In addition, we report a robust implementat ion process for constructing 3D constrained triangulations from initial unconstrained triangulations, based on a minimalist approach, in which we minimize the use of geometrical operations such as intersections. This is achieved by inserting Steiner points on missing constraining edges and faces in the initial unconstrai ned… CONTINUE READING
    47 Citations
    How far flipping can go towards 3D conforming/constrained triangulation
    • 21
    3D Triangulations for Industrial Applications
    • 1
    • PDF
    A point-placement strategy for conforming Delaunay tetrahedralization
    • 107
    • PDF

    References

    SHOWING 1-10 OF 35 REFERENCES
    Delaunay triangulation in computational fluid dynamics
    • 116
    • PDF
    Approximating constrained tetrahedrizations
    • C. Hazlewood
    • Mathematics, Computer Science
    • Comput. Aided Geom. Des.
    • 1993
    • 28
    Construction of three-dimensional Delaunay triangulations using local transformations
    • B. Joe
    • Mathematics, Computer Science
    • Comput. Aided Geom. Des.
    • 1991
    • 257
    • Highly Influential
    Shape reconstruction from planar cross sections
    • 512
    Results on triangulation and high quality mesh generation
    • 18