A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces

Dominique Attali, Jean-Daniel Boissonnat. A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces. Discrete & Computational Geometry, 31(3):369-384, 2004. [doi]

@article{AttaliB04,
  title = {A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces},
  author = {Dominique Attali and Jean-Daniel Boissonnat},
  year = {2004},
  doi = {10.1007/s00454-003-2870-4},
  url = {http://dx.doi.org/10.1007/s00454-003-2870-4},
  researchr = {https://researchr.org/publication/AttaliB04},
  cites = {0},
  citedby = {0},
  journal = {Discrete & Computational Geometry},
  volume = {31},
  number = {3},
  pages = {369-384},
}