Elsevier

Computers & Graphics

Volume 17, Issue 5, September–October 1993, Pages 563-574
Computers & Graphics

Technical section
Algorithm and data structure for triangulating multiply connected polygonal domains

https://doi.org/10.1016/0097-8493(93)90007-VGet rights and content

Abstract

A fast algorithm for triangulating multiply connected polygonal domains is presented. The algorithm is an application of the ideas presented in [25], to arbitrary domains. The main contributions are the extension of range searching to handle arbitrary domains and constraint edges, and the generation of the output on the fly without storing triangles that lie outside the valid region.

References (25)

  • W.H. Frey et al.

    Fast planar mesh generation using the Delaunay triangulation

    General Motors Res. Publ. GMR-4555

    (1983)
  • F. Preparata et al.

    Computational Geometry—An Introduction

    (1985)
  • Cited by (18)

    • Procedural method for terrain surface interpolation

      1996, Computers and Graphics (Pergamon)
    • Tessellating trimmed nurbs surfaces

      1995, Computer-Aided Design
    • An edge-prior DEM construction algorithm for open-pit coal mine

      2015, Meitan Xuebao/Journal of the China Coal Society
    • A NURBS-based triangulation method for 3D ship hull simulation

      2013, International Journal of Online Engineering
    View all citing articles on Scopus

    On leave from Renault Direction de la Recherche, France.

    View full text