The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] tetrahedralization(1hit)

1-1hit
  • Structures of Triangulations of Points

    Keiko IMAI  

     
    INVITED SURVEY PAPER-Algorithms for Geometric Problems

      Vol:
    E83-D No:3
      Page(s):
    428-437

    Triangulations have been one of main research topics in computational geometry and have many applications in computer graphics, finite element methods, mesh generation, etc. This paper surveys properties of triangulations in the two- or higher-dimensional spaces. For triangulations of the planar point set, we have a good triangulation, called the Delaunay triangulation, which satisfies several optimality criteria. Based on Delaunay triangulations, many properties of planar triangulations can be shown, and a graph structure can be constructed for all planar triangulations. On the other hand, triangulations in higher dimensions are much more complicated than in planar cases. However, there does exist a subclass of triangulations, called regular triangulations, with nice structure, which is also touched upon.