• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron.

Nina AmentaDominique AttaliOlivier Devillers
Published in: Discret. Comput. Geom. (2012)
Keyphrases
  • delaunay triangulation
  • lower bound
  • sample points
  • convex hull
  • triangular mesh
  • topology preserving
  • delaunay triangulations
  • neural network
  • point sets
  • point cloud
  • competitive learning
  • voronoi diagram