new refs

Manual/doc_tex/Manual/geom.bib

@@ -1753,6 +1753,14 @@ cell neighborhood in $O(m)$ time."
 , update =	"98.03 mitchell"
 }
 
+@inproceedings{acr-icb-03
+, author =      "Nina Amenta and Sunghee Choi and G{\"u}nter Rote"
+, title =       "Incremental constructions con BRIO"
+, booktitle =   "Proc. 19th Annu. Sympos. Comput. Geom."
+, year =        2003
+, pages =       "211-219"
+}
+
 @inproceedings{ad-aats-97
 , author =	"Pankaj K. Agarwal and Pavan K. Desikan"
 , title =	"An efficient algorithm for terrain simplification"
@@ -44296,6 +44304,18 @@ Contains C code."
 , abstract =	"This paper present how space of spheres and shelling can be used to delete efficiently a point from d-dimensional triangulation.  In 2-dimension, if k is the degree of the deleted vertex, the complexity is $O(k\log k)$, but we notice that this number apply only to low cost operations; time consuming computations are done only a linear number of times.  This algorithm can be viewed as a variation of Heller algorithm which is popular in the geographic information system community. Unfortunately Heller algorithm is false as explained in this paper."
 }
 
+@techreport{d-vrtdd-09
+,  author      = "Olivier Devillers"
+,  title       = "Vertex Removal in Two Dimensional {Delaunay} Triangulation: 
+                  Asymptotic Complexity is Pointless"
+, thanks = "triangles"
+,  institution = "INRIA"
+,  year        = 2009
+,  type        = "Research Report"
+,  number      = 7104
+,  url         = "http://hal.inria.fr/inria-00433107/"
+}
+
 @inproceedings{d-ddt-99
 , author =	"Olivier Devillers"
 , title =	"On Deletion in {Delaunay} Triangulation"