diff --git a/Documentation/doc/biblio/geom.bib b/Documentation/doc/biblio/geom.bib index 30ee53b25c4..f92a1b5cbd5 100644 --- a/Documentation/doc/biblio/geom.bib +++ b/Documentation/doc/biblio/geom.bib @@ -189,7 +189,7 @@ @manual{-t1-78 } @techreport{a-am3sa-91 -, author = "C. Aarmstrong" +, author = "C. Armstrong" , title = "Abstraction and meshing of 3d stress analysis models" , type = "Progress Report" , institution = "SERC Directorate" @@ -7875,7 +7875,7 @@ @article{aw-dtdch-76 @article{ah-epmfc-77 , author = "K. Appel and W. Haken" -, title = "Every planar map is four colourable, Part {I}: discharging" +, title = "Every planar map is four colorable, Part {I}: discharging" , journal = "Illinois J. Math." , volume = 21 , year = 1977 @@ -28105,7 +28105,7 @@ @inproceedings{b-rcga-90 } @inproceedings{b-afvab-91 -, author = "B. Bruenning" +, author = "L. Bruenning" , title = "Air Force Vulnerability Analyses from {BRL-CAD} models" , booktitle = "Proc. BRL-CAD Symposium `91" , publisher = "American Defense Preparadness Assoc." @@ -42334,7 +42334,7 @@ @article{d-dseti-87 , pages = "122--128" , annote = "Describes some choices for data structures for representing a triangulation, and methods for - point-location, edge-neighbour and vertex-neighbour + point-location, edge-neighbor and vertex-neighbor problems." } @@ -48823,7 +48823,7 @@ @article{d-clstf-82 @article{d-cpcp-89 , author = "Z. Drezner" -, title = "Conditional $p$-centre problems" +, title = "Conditional $p$-center problems" , journal = "Transp. Sci." , volume = 23 , number = 1 @@ -52672,13 +52672,14 @@ @article{es-otatd-91 , pages = "259--277" } -@article{es-nfnpp-? +@article{es-nfnpp-89 , author = "H. Edelsbrunner and Steven S. Skiena" , title = "On the number of furthest neighbour pairs in a point set" , journal = "Amer. Math. Monthly" -, volume = "?" -, year = "?" -, pages = "?" +, volume = "96" +, number = "7" +, year = "1989" +, pages = "614--618" , keywords = "pointset, furthest pair" , succeeds = "es-nfnpp-86" , update = "98.03 mitchell, 95.09 korneenko" @@ -52692,7 +52693,7 @@ @techreport{es-nfnpp-86 , institution = "Dept. Comput. Sci., Univ. Illinois" , address = "Urbana, IL" , year = 1986 -, precedes = "es-nfnpp-?" +, precedes = "es-nfnpp-89" , update = "98.03 mitchell, 95.09 korneenko" } @@ -58899,7 +58900,7 @@ @article{fcm-eergm-87 @inproceedings{fs-erqnn-95 , author = "Robin Y. Flatland and Charles V. Stewart" -, title = "Extending Range Queries and Nearest Neighbours" +, title = "Extending Range Queries and Nearest Neighbors" , booktitle = "Proc. 7th Canad. Conf. Comput. Geom." , year = 1995 , pages = "267--272" @@ -58908,7 +58909,7 @@ @inproceedings{fs-erqnn-95 @article{fs-erqnn-00 , author = "R. Y. Flatland and C. V. Stewart" -, title = "Extending range queries and nearest neighbours" +, title = "Extending range queries and nearest neighbors" , journal = "Comput. Geom. Theory Appl." , volume = 17 , year = 2000 @@ -61110,7 +61111,7 @@ @article{f-tbppf-77 , volume = 23 , year = 1977 , pages = "111--121" -, annote = "Uses Least Diagonal Neighbour Triangulation and Linear +, annote = "Uses Least Diagonal Neighbor Triangulation and Linear approximation over triangles to weighted VD to estimate area of weighted VD polygon of a given tree." } @@ -65127,7 +65128,7 @@ @techreport{gm-ctfma-85 , title = "A computational theoretic framework for {Minkowski} addition and decomposition of boundary represented regions" , type = "Report" , number = "??" -, institution = "National Centre Softw. Develop. Comput. Tech., Tata Inst. Fund. Res." +, institution = "National Centre for Softw. Develop. and Comput. Tech., Tata Inst. of Fund. Res." , address = "Bombay, India" , year = 1985 } @@ -70200,7 +70201,7 @@ @techreport{g-pcief-91 @article{g-pcief-92 , author = "S. Guha" -, title = "Parallel computation of internal and external farthest neighbours in simple polygons" +, title = "Parallel computation of internal and external farthest neighbors in simple polygons" , journal = "Internat. J. Comput. Geom. Appl." , volume = 2 , number = 2 @@ -76237,7 +76238,7 @@ @inproceedings{hns-saiia-89 @inproceedings{hns-saann-88 , author = "K. Hinrichs and J. Nievergelt and P. Schorn" -, title = "A sweep algorithm for the all-nearest-neighbours problem" +, title = "A sweep algorithm for the all-nearest-neighbors problem" , booktitle = "Computational Geometry and its Applications" , nickname = "CG '88" , site = "W{\"u}rzburg" @@ -76264,7 +76265,7 @@ @article{hns-arsa2-92 @inproceedings{hns-arsa2-90 , author = "K. Hinrichs and J. Nievergelt and P. Schorn" -, title = "An all-round sweep algorithm for $2$-dimensional nearest-neighbour problems" +, title = "An all-round sweep algorithm for $2$-dimensional nearest-neighbor problems" , booktitle = "Proc. 2nd Canad. Conf. Comput. Geom." , year = 1990 , pages = "343--346" @@ -102354,7 +102355,7 @@ @techreport{m-pst-81 , title = "Priority search trees" , type = "Technical {Report}" , number = "CSL-81-5" -, institution = "XEROX Palo Alto Research Centre" +, institution = "XEROX Palo Alto Research Center" , address = "Palo Alto, CA" , year = 1981 , update = "97.11 bibrelex" @@ -108313,7 +108314,7 @@ @inproceedings{mnrsy-paall-97 @inproceedings{mnsw-cnnsq-95 , author = "David M. Mount and Nathan S. Netanyahu and Ruth Silverman and Angela Y. Wu" -, title = "Chromatic Nearest Neighbour Searching: a Query Sensitive Approach" +, title = "Chromatic Nearest Neighbor Searching: a Query Sensitive Approach" , booktitle = "Proc. 7th Canad. Conf. Comput. Geom." , year = 1995 , pages = "261--266" @@ -108323,7 +108324,7 @@ @inproceedings{mnsw-cnnsq-95 @article{mnsw-cnnsq-00 , author = "David M. Mount and Nathan S. Netanyahu and Ruth Silverman and Angela Y. Wu" -, title = "Chromatic Nearest Neighbour Searching: a Query Sensitive Approach" +, title = "Chromatic Nearest Neighbor Searching: a Query Sensitive Approach" , journal = "Comput. Geom. Theory Appl." , volume = 17 , year = 2000 @@ -109256,7 +109257,7 @@ @incollection{m-spcgt-92 , update = "95.01 korneenko" , annote = "Exposition of author's research in CGeo \& CTop in three directions: geometric modelling algorithms via partition - of unity; discrete analogue of the index of vector field + of unity; discrete analog of the index of vector field rotation for singular point and separatrix search; distance functions and shortest paths on metric spaces." } @@ -133233,7 +133234,7 @@ @article{sdt-opsal-91 @incollection{s-bdnni-81 , author = "R. Sibson" -, title = "A Brief Description of Natural Neighbour Interpolation" +, title = "A Brief Description of Natural Neighbor Interpolation" , editor = "Vic Barnet" , booktitle = "Interpreting Multivariate Data" , publisher = "John Wiley \& Sons" @@ -141509,7 +141510,7 @@ @article{t-cvor-88 @incollection{ty-vrndt-88 , author = "J. Toriwaki and S. Yokoi" -, title = "Voronoi and related neighbours on digitized two-dimensional space with applications to texture analysis" +, title = "Voronoi and related neighbors on digitized two-dimensional space with applications to texture analysis" , editor = "G. T. Toussaint" , booktitle = "Computational Morphology" , publisher = "North-Holland"