Oscar Palacios-Velez

  • Citations Per Year
Learn More
A new, dynamic, hierarchical subdivision and recursive algorithm for computing Delaunay triangulations is presented. The algorithm has four main steps: (1) location of the already formed triangle that contains the point (2) identification of other adjoining triangles whose circumcircle contains the point (3) formation of the new triangles, and (4) database(More)
  • 1